./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 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-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:42:50,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:42:50,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:42:50,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:42:50,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:42:50,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:42:50,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:42:50,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:42:50,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:42:50,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:42:50,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:42:50,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:42:50,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:42:50,339 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:42:50,339 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:42:50,339 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:42:50,340 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:42:50,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:42:50,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:50,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:42:50,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:42:50,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:42:50,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:42:50,343 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-03-13 21:42:50,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:42:50,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:42:50,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:42:50,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:42:50,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:42:50,601 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-13 21:42:51,783 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3341e6ef4/df6499564dfc4848a7f82ddc79d25460/FLAGb5a0039f5 [2025-03-13 21:42:52,047 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:42:52,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-13 21:42:52,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3341e6ef4/df6499564dfc4848a7f82ddc79d25460/FLAGb5a0039f5 [2025-03-13 21:42:52,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3341e6ef4/df6499564dfc4848a7f82ddc79d25460 [2025-03-13 21:42:52,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:42:52,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:42:52,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:52,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:42:52,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:42:52,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@101452f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52, skipping insertion in model container [2025-03-13 21:42:52,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,113 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:42:52,284 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-symm.wvr.c[4955,4968] [2025-03-13 21:42:52,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:52,307 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:42:52,340 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-symm.wvr.c[4955,4968] [2025-03-13 21:42:52,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:42:52,366 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:42:52,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52 WrapperNode [2025-03-13 21:42:52,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:42:52,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:52,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:42:52,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:42:52,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,415 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-03-13 21:42:52,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:42:52,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:42:52,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:42:52,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:42:52,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,428 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,459 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-13 21:42:52,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,471 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:42:52,488 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:42:52,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:42:52,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:42:52,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (1/1) ... [2025-03-13 21:42:52,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:42:52,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:52,536 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-13 21:42:52,539 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-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:42:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:42:52,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:42:52,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:42:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:42:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:42:52,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:42:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:42:52,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:42:52,563 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:42:52,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:42:52,666 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:42:53,283 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:42:53,284 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:42:53,284 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:42:53,827 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:42:53,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:53 BoogieIcfgContainer [2025-03-13 21:42:53,828 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:42:53,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:42:53,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:42:53,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:42:53,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:42:52" (1/3) ... [2025-03-13 21:42:53,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d64555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:53, skipping insertion in model container [2025-03-13 21:42:53,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:42:52" (2/3) ... [2025-03-13 21:42:53,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d64555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:42:53, skipping insertion in model container [2025-03-13 21:42:53,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:42:53" (3/3) ... [2025-03-13 21:42:53,857 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-13 21:42:53,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:42:53,871 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-13 21:42:53,871 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:42:53,958 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:42:53,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 82 flow [2025-03-13 21:42:54,026 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-03-13 21:42:54,030 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:42:54,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 8/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 43 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-03-13 21:42:54,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 82 flow [2025-03-13 21:42:54,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 74 flow [2025-03-13 21:42:54,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:42:54,062 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;@185acfe1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:42:54,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:42:54,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:42:54,078 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2025-03-13 21:42:54,078 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:42:54,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:54,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:54,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:54,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:54,085 INFO L85 PathProgramCache]: Analyzing trace with hash -606871496, now seen corresponding path program 1 times [2025-03-13 21:42:54,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:54,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228645374] [2025-03-13 21:42:54,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:54,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:54,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:42:54,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:42:54,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:54,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:54,443 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-13 21:42:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228645374] [2025-03-13 21:42:54,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228645374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:54,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:54,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:42:54,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137440757] [2025-03-13 21:42:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:54,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:54,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:54,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:54,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:54,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:54,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 21:42:54,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:54,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:54,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:54,660 INFO L124 PetriNetUnfolderBase]: 202/329 cut-off events. [2025-03-13 21:42:54,661 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 21:42:54,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 329 events. 202/329 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1004 event pairs, 138 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 620. Up to 327 conditions per place. [2025-03-13 21:42:54,665 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 26 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-03-13 21:42:54,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 134 flow [2025-03-13 21:42:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:54,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-13 21:42:54,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-03-13 21:42:54,678 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 3 states and 43 transitions. [2025-03-13 21:42:54,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 134 flow [2025-03-13 21:42:54,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:54,686 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 84 flow [2025-03-13 21:42:54,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-03-13 21:42:54,695 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-03-13 21:42:54,696 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 84 flow [2025-03-13 21:42:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-13 21:42:54,696 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:54,696 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:42:54,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -381221047, now seen corresponding path program 1 times [2025-03-13 21:42:54,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:54,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505065782] [2025-03-13 21:42:54,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:54,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:42:54,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:42:54,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:54,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505065782] [2025-03-13 21:42:54,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505065782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:54,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312982716] [2025-03-13 21:42:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:54,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:54,917 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-13 21:42:54,919 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-13 21:42:55,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-13 21:42:55,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:42:55,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:55,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:55,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-13 21:42:55,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:55,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:42:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312982716] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:55,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:55,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-03-13 21:42:55,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979807720] [2025-03-13 21:42:55,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:55,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-13 21:42:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:55,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-13 21:42:55,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-13 21:42:55,147 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:55,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-13 21:42:55,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:55,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:55,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:55,359 INFO L124 PetriNetUnfolderBase]: 202/335 cut-off events. [2025-03-13 21:42:55,360 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 21:42:55,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 335 events. 202/335 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1007 event pairs, 138 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 666. Up to 327 conditions per place. [2025-03-13 21:42:55,362 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2025-03-13 21:42:55,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 180 flow [2025-03-13 21:42:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:42:55,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:42:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-03-13 21:42:55,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-03-13 21:42:55,364 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 84 flow. Second operand 6 states and 60 transitions. [2025-03-13 21:42:55,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 180 flow [2025-03-13 21:42:55,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:55,366 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 146 flow [2025-03-13 21:42:55,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-03-13 21:42:55,366 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-03-13 21:42:55,366 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 146 flow [2025-03-13 21:42:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 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-13 21:42:55,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:55,367 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:55,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:42:55,567 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-13 21:42:55,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1648320970, now seen corresponding path program 2 times [2025-03-13 21:42:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996515635] [2025-03-13 21:42:55,569 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:55,592 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-13 21:42:55,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-03-13 21:42:55,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:55,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-13 21:42:56,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:56,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996515635] [2025-03-13 21:42:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996515635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:56,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:42:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033388433] [2025-03-13 21:42:56,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:56,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:56,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:56,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:56,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:56,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:56,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:56,639 INFO L124 PetriNetUnfolderBase]: 244/430 cut-off events. [2025-03-13 21:42:56,639 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-13 21:42:56,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 430 events. 244/430 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1536 event pairs, 138 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 848. Up to 319 conditions per place. [2025-03-13 21:42:56,644 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 45 selfloop transitions, 1 changer transitions 9/56 dead transitions. [2025-03-13 21:42:56,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 299 flow [2025-03-13 21:42:56,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:56,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-13 21:42:56,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2025-03-13 21:42:56,647 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 146 flow. Second operand 4 states and 61 transitions. [2025-03-13 21:42:56,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 299 flow [2025-03-13 21:42:56,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 283 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:56,649 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 139 flow [2025-03-13 21:42:56,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-03-13 21:42:56,650 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-03-13 21:42:56,650 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 139 flow [2025-03-13 21:42:56,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:56,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:56,650 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:42:56,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -199162796, now seen corresponding path program 3 times [2025-03-13 21:42:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:56,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835942777] [2025-03-13 21:42:56,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:42:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:56,666 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-13 21:42:56,690 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-03-13 21:42:56,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:42:56,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-13 21:42:57,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835942777] [2025-03-13 21:42:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835942777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:57,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:57,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:42:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126291265] [2025-03-13 21:42:57,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:57,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:42:57,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:57,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:42:57,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:42:57,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:57,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:57,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:57,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:57,461 INFO L124 PetriNetUnfolderBase]: 272/491 cut-off events. [2025-03-13 21:42:57,463 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-13 21:42:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 491 events. 272/491 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1778 event pairs, 181 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1056. Up to 393 conditions per place. [2025-03-13 21:42:57,467 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 1 changer transitions 6/55 dead transitions. [2025-03-13 21:42:57,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2025-03-13 21:42:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:42:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:42:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-03-13 21:42:57,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2025-03-13 21:42:57,469 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 139 flow. Second operand 4 states and 59 transitions. [2025-03-13 21:42:57,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2025-03-13 21:42:57,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 286 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:57,472 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 143 flow [2025-03-13 21:42:57,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-13 21:42:57,474 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-13 21:42:57,474 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 143 flow [2025-03-13 21:42:57,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:57,475 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:57,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:42:57,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1934564223, now seen corresponding path program 1 times [2025-03-13 21:42:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108858607] [2025-03-13 21:42:57,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:57,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:57,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:57,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:57,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-13 21:42:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108858607] [2025-03-13 21:42:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108858607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:57,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:57,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:57,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344305288] [2025-03-13 21:42:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:57,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:57,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:57,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:57,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:57,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:57,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:57,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:57,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:57,660 INFO L124 PetriNetUnfolderBase]: 217/397 cut-off events. [2025-03-13 21:42:57,660 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-03-13 21:42:57,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 397 events. 217/397 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1328 event pairs, 73 based on Foata normal form. 21/382 useless extension candidates. Maximal degree in co-relation 857. Up to 320 conditions per place. [2025-03-13 21:42:57,663 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 41 selfloop transitions, 2 changer transitions 3/47 dead transitions. [2025-03-13 21:42:57,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 259 flow [2025-03-13 21:42:57,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:57,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:57,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-13 21:42:57,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-13 21:42:57,664 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 143 flow. Second operand 3 states and 49 transitions. [2025-03-13 21:42:57,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 259 flow [2025-03-13 21:42:57,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 21:42:57,665 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 154 flow [2025-03-13 21:42:57,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-03-13 21:42:57,666 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-03-13 21:42:57,666 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 154 flow [2025-03-13 21:42:57,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:57,666 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:57,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:42:57,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:57,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:57,667 INFO L85 PathProgramCache]: Analyzing trace with hash 690666863, now seen corresponding path program 1 times [2025-03-13 21:42:57,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:57,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484248063] [2025-03-13 21:42:57,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:57,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:57,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-13 21:42:57,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-13 21:42:57,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:57,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-13 21:42:57,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:57,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484248063] [2025-03-13 21:42:57,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484248063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151113068] [2025-03-13 21:42:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:57,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:57,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:57,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:57,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:57,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:57,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:57,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:57,816 INFO L124 PetriNetUnfolderBase]: 179/320 cut-off events. [2025-03-13 21:42:57,816 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2025-03-13 21:42:57,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 320 events. 179/320 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 917 event pairs, 128 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 697. Up to 304 conditions per place. [2025-03-13 21:42:57,818 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 36 selfloop transitions, 0 changer transitions 4/41 dead transitions. [2025-03-13 21:42:57,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 240 flow [2025-03-13 21:42:57,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-03-13 21:42:57,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-03-13 21:42:57,819 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 154 flow. Second operand 3 states and 40 transitions. [2025-03-13 21:42:57,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 240 flow [2025-03-13 21:42:57,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 231 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-13 21:42:57,822 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 142 flow [2025-03-13 21:42:57,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-13 21:42:57,823 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-03-13 21:42:57,824 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 142 flow [2025-03-13 21:42:57,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:57,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:57,824 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:42:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:42:57,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:57,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:57,824 INFO L85 PathProgramCache]: Analyzing trace with hash -385319908, now seen corresponding path program 1 times [2025-03-13 21:42:57,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014702681] [2025-03-13 21:42:57,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:57,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:42:57,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:42:57,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:57,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:42:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014702681] [2025-03-13 21:42:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014702681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:42:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636141090] [2025-03-13 21:42:57,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:57,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:42:57,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:42:57,951 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-13 21:42:57,953 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-13 21:42:58,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-13 21:42:58,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-13 21:42:58,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:58,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:58,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 21:42:58,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:42:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:42:58,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:42:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-13 21:42:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636141090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:42:58,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:42:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:42:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806115396] [2025-03-13 21:42:58,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:42:58,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:42:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:58,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:42:58,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:42:58,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:58,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 142 flow. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:58,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:58,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:58,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:58,309 INFO L124 PetriNetUnfolderBase]: 171/306 cut-off events. [2025-03-13 21:42:58,310 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-03-13 21:42:58,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 306 events. 171/306 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 841 event pairs, 128 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 696. Up to 296 conditions per place. [2025-03-13 21:42:58,312 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2025-03-13 21:42:58,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 230 flow [2025-03-13 21:42:58,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-13 21:42:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-13 21:42:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-03-13 21:42:58,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24789915966386555 [2025-03-13 21:42:58,314 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 142 flow. Second operand 7 states and 59 transitions. [2025-03-13 21:42:58,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 230 flow [2025-03-13 21:42:58,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:58,316 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 186 flow [2025-03-13 21:42:58,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-03-13 21:42:58,316 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-03-13 21:42:58,316 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 186 flow [2025-03-13 21:42:58,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:42:58,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:58,316 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-03-13 21:42:58,324 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-13 21:42:58,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-13 21:42:58,517 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:58,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1734148965, now seen corresponding path program 2 times [2025-03-13 21:42:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:58,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970869636] [2025-03-13 21:42:58,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:42:58,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:58,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-03-13 21:42:58,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 33 statements. [2025-03-13 21:42:58,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:42:58,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:58,611 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-13 21:42:58,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:58,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970869636] [2025-03-13 21:42:58,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970869636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:58,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:58,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:58,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432998089] [2025-03-13 21:42:58,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:58,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:58,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:58,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:58,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:58,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 21:42:58,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:58,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:58,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:58,722 INFO L124 PetriNetUnfolderBase]: 240/423 cut-off events. [2025-03-13 21:42:58,722 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-13 21:42:58,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 423 events. 240/423 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1301 event pairs, 139 based on Foata normal form. 16/386 useless extension candidates. Maximal degree in co-relation 950. Up to 306 conditions per place. [2025-03-13 21:42:58,725 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2025-03-13 21:42:58,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 317 flow [2025-03-13 21:42:58,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:58,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-13 21:42:58,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-03-13 21:42:58,727 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 186 flow. Second operand 3 states and 49 transitions. [2025-03-13 21:42:58,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 317 flow [2025-03-13 21:42:58,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 293 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-13 21:42:58,730 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 177 flow [2025-03-13 21:42:58,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-03-13 21:42:58,730 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2025-03-13 21:42:58,730 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 177 flow [2025-03-13 21:42:58,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-13 21:42:58,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:58,731 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 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-13 21:42:58,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:42:58,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:58,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -454404341, now seen corresponding path program 1 times [2025-03-13 21:42:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034329037] [2025-03-13 21:42:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:58,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-13 21:42:58,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-13 21:42:58,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:58,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:42:58,868 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-13 21:42:58,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:42:58,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034329037] [2025-03-13 21:42:58,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034329037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:42:58,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:42:58,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:42:58,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429472641] [2025-03-13 21:42:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:42:58,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:42:58,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:42:58,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:42:58,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:42:58,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:42:58,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 177 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-13 21:42:58,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:42:58,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:42:58,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:42:59,034 INFO L124 PetriNetUnfolderBase]: 333/579 cut-off events. [2025-03-13 21:42:59,035 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-13 21:42:59,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 579 events. 333/579 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1973 event pairs, 191 based on Foata normal form. 21/558 useless extension candidates. Maximal degree in co-relation 1366. Up to 423 conditions per place. [2025-03-13 21:42:59,038 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 48 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2025-03-13 21:42:59,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 320 flow [2025-03-13 21:42:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:42:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:42:59,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-03-13 21:42:59,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-03-13 21:42:59,039 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 177 flow. Second operand 3 states and 48 transitions. [2025-03-13 21:42:59,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 320 flow [2025-03-13 21:42:59,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:42:59,041 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 189 flow [2025-03-13 21:42:59,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-03-13 21:42:59,041 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-03-13 21:42:59,041 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 189 flow [2025-03-13 21:42:59,041 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-13 21:42:59,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:42:59,042 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:42:59,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:42:59,042 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:42:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:42:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -2043684236, now seen corresponding path program 1 times [2025-03-13 21:42:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:42:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518007861] [2025-03-13 21:42:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:42:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:42:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:42:59,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:42:59,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:42:59,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518007861] [2025-03-13 21:43:05,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518007861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224199057] [2025-03-13 21:43:05,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:43:05,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:05,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:05,299 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-13 21:43:05,302 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-13 21:43:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-13 21:43:05,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:43:05,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:43:05,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:05,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-13 21:43:05,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:06,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:43:06,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 278 [2025-03-13 21:43:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 21:43:07,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:43:09,639 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-03-13 21:43:09,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 302 [2025-03-13 21:43:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 21:43:10,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224199057] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:43:10,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:43:10,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 35 [2025-03-13 21:43:10,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244526437] [2025-03-13 21:43:10,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:43:10,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-13 21:43:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:10,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-13 21:43:10,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2025-03-13 21:43:10,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:43:10,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 189 flow. Second operand has 35 states, 35 states have (on average 5.371428571428571) internal successors, (188), 35 states have internal predecessors, (188), 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-13 21:43:10,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:10,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:43:10,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:15,005 INFO L124 PetriNetUnfolderBase]: 1378/2371 cut-off events. [2025-03-13 21:43:15,005 INFO L125 PetriNetUnfolderBase]: For 803/803 co-relation queries the response was YES. [2025-03-13 21:43:15,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5792 conditions, 2371 events. 1378/2371 cut-off events. For 803/803 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12201 event pairs, 266 based on Foata normal form. 2/2373 useless extension candidates. Maximal degree in co-relation 5778. Up to 416 conditions per place. [2025-03-13 21:43:15,016 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 201 selfloop transitions, 82 changer transitions 34/318 dead transitions. [2025-03-13 21:43:15,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 318 transitions, 1691 flow [2025-03-13 21:43:15,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-13 21:43:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-13 21:43:15,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 433 transitions. [2025-03-13 21:43:15,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30322128851540614 [2025-03-13 21:43:15,020 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 189 flow. Second operand 42 states and 433 transitions. [2025-03-13 21:43:15,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 318 transitions, 1691 flow [2025-03-13 21:43:15,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 318 transitions, 1661 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:43:15,024 INFO L231 Difference]: Finished difference. Result has 95 places, 113 transitions, 781 flow [2025-03-13 21:43:15,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=781, PETRI_PLACES=95, PETRI_TRANSITIONS=113} [2025-03-13 21:43:15,025 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2025-03-13 21:43:15,025 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 113 transitions, 781 flow [2025-03-13 21:43:15,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.371428571428571) internal successors, (188), 35 states have internal predecessors, (188), 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-13 21:43:15,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:15,025 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:15,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 21:43:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:15,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:43:15,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 277062124, now seen corresponding path program 2 times [2025-03-13 21:43:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868481858] [2025-03-13 21:43:15,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:15,243 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-13 21:43:15,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:43:15,400 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:43:15,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868481858] [2025-03-13 21:43:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868481858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:20,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205874120] [2025-03-13 21:43:20,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:43:20,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:20,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:20,728 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:43:20,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 21:43:20,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-13 21:43:20,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:43:20,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:43:20,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:20,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-13 21:43:20,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:21,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:43:21,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 281 [2025-03-13 21:43:22,588 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 21:43:22,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:43:24,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:43:24,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 417 treesize of output 395 [2025-03-13 21:43:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-13 21:43:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205874120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:43:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:43:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 8] total 38 [2025-03-13 21:43:25,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933716686] [2025-03-13 21:43:25,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:43:25,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-13 21:43:25,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:25,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-13 21:43:25,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2025-03-13 21:43:25,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:43:25,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 113 transitions, 781 flow. Second operand has 38 states, 38 states have (on average 5.421052631578948) internal successors, (206), 38 states have internal predecessors, (206), 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-13 21:43:25,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:25,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:43:25,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:29,230 INFO L124 PetriNetUnfolderBase]: 2300/4062 cut-off events. [2025-03-13 21:43:29,230 INFO L125 PetriNetUnfolderBase]: For 7487/7487 co-relation queries the response was YES. [2025-03-13 21:43:29,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12022 conditions, 4062 events. 2300/4062 cut-off events. For 7487/7487 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 24097 event pairs, 378 based on Foata normal form. 4/4066 useless extension candidates. Maximal degree in co-relation 12000. Up to 941 conditions per place. [2025-03-13 21:43:29,249 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 141 selfloop transitions, 104 changer transitions 27/273 dead transitions. [2025-03-13 21:43:29,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 273 transitions, 2063 flow [2025-03-13 21:43:29,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 21:43:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 21:43:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 262 transitions. [2025-03-13 21:43:29,251 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27521008403361347 [2025-03-13 21:43:29,251 INFO L175 Difference]: Start difference. First operand has 95 places, 113 transitions, 781 flow. Second operand 28 states and 262 transitions. [2025-03-13 21:43:29,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 273 transitions, 2063 flow [2025-03-13 21:43:29,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 273 transitions, 1793 flow, removed 94 selfloop flow, removed 13 redundant places. [2025-03-13 21:43:29,284 INFO L231 Difference]: Finished difference. Result has 114 places, 155 transitions, 1198 flow [2025-03-13 21:43:29,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=1198, PETRI_PLACES=114, PETRI_TRANSITIONS=155} [2025-03-13 21:43:29,285 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2025-03-13 21:43:29,285 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 1198 flow [2025-03-13 21:43:29,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 5.421052631578948) internal successors, (206), 38 states have internal predecessors, (206), 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-13 21:43:29,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:29,285 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:29,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 21:43:29,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:29,486 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:43:29,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:29,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1919740916, now seen corresponding path program 3 times [2025-03-13 21:43:29,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:29,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101898272] [2025-03-13 21:43:29,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:43:29,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:29,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-03-13 21:43:29,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 37 statements. [2025-03-13 21:43:29,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:43:29,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:32,181 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-13 21:43:32,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101898272] [2025-03-13 21:43:32,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101898272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:43:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:43:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-13 21:43:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257544142] [2025-03-13 21:43:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:43:32,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:43:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:43:32,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:43:32,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:43:32,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-03-13 21:43:32,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 1198 flow. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 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-13 21:43:32,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:43:32,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-03-13 21:43:32,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:43:33,259 INFO L124 PetriNetUnfolderBase]: 2644/4676 cut-off events. [2025-03-13 21:43:33,259 INFO L125 PetriNetUnfolderBase]: For 16790/16790 co-relation queries the response was YES. [2025-03-13 21:43:33,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15271 conditions, 4676 events. 2644/4676 cut-off events. For 16790/16790 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 29147 event pairs, 1448 based on Foata normal form. 2/4678 useless extension candidates. Maximal degree in co-relation 15248. Up to 3321 conditions per place. [2025-03-13 21:43:33,289 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 173 selfloop transitions, 45 changer transitions 14/233 dead transitions. [2025-03-13 21:43:33,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 233 transitions, 2051 flow [2025-03-13 21:43:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-13 21:43:33,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-13 21:43:33,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 140 transitions. [2025-03-13 21:43:33,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3167420814479638 [2025-03-13 21:43:33,290 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 1198 flow. Second operand 13 states and 140 transitions. [2025-03-13 21:43:33,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 233 transitions, 2051 flow [2025-03-13 21:43:33,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 233 transitions, 1962 flow, removed 40 selfloop flow, removed 4 redundant places. [2025-03-13 21:43:33,374 INFO L231 Difference]: Finished difference. Result has 124 places, 172 transitions, 1419 flow [2025-03-13 21:43:33,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1113, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1419, PETRI_PLACES=124, PETRI_TRANSITIONS=172} [2025-03-13 21:43:33,375 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2025-03-13 21:43:33,375 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 172 transitions, 1419 flow [2025-03-13 21:43:33,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 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-13 21:43:33,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:43:33,375 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:43:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:43:33,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:43:33,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:43:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash -279621632, now seen corresponding path program 4 times [2025-03-13 21:43:33,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:43:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125820171] [2025-03-13 21:43:33,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:33,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:43:33,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-13 21:43:33,491 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:43:33,491 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:33,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:43:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:43:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125820171] [2025-03-13 21:43:38,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125820171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:43:38,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313317270] [2025-03-13 21:43:38,409 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:43:38,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:43:38,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:43:38,411 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 21:43:38,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 21:43:38,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-13 21:43:38,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-13 21:43:38,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:43:38,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:43:38,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-13 21:43:38,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:43:38,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-03-13 21:43:38,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-13 21:43:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-13 21:43:38,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 46 [2025-03-13 21:43:38,659 INFO L349 Elim1Store]: treesize reduction 34, result has 12.8 percent of original size [2025-03-13 21:43:38,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 63 [2025-03-13 21:43:38,673 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-13 21:43:38,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2025-03-13 21:43:38,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 90 [2025-03-13 21:43:38,816 INFO L349 Elim1Store]: treesize reduction 127, result has 18.1 percent of original size [2025-03-13 21:43:38,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 90 treesize of output 117 [2025-03-13 21:43:38,920 INFO L349 Elim1Store]: treesize reduction 76, result has 39.7 percent of original size [2025-03-13 21:43:38,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 73 treesize of output 101 [2025-03-13 21:43:39,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 192 [2025-03-13 21:43:39,836 INFO L349 Elim1Store]: treesize reduction 377, result has 45.8 percent of original size [2025-03-13 21:43:39,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 54 case distinctions, treesize of input 192 treesize of output 477