./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-subst.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-nzb-file-subst.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 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:29:45,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:29:45,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:29:45,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:29:45,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:29:45,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:29:45,242 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:29:45,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:29:45,243 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:29:45,243 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:29:45,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:29:45,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:29:45,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:29:45,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:29:45,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:29:45,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:29:45,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:29:45,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:29:45,245 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:29:45,245 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:29:45,245 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:29:45,245 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:29:45,246 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:29:45,246 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:45,247 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:29:45,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:29:45,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:29:45,248 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 -> 47976145f2a7f206dd7d2e7a0ffeac879f94f33f7a5b87161ebd997173567eb0 [2025-03-08 17:29:45,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:29:45,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:29:45,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:29:45,495 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:29:45,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:29:45,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-03-08 17:29:46,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d825936d5/a40e067c46c145699008f90e56918851/FLAGc51fb1c3d [2025-03-08 17:29:46,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:29:46,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-subst.wvr.c [2025-03-08 17:29:46,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d825936d5/a40e067c46c145699008f90e56918851/FLAGc51fb1c3d [2025-03-08 17:29:47,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d825936d5/a40e067c46c145699008f90e56918851 [2025-03-08 17:29:47,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:29:47,200 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:29:47,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:47,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:29:47,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:29:47,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785e98bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47, skipping insertion in model container [2025-03-08 17:29:47,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,221 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:29:47,371 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-nzb-file-subst.wvr.c[6540,6553] [2025-03-08 17:29:47,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:47,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:29:47,431 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-nzb-file-subst.wvr.c[6540,6553] [2025-03-08 17:29:47,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:29:47,451 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:29:47,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47 WrapperNode [2025-03-08 17:29:47,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:29:47,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:47,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:29:47,454 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:29:47,458 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:29:47" (1/1) ... [2025-03-08 17:29:47,467 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:29:47" (1/1) ... [2025-03-08 17:29:47,509 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 591 [2025-03-08 17:29:47,510 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:29:47,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:29:47,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:29:47,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:29:47,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,539 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 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:29:47,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,554 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,561 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:29:47,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:29:47,563 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:29:47,563 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:29:47,564 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (1/1) ... [2025-03-08 17:29:47,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:29:47,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:47,587 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:29:47,590 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:29:47,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:29:47,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 17:29:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 17:29:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 17:29:47,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:29:47,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:29:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 17:29:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:29:47,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:29:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:29:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:29:47,612 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:29:47,734 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:29:47,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:29:48,344 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:29:48,344 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:29:48,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:29:48,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:29:48,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:48 BoogieIcfgContainer [2025-03-08 17:29:48,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:29:48,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:29:48,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:29:48,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:29:48,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:47" (1/3) ... [2025-03-08 17:29:48,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c20bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:48, skipping insertion in model container [2025-03-08 17:29:48,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:47" (2/3) ... [2025-03-08 17:29:48,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c20bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:48, skipping insertion in model container [2025-03-08 17:29:48,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:48" (3/3) ... [2025-03-08 17:29:48,857 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2025-03-08 17:29:48,869 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:29:48,870 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-subst.wvr.c that has 4 procedures, 38 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-08 17:29:48,870 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:29:48,956 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 17:29:48,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 49 transitions, 119 flow [2025-03-08 17:29:49,015 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2025-03-08 17:29:49,039 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:49,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 12/46 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-08 17:29:49,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 49 transitions, 119 flow [2025-03-08 17:29:49,044 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 45 transitions, 108 flow [2025-03-08 17:29:49,049 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:29:49,059 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;@7d2f1bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:29:49,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-08 17:29:49,074 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:29:49,074 INFO L124 PetriNetUnfolderBase]: 12/44 cut-off events. [2025-03-08 17:29:49,074 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 17:29:49,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:49,075 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:29:49,075 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:29:49,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:49,079 INFO L85 PathProgramCache]: Analyzing trace with hash 654225432, now seen corresponding path program 1 times [2025-03-08 17:29:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948437293] [2025-03-08 17:29:49,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:49,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 17:29:49,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 17:29:49,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:49,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:49,527 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:29:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948437293] [2025-03-08 17:29:49,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948437293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:49,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:49,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:29:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51091557] [2025-03-08 17:29:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:49,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:29:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:49,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:29:49,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:29:49,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:29:49,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:49,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:49,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:29:49,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:50,243 INFO L124 PetriNetUnfolderBase]: 2373/3237 cut-off events. [2025-03-08 17:29:50,243 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2025-03-08 17:29:50,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6649 conditions, 3237 events. 2373/3237 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12259 event pairs, 1692 based on Foata normal form. 0/2556 useless extension candidates. Maximal degree in co-relation 6206. Up to 3234 conditions per place. [2025-03-08 17:29:50,268 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 38 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2025-03-08 17:29:50,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 196 flow [2025-03-08 17:29:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:29:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:29:50,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-08 17:29:50,280 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-03-08 17:29:50,281 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 108 flow. Second operand 3 states and 62 transitions. [2025-03-08 17:29:50,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 196 flow [2025-03-08 17:29:50,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 17:29:50,293 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 122 flow [2025-03-08 17:29:50,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2025-03-08 17:29:50,299 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-03-08 17:29:50,299 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 122 flow [2025-03-08 17:29:50,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:50,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:50,299 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:50,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:29:50,300 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:29:50,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash 671603589, now seen corresponding path program 1 times [2025-03-08 17:29:50,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:50,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92748962] [2025-03-08 17:29:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:50,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:29:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:29:50,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:50,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:29:50,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92748962] [2025-03-08 17:29:50,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92748962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:50,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586357733] [2025-03-08 17:29:50,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:29:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:50,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:50,529 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:29:50,531 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:29:50,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 17:29:50,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 17:29:50,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:29:50,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:50,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 17:29:50,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:29:50,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 17:29:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586357733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:29:50,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:29:50,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-08 17:29:50,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120471825] [2025-03-08 17:29:50,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:29:50,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:29:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:50,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:29:50,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:29:50,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:29:50,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:50,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:50,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:29:50,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:51,334 INFO L124 PetriNetUnfolderBase]: 2373/3246 cut-off events. [2025-03-08 17:29:51,335 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-08 17:29:51,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 3246 events. 2373/3246 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12273 event pairs, 1692 based on Foata normal form. 6/2573 useless extension candidates. Maximal degree in co-relation 6525. Up to 3234 conditions per place. [2025-03-08 17:29:51,351 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 38 selfloop transitions, 15 changer transitions 0/54 dead transitions. [2025-03-08 17:29:51,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 264 flow [2025-03-08 17:29:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:29:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 17:29:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-03-08 17:29:51,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2925170068027211 [2025-03-08 17:29:51,355 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 122 flow. Second operand 6 states and 86 transitions. [2025-03-08 17:29:51,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 264 flow [2025-03-08 17:29:51,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:51,357 INFO L231 Difference]: Finished difference. Result has 47 places, 54 transitions, 212 flow [2025-03-08 17:29:51,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=47, PETRI_TRANSITIONS=54} [2025-03-08 17:29:51,359 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2025-03-08 17:29:51,359 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 54 transitions, 212 flow [2025-03-08 17:29:51,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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:51,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:51,360 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:51,368 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:29:51,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:51,561 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:29:51,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:51,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1245307706, now seen corresponding path program 2 times [2025-03-08 17:29:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144771395] [2025-03-08 17:29:51,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:29:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:51,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-03-08 17:29:51,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-03-08 17:29:51,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:29:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 17:29:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:53,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144771395] [2025-03-08 17:29:53,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144771395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:29:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913965290] [2025-03-08 17:29:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:53,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:29:53,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:53,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:29:53,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:29:53,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:29:53,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:53,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:53,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:29:53,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:53,853 INFO L124 PetriNetUnfolderBase]: 3867/5443 cut-off events. [2025-03-08 17:29:53,853 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2025-03-08 17:29:53,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 5443 events. 3867/5443 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 24874 event pairs, 1692 based on Foata normal form. 1/4412 useless extension candidates. Maximal degree in co-relation 10934. Up to 3132 conditions per place. [2025-03-08 17:29:53,874 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 112 selfloop transitions, 12 changer transitions 2/127 dead transitions. [2025-03-08 17:29:53,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 127 transitions, 623 flow [2025-03-08 17:29:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:29:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:29:53,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-08 17:29:53,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-03-08 17:29:53,876 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 212 flow. Second operand 5 states and 135 transitions. [2025-03-08 17:29:53,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 127 transitions, 623 flow [2025-03-08 17:29:53,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 127 transitions, 599 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:53,879 INFO L231 Difference]: Finished difference. Result has 53 places, 65 transitions, 283 flow [2025-03-08 17:29:53,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=53, PETRI_TRANSITIONS=65} [2025-03-08 17:29:53,879 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 10 predicate places. [2025-03-08 17:29:53,880 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 65 transitions, 283 flow [2025-03-08 17:29:53,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:53,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:53,880 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:53,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:29:53,880 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:29:53,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash 407664732, now seen corresponding path program 3 times [2025-03-08 17:29:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:53,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37574092] [2025-03-08 17:29:53,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:29:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:53,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 3 equivalence classes. [2025-03-08 17:29:53,945 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 36 statements. [2025-03-08 17:29:53,945 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:29:53,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 17:29:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37574092] [2025-03-08 17:29:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37574092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:29:54,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:29:54,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:29:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463910385] [2025-03-08 17:29:54,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:29:54,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:29:54,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:54,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:29:54,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:29:54,643 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:29:54,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 65 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:54,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:54,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:29:54,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:56,420 INFO L124 PetriNetUnfolderBase]: 9256/13013 cut-off events. [2025-03-08 17:29:56,421 INFO L125 PetriNetUnfolderBase]: For 5972/5972 co-relation queries the response was YES. [2025-03-08 17:29:56,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32132 conditions, 13013 events. 9256/13013 cut-off events. For 5972/5972 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 68868 event pairs, 2133 based on Foata normal form. 1/12706 useless extension candidates. Maximal degree in co-relation 32052. Up to 4719 conditions per place. [2025-03-08 17:29:56,481 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 144 selfloop transitions, 55 changer transitions 1/201 dead transitions. [2025-03-08 17:29:56,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 201 transitions, 1141 flow [2025-03-08 17:29:56,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:29:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:29:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 193 transitions. [2025-03-08 17:29:56,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5626822157434402 [2025-03-08 17:29:56,486 INFO L175 Difference]: Start difference. First operand has 53 places, 65 transitions, 283 flow. Second operand 7 states and 193 transitions. [2025-03-08 17:29:56,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 201 transitions, 1141 flow [2025-03-08 17:29:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 201 transitions, 1131 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-08 17:29:56,496 INFO L231 Difference]: Finished difference. Result has 62 places, 116 transitions, 761 flow [2025-03-08 17:29:56,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=761, PETRI_PLACES=62, PETRI_TRANSITIONS=116} [2025-03-08 17:29:56,497 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2025-03-08 17:29:56,498 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 116 transitions, 761 flow [2025-03-08 17:29:56,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:29:56,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:56,498 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 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:56,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:29:56,498 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:29:56,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:56,499 INFO L85 PathProgramCache]: Analyzing trace with hash 382692966, now seen corresponding path program 4 times [2025-03-08 17:29:56,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:56,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676357794] [2025-03-08 17:29:56,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:29:56,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:56,518 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-08 17:29:56,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:29:56,532 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:29:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:56,687 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 17:29:56,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:29:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676357794] [2025-03-08 17:29:56,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676357794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:29:56,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214458684] [2025-03-08 17:29:56,688 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:29:56,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:56,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:29:56,690 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:56,692 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:56,807 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-03-08 17:29:56,843 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 17:29:56,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:29:56,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:29:56,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:29:56,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:29:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 17:29:56,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:29:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-08 17:29:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214458684] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:29:56,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:29:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-03-08 17:29:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648963188] [2025-03-08 17:29:56,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:29:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:29:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:29:56,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:29:56,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:29:56,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:29:56,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 116 transitions, 761 flow. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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:56,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:29:56,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:29:56,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:29:58,612 INFO L124 PetriNetUnfolderBase]: 9256/13016 cut-off events. [2025-03-08 17:29:58,612 INFO L125 PetriNetUnfolderBase]: For 16815/16815 co-relation queries the response was YES. [2025-03-08 17:29:58,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38646 conditions, 13016 events. 9256/13016 cut-off events. For 16815/16815 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 67533 event pairs, 6378 based on Foata normal form. 1/12709 useless extension candidates. Maximal degree in co-relation 38550. Up to 12994 conditions per place. [2025-03-08 17:29:58,742 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 100 selfloop transitions, 18 changer transitions 0/119 dead transitions. [2025-03-08 17:29:58,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 119 transitions, 1015 flow [2025-03-08 17:29:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:29:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-08 17:29:58,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-03-08 17:29:58,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2536443148688047 [2025-03-08 17:29:58,743 INFO L175 Difference]: Start difference. First operand has 62 places, 116 transitions, 761 flow. Second operand 7 states and 87 transitions. [2025-03-08 17:29:58,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 119 transitions, 1015 flow [2025-03-08 17:29:58,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 979 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-08 17:29:58,772 INFO L231 Difference]: Finished difference. Result has 69 places, 119 transitions, 793 flow [2025-03-08 17:29:58,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=793, PETRI_PLACES=69, PETRI_TRANSITIONS=119} [2025-03-08 17:29:58,773 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2025-03-08 17:29:58,776 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 119 transitions, 793 flow [2025-03-08 17:29:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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:58,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:29:58,777 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:58,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:29:58,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:29:58,977 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:29:58,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:29:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash 292873019, now seen corresponding path program 5 times [2025-03-08 17:29:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:29:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678338334] [2025-03-08 17:29:58,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:29:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:29:58,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-08 17:29:59,180 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:29:59,180 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 17:29:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 17:30:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678338334] [2025-03-08 17:30:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678338334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:30:00,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817379097] [2025-03-08 17:30:00,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:30:00,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:30:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:30:00,214 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:30:00,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:30:00,353 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-08 17:30:00,508 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:30:00,508 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 17:30:00,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:00,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 17:30:00,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:30:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:01,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:30:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817379097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:30:01,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-08 17:30:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426623734] [2025-03-08 17:30:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:01,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:01,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:01,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:01,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:30:01,368 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:01,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 119 transitions, 793 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:01,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:01,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:01,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:03,059 INFO L124 PetriNetUnfolderBase]: 10442/14853 cut-off events. [2025-03-08 17:30:03,059 INFO L125 PetriNetUnfolderBase]: For 16334/16334 co-relation queries the response was YES. [2025-03-08 17:30:03,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42295 conditions, 14853 events. 10442/14853 cut-off events. For 16334/16334 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 80401 event pairs, 6158 based on Foata normal form. 1/14484 useless extension candidates. Maximal degree in co-relation 42178. Up to 12505 conditions per place. [2025-03-08 17:30:03,109 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 160 selfloop transitions, 6 changer transitions 8/175 dead transitions. [2025-03-08 17:30:03,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 1377 flow [2025-03-08 17:30:03,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:30:03,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:30:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2025-03-08 17:30:03,111 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4326530612244898 [2025-03-08 17:30:03,111 INFO L175 Difference]: Start difference. First operand has 69 places, 119 transitions, 793 flow. Second operand 5 states and 106 transitions. [2025-03-08 17:30:03,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 1377 flow [2025-03-08 17:30:03,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 175 transitions, 1341 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-08 17:30:03,146 INFO L231 Difference]: Finished difference. Result has 72 places, 122 transitions, 812 flow [2025-03-08 17:30:03,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=812, PETRI_PLACES=72, PETRI_TRANSITIONS=122} [2025-03-08 17:30:03,147 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2025-03-08 17:30:03,147 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 122 transitions, 812 flow [2025-03-08 17:30:03,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:03,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:03,148 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:03,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:30:03,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:30:03,353 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:30:03,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:03,353 INFO L85 PathProgramCache]: Analyzing trace with hash 192323227, now seen corresponding path program 6 times [2025-03-08 17:30:03,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:03,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527422331] [2025-03-08 17:30:03,353 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:30:03,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:03,370 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 4 equivalence classes. [2025-03-08 17:30:03,405 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-03-08 17:30:03,405 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-08 17:30:03,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:03,940 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527422331] [2025-03-08 17:30:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527422331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232463296] [2025-03-08 17:30:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:03,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:03,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 122 transitions, 812 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:03,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:03,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:03,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:06,509 INFO L124 PetriNetUnfolderBase]: 12592/17971 cut-off events. [2025-03-08 17:30:06,509 INFO L125 PetriNetUnfolderBase]: For 24894/24894 co-relation queries the response was YES. [2025-03-08 17:30:06,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52672 conditions, 17971 events. 12592/17971 cut-off events. For 24894/24894 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 102913 event pairs, 4913 based on Foata normal form. 1/17602 useless extension candidates. Maximal degree in co-relation 52569. Up to 9370 conditions per place. [2025-03-08 17:30:06,572 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 169 selfloop transitions, 45 changer transitions 2/217 dead transitions. [2025-03-08 17:30:06,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 217 transitions, 1762 flow [2025-03-08 17:30:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:30:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:30:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-03-08 17:30:06,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-03-08 17:30:06,573 INFO L175 Difference]: Start difference. First operand has 72 places, 122 transitions, 812 flow. Second operand 5 states and 131 transitions. [2025-03-08 17:30:06,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 217 transitions, 1762 flow [2025-03-08 17:30:06,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 217 transitions, 1749 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:30:06,656 INFO L231 Difference]: Finished difference. Result has 77 places, 152 transitions, 1289 flow [2025-03-08 17:30:06,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1289, PETRI_PLACES=77, PETRI_TRANSITIONS=152} [2025-03-08 17:30:06,656 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2025-03-08 17:30:06,656 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 152 transitions, 1289 flow [2025-03-08 17:30:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:06,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:06,657 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:06,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:30:06,657 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:30:06,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:06,657 INFO L85 PathProgramCache]: Analyzing trace with hash -168228379, now seen corresponding path program 7 times [2025-03-08 17:30:06,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:06,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701355002] [2025-03-08 17:30:06,658 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:30:06,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 17:30:06,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 17:30:06,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:30:06,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:07,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:07,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701355002] [2025-03-08 17:30:07,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701355002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:07,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:07,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:07,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299126418] [2025-03-08 17:30:07,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:07,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:07,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:07,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:07,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:07,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:07,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 152 transitions, 1289 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:07,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:07,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:07,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:09,460 INFO L124 PetriNetUnfolderBase]: 13165/18854 cut-off events. [2025-03-08 17:30:09,460 INFO L125 PetriNetUnfolderBase]: For 41332/41332 co-relation queries the response was YES. [2025-03-08 17:30:09,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60035 conditions, 18854 events. 13165/18854 cut-off events. For 41332/41332 co-relation queries the response was YES. Maximal size of possible extension queue 751. Compared 109611 event pairs, 5433 based on Foata normal form. 1/18485 useless extension candidates. Maximal degree in co-relation 59930. Up to 10031 conditions per place. [2025-03-08 17:30:09,560 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 180 selfloop transitions, 45 changer transitions 2/228 dead transitions. [2025-03-08 17:30:09,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 228 transitions, 2106 flow [2025-03-08 17:30:09,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:30:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:30:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2025-03-08 17:30:09,561 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2025-03-08 17:30:09,561 INFO L175 Difference]: Start difference. First operand has 77 places, 152 transitions, 1289 flow. Second operand 5 states and 135 transitions. [2025-03-08 17:30:09,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 228 transitions, 2106 flow [2025-03-08 17:30:09,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 228 transitions, 2094 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 17:30:09,708 INFO L231 Difference]: Finished difference. Result has 84 places, 161 transitions, 1562 flow [2025-03-08 17:30:09,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1562, PETRI_PLACES=84, PETRI_TRANSITIONS=161} [2025-03-08 17:30:09,709 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 41 predicate places. [2025-03-08 17:30:09,709 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 161 transitions, 1562 flow [2025-03-08 17:30:09,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:09,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:09,709 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:09,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:30:09,709 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:30:09,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:09,710 INFO L85 PathProgramCache]: Analyzing trace with hash -520239365, now seen corresponding path program 8 times [2025-03-08 17:30:09,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:09,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286720904] [2025-03-08 17:30:09,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:30:09,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:09,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 17:30:09,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-03-08 17:30:09,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:30:09,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:10,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:10,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286720904] [2025-03-08 17:30:10,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286720904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:10,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:10,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:10,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794069566] [2025-03-08 17:30:10,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:10,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:10,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:10,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:10,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:10,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:10,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 161 transitions, 1562 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:10,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:10,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:10,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:12,588 INFO L124 PetriNetUnfolderBase]: 16214/23147 cut-off events. [2025-03-08 17:30:12,588 INFO L125 PetriNetUnfolderBase]: For 65795/65795 co-relation queries the response was YES. [2025-03-08 17:30:12,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76050 conditions, 23147 events. 16214/23147 cut-off events. For 65795/65795 co-relation queries the response was YES. Maximal size of possible extension queue 923. Compared 136565 event pairs, 6819 based on Foata normal form. 1/22678 useless extension candidates. Maximal degree in co-relation 75941. Up to 11390 conditions per place. [2025-03-08 17:30:12,723 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 190 selfloop transitions, 70 changer transitions 2/263 dead transitions. [2025-03-08 17:30:12,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 263 transitions, 2759 flow [2025-03-08 17:30:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:30:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:30:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2025-03-08 17:30:12,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2025-03-08 17:30:12,724 INFO L175 Difference]: Start difference. First operand has 84 places, 161 transitions, 1562 flow. Second operand 5 states and 129 transitions. [2025-03-08 17:30:12,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 263 transitions, 2759 flow [2025-03-08 17:30:13,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 263 transitions, 2740 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-08 17:30:13,035 INFO L231 Difference]: Finished difference. Result has 91 places, 199 transitions, 2261 flow [2025-03-08 17:30:13,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2261, PETRI_PLACES=91, PETRI_TRANSITIONS=199} [2025-03-08 17:30:13,036 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 48 predicate places. [2025-03-08 17:30:13,036 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 199 transitions, 2261 flow [2025-03-08 17:30:13,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:13,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:13,036 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:13,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 17:30:13,036 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:30:13,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1265155759, now seen corresponding path program 9 times [2025-03-08 17:30:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:13,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063198000] [2025-03-08 17:30:13,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:30:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:13,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-03-08 17:30:13,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 39 statements. [2025-03-08 17:30:13,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:30:13,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:13,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:13,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063198000] [2025-03-08 17:30:13,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063198000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:13,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:13,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008963147] [2025-03-08 17:30:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:13,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:13,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:13,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:13,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:13,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 199 transitions, 2261 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:13,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:13,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:13,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:16,770 INFO L124 PetriNetUnfolderBase]: 17584/25208 cut-off events. [2025-03-08 17:30:16,770 INFO L125 PetriNetUnfolderBase]: For 94425/94425 co-relation queries the response was YES. [2025-03-08 17:30:16,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88518 conditions, 25208 events. 17584/25208 cut-off events. For 94425/94425 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 151894 event pairs, 9888 based on Foata normal form. 1/24627 useless extension candidates. Maximal degree in co-relation 88406. Up to 19344 conditions per place. [2025-03-08 17:30:16,913 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 247 selfloop transitions, 26 changer transitions 7/281 dead transitions. [2025-03-08 17:30:16,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 281 transitions, 3378 flow [2025-03-08 17:30:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:30:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:30:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2025-03-08 17:30:16,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2025-03-08 17:30:16,914 INFO L175 Difference]: Start difference. First operand has 91 places, 199 transitions, 2261 flow. Second operand 5 states and 125 transitions. [2025-03-08 17:30:16,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 281 transitions, 3378 flow [2025-03-08 17:30:17,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 281 transitions, 3350 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-03-08 17:30:17,298 INFO L231 Difference]: Finished difference. Result has 98 places, 212 transitions, 2489 flow [2025-03-08 17:30:17,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2249, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2489, PETRI_PLACES=98, PETRI_TRANSITIONS=212} [2025-03-08 17:30:17,299 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 55 predicate places. [2025-03-08 17:30:17,299 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 212 transitions, 2489 flow [2025-03-08 17:30:17,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:30:17,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:17,299 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:17,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:30:17,300 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:30:17,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1639901403, now seen corresponding path program 1 times [2025-03-08 17:30:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:17,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449809600] [2025-03-08 17:30:17,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:30:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:17,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 17:30:17,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 17:30:17,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:30:17,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:17,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449809600] [2025-03-08 17:30:17,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449809600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:30:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33071843] [2025-03-08 17:30:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:30:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:17,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:30:17,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:30:17,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:17,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 212 transitions, 2489 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:30:17,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:17,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:17,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:20,913 INFO L124 PetriNetUnfolderBase]: 21572/30813 cut-off events. [2025-03-08 17:30:20,913 INFO L125 PetriNetUnfolderBase]: For 121456/121456 co-relation queries the response was YES. [2025-03-08 17:30:21,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110118 conditions, 30813 events. 21572/30813 cut-off events. For 121456/121456 co-relation queries the response was YES. Maximal size of possible extension queue 1150. Compared 187986 event pairs, 13334 based on Foata normal form. 582/31395 useless extension candidates. Maximal degree in co-relation 110002. Up to 24793 conditions per place. [2025-03-08 17:30:21,132 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 241 selfloop transitions, 18 changer transitions 1/261 dead transitions. [2025-03-08 17:30:21,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 261 transitions, 3405 flow [2025-03-08 17:30:21,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:30:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:30:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2025-03-08 17:30:21,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2025-03-08 17:30:21,134 INFO L175 Difference]: Start difference. First operand has 98 places, 212 transitions, 2489 flow. Second operand 3 states and 78 transitions. [2025-03-08 17:30:21,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 261 transitions, 3405 flow [2025-03-08 17:30:21,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 261 transitions, 3368 flow, removed 13 selfloop flow, removed 1 redundant places. [2025-03-08 17:30:21,535 INFO L231 Difference]: Finished difference. Result has 100 places, 213 transitions, 2527 flow [2025-03-08 17:30:21,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2527, PETRI_PLACES=100, PETRI_TRANSITIONS=213} [2025-03-08 17:30:21,535 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2025-03-08 17:30:21,536 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 213 transitions, 2527 flow [2025-03-08 17:30:21,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:30:21,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:21,536 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:21,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:30:21,536 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:30:21,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -584356674, now seen corresponding path program 1 times [2025-03-08 17:30:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114583005] [2025-03-08 17:30:21,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:30:21,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:21,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 17:30:21,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 17:30:21,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:30:21,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:21,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:21,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114583005] [2025-03-08 17:30:21,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114583005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:21,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:21,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:30:21,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647103714] [2025-03-08 17:30:21,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:21,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:30:21,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:21,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:30:21,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:30:21,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:21,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 213 transitions, 2527 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:21,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:21,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:21,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:25,735 INFO L124 PetriNetUnfolderBase]: 22512/32213 cut-off events. [2025-03-08 17:30:25,735 INFO L125 PetriNetUnfolderBase]: For 131118/131118 co-relation queries the response was YES. [2025-03-08 17:30:25,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117249 conditions, 32213 events. 22512/32213 cut-off events. For 131118/131118 co-relation queries the response was YES. Maximal size of possible extension queue 1230. Compared 198570 event pairs, 11527 based on Foata normal form. 7/32220 useless extension candidates. Maximal degree in co-relation 117132. Up to 20229 conditions per place. [2025-03-08 17:30:25,947 INFO L140 encePairwiseOnDemand]: 46/49 looper letters, 195 selfloop transitions, 12 changer transitions 64/272 dead transitions. [2025-03-08 17:30:25,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 272 transitions, 3452 flow [2025-03-08 17:30:25,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:30:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:30:25,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-08 17:30:25,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2025-03-08 17:30:25,948 INFO L175 Difference]: Start difference. First operand has 100 places, 213 transitions, 2527 flow. Second operand 4 states and 102 transitions. [2025-03-08 17:30:25,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 272 transitions, 3452 flow [2025-03-08 17:30:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 272 transitions, 3434 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:30:26,357 INFO L231 Difference]: Finished difference. Result has 104 places, 179 transitions, 1984 flow [2025-03-08 17:30:26,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=2509, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1984, PETRI_PLACES=104, PETRI_TRANSITIONS=179} [2025-03-08 17:30:26,358 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 61 predicate places. [2025-03-08 17:30:26,358 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 179 transitions, 1984 flow [2025-03-08 17:30:26,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:26,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:26,358 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:26,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:30:26,358 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:30:26,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1919630580, now seen corresponding path program 1 times [2025-03-08 17:30:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196141986] [2025-03-08 17:30:26,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:30:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:26,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 17:30:26,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 17:30:26,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:30:26,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196141986] [2025-03-08 17:30:26,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196141986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:26,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:26,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:30:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792906196] [2025-03-08 17:30:26,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:30:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:26,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:30:26,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:30:26,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:26,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 179 transitions, 1984 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:26,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:26,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:26,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:30,622 INFO L124 PetriNetUnfolderBase]: 19754/28217 cut-off events. [2025-03-08 17:30:30,622 INFO L125 PetriNetUnfolderBase]: For 113035/113035 co-relation queries the response was YES. [2025-03-08 17:30:30,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101671 conditions, 28217 events. 19754/28217 cut-off events. For 113035/113035 co-relation queries the response was YES. Maximal size of possible extension queue 996. Compared 169704 event pairs, 7459 based on Foata normal form. 3/28220 useless extension candidates. Maximal degree in co-relation 101554. Up to 21856 conditions per place. [2025-03-08 17:30:30,893 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 178 selfloop transitions, 19 changer transitions 53/251 dead transitions. [2025-03-08 17:30:30,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 251 transitions, 3061 flow [2025-03-08 17:30:30,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:30:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:30:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 102 transitions. [2025-03-08 17:30:30,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5204081632653061 [2025-03-08 17:30:30,894 INFO L175 Difference]: Start difference. First operand has 104 places, 179 transitions, 1984 flow. Second operand 4 states and 102 transitions. [2025-03-08 17:30:30,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 251 transitions, 3061 flow [2025-03-08 17:30:31,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 251 transitions, 2968 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-03-08 17:30:31,368 INFO L231 Difference]: Finished difference. Result has 106 places, 168 transitions, 1930 flow [2025-03-08 17:30:31,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1930, PETRI_PLACES=106, PETRI_TRANSITIONS=168} [2025-03-08 17:30:31,369 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2025-03-08 17:30:31,369 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 168 transitions, 1930 flow [2025-03-08 17:30:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:31,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:31,369 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:31,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:30:31,369 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:30:31,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:31,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1756369036, now seen corresponding path program 2 times [2025-03-08 17:30:31,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:31,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059776447] [2025-03-08 17:30:31,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:30:31,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:31,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 17:30:31,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-03-08 17:30:31,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:30:31,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:31,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059776447] [2025-03-08 17:30:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059776447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:31,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:30:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304265291] [2025-03-08 17:30:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:31,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:30:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:31,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:30:31,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:30:31,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:31,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 168 transitions, 1930 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:31,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:31,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:31,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:30:34,292 INFO L124 PetriNetUnfolderBase]: 17137/24531 cut-off events. [2025-03-08 17:30:34,293 INFO L125 PetriNetUnfolderBase]: For 94669/94669 co-relation queries the response was YES. [2025-03-08 17:30:34,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87178 conditions, 24531 events. 17137/24531 cut-off events. For 94669/94669 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 143554 event pairs, 7457 based on Foata normal form. 5/24536 useless extension candidates. Maximal degree in co-relation 87081. Up to 19377 conditions per place. [2025-03-08 17:30:34,473 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 156 selfloop transitions, 17 changer transitions 56/230 dead transitions. [2025-03-08 17:30:34,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 230 transitions, 2913 flow [2025-03-08 17:30:34,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:30:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:30:34,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2025-03-08 17:30:34,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5153061224489796 [2025-03-08 17:30:34,474 INFO L175 Difference]: Start difference. First operand has 106 places, 168 transitions, 1930 flow. Second operand 4 states and 101 transitions. [2025-03-08 17:30:34,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 230 transitions, 2913 flow [2025-03-08 17:30:34,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 230 transitions, 2856 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-03-08 17:30:34,734 INFO L231 Difference]: Finished difference. Result has 107 places, 148 transitions, 1684 flow [2025-03-08 17:30:34,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1684, PETRI_PLACES=107, PETRI_TRANSITIONS=148} [2025-03-08 17:30:34,734 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2025-03-08 17:30:34,734 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 148 transitions, 1684 flow [2025-03-08 17:30:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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:30:34,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:30:34,734 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 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:30:34,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:30:34,734 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:30:34,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:30:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 688347758, now seen corresponding path program 2 times [2025-03-08 17:30:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:30:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744033151] [2025-03-08 17:30:34,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:30:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:30:34,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 17:30:34,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 42 statements. [2025-03-08 17:30:34,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:30:34,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:30:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-08 17:30:34,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:30:34,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744033151] [2025-03-08 17:30:34,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744033151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:30:34,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:30:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:30:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742965597] [2025-03-08 17:30:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:30:34,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:30:34,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:30:34,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:30:34,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:30:34,822 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2025-03-08 17:30:34,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 148 transitions, 1684 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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:30:34,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:30:34,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2025-03-08 17:30:34,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand