./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:36:39,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:36:39,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 16:36:39,384 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:36:39,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:36:39,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:36:39,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:36:39,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:36:39,410 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:36:39,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:36:39,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:36:39,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:36:39,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:36:39,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:36:39,411 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:36:39,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:36:39,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:36:39,413 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:39,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:39,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:39,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:36:39,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2025-01-09 16:36:39,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:36:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:36:39,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:36:39,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:36:39,718 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:36:39,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-01-09 16:36:40,828 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d84ce4b/d334e43f78b841b7bd2897c41a298957/FLAGcc5a5244f [2025-01-09 16:36:41,054 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:36:41,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2025-01-09 16:36:41,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d84ce4b/d334e43f78b841b7bd2897c41a298957/FLAGcc5a5244f [2025-01-09 16:36:41,106 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d0d84ce4b/d334e43f78b841b7bd2897c41a298957 [2025-01-09 16:36:41,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:36:41,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:36:41,110 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:41,110 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:36:41,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:36:41,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5bab72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41, skipping insertion in model container [2025-01-09 16:36:41,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:36:41,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2776,2789] [2025-01-09 16:36:41,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:41,278 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:36:41,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2776,2789] [2025-01-09 16:36:41,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:36:41,302 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:36:41,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41 WrapperNode [2025-01-09 16:36:41,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:36:41,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:41,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:36:41,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:36:41,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,331 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 185 [2025-01-09 16:36:41,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:36:41,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:36:41,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:36:41,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:36:41,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,356 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-09 16:36:41,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,361 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,365 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:36:41,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:36:41,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:36:41,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:36:41,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (1/1) ... [2025-01-09 16:36:41,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:36:41,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:41,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 16:36:41,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 16:36:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:36:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:36:41,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:36:41,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:36:41,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:36:41,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:36:41,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:36:41,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:36:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:36:41,442 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:36:41,443 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 16:36:41,518 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:36:41,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:36:41,776 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:36:41,777 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:36:41,958 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:36:41,959 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:36:41,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:41 BoogieIcfgContainer [2025-01-09 16:36:41,959 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:36:41,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:36:41,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:36:41,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:36:41,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:36:41" (1/3) ... [2025-01-09 16:36:41,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c8cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:41, skipping insertion in model container [2025-01-09 16:36:41,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:36:41" (2/3) ... [2025-01-09 16:36:41,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b7c8cd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:36:41, skipping insertion in model container [2025-01-09 16:36:41,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:36:41" (3/3) ... [2025-01-09 16:36:41,965 INFO L128 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2025-01-09 16:36:41,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:36:41,977 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array-eq-trans.wvr.c that has 4 procedures, 32 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-01-09 16:36:41,977 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:36:42,035 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:36:42,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:36:42,077 INFO L124 PetriNetUnfolderBase]: 9/37 cut-off events. [2025-01-09 16:36:42,078 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:36:42,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 9/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-01-09 16:36:42,080 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 101 flow [2025-01-09 16:36:42,082 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 36 transitions, 90 flow [2025-01-09 16:36:42,087 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:36:42,097 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;@642cda6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:36:42,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:36:42,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:36:42,108 INFO L124 PetriNetUnfolderBase]: 9/35 cut-off events. [2025-01-09 16:36:42,108 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:36:42,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:42,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:42,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash -762017456, now seen corresponding path program 1 times [2025-01-09 16:36:42,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:42,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693127765] [2025-01-09 16:36:42,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:42,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:42,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 16:36:42,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 16:36:42,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:42,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:42,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:42,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:42,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693127765] [2025-01-09 16:36:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693127765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:42,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:42,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:36:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681952057] [2025-01-09 16:36:42,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:42,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:36:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:42,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:36:42,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:36:42,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-01-09 16:36:42,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:42,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:42,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-01-09 16:36:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:42,980 INFO L124 PetriNetUnfolderBase]: 1317/1871 cut-off events. [2025-01-09 16:36:42,980 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-01-09 16:36:42,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3753 conditions, 1871 events. 1317/1871 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8761 event pairs, 745 based on Foata normal form. 47/1611 useless extension candidates. Maximal degree in co-relation 2273. Up to 1164 conditions per place. [2025-01-09 16:36:42,999 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 28 selfloop transitions, 2 changer transitions 23/60 dead transitions. [2025-01-09 16:36:42,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 60 transitions, 262 flow [2025-01-09 16:36:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:36:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:36:43,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-01-09 16:36:43,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-01-09 16:36:43,010 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 90 flow. Second operand 4 states and 95 transitions. [2025-01-09 16:36:43,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 60 transitions, 262 flow [2025-01-09 16:36:43,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:36:43,018 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 94 flow [2025-01-09 16:36:43,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-01-09 16:36:43,022 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-01-09 16:36:43,023 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 94 flow [2025-01-09 16:36:43,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:43,023 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:43,023 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:43,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:36:43,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:43,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash 439883415, now seen corresponding path program 1 times [2025-01-09 16:36:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:43,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981723735] [2025-01-09 16:36:43,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:43,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:36:43,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:36:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981723735] [2025-01-09 16:36:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981723735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374108497] [2025-01-09 16:36:43,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:43,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:43,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:43,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:43,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 16:36:43,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 16:36:43,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:36:43,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:43,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:43,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:36:43,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:43,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:43,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:36:43,733 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 59 treesize of output 55 [2025-01-09 16:36:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:36:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374108497] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:36:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 10 [2025-01-09 16:36:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383989705] [2025-01-09 16:36:43,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:43,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:43,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:43,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:36:43,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-01-09 16:36:43,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-01-09 16:36:43,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:43,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-01-09 16:36:43,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:44,171 INFO L124 PetriNetUnfolderBase]: 1708/2369 cut-off events. [2025-01-09 16:36:44,171 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2025-01-09 16:36:44,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4918 conditions, 2369 events. 1708/2369 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 11127 event pairs, 439 based on Foata normal form. 1/1922 useless extension candidates. Maximal degree in co-relation 4906. Up to 940 conditions per place. [2025-01-09 16:36:44,184 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 62 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2025-01-09 16:36:44,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 74 transitions, 320 flow [2025-01-09 16:36:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-01-09 16:36:44,186 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57 [2025-01-09 16:36:44,186 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 94 flow. Second operand 5 states and 114 transitions. [2025-01-09 16:36:44,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 74 transitions, 320 flow [2025-01-09 16:36:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 74 transitions, 306 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-09 16:36:44,189 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 114 flow [2025-01-09 16:36:44,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-01-09 16:36:44,190 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2025-01-09 16:36:44,190 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 114 flow [2025-01-09 16:36:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 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-01-09 16:36:44,190 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:44,190 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:44,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:36:44,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:44,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:44,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1816719187, now seen corresponding path program 1 times [2025-01-09 16:36:44,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:44,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091251810] [2025-01-09 16:36:44,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:44,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:44,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:36:44,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:36:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:44,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:44,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091251810] [2025-01-09 16:36:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091251810] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:44,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:44,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009787571] [2025-01-09 16:36:44,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:44,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:44,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:44,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-01-09 16:36:44,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:44,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:44,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-01-09 16:36:44,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:44,805 INFO L124 PetriNetUnfolderBase]: 2247/3218 cut-off events. [2025-01-09 16:36:44,805 INFO L125 PetriNetUnfolderBase]: For 355/363 co-relation queries the response was YES. [2025-01-09 16:36:44,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6781 conditions, 3218 events. 2247/3218 cut-off events. For 355/363 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 16732 event pairs, 771 based on Foata normal form. 53/2901 useless extension candidates. Maximal degree in co-relation 6761. Up to 1406 conditions per place. [2025-01-09 16:36:44,818 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 4 changer transitions 21/81 dead transitions. [2025-01-09 16:36:44,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 361 flow [2025-01-09 16:36:44,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-01-09 16:36:44,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-01-09 16:36:44,819 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 114 flow. Second operand 5 states and 123 transitions. [2025-01-09 16:36:44,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 361 flow [2025-01-09 16:36:44,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 81 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:36:44,822 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 142 flow [2025-01-09 16:36:44,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=142, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-01-09 16:36:44,822 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2025-01-09 16:36:44,822 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 142 flow [2025-01-09 16:36:44,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:44,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:44,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:44,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:36:44,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:44,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:44,823 INFO L85 PathProgramCache]: Analyzing trace with hash -926031518, now seen corresponding path program 1 times [2025-01-09 16:36:44,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:44,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601594370] [2025-01-09 16:36:44,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:44,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:44,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:36:44,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:36:44,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601594370] [2025-01-09 16:36:45,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601594370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:45,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137484749] [2025-01-09 16:36:45,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:45,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:45,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 16:36:45,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:36:45,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:36:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:45,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:36:45,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:45,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:45,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:36:45,296 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 59 treesize of output 55 [2025-01-09 16:36:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:45,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137484749] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:45,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:36:45,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2025-01-09 16:36:45,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936347050] [2025-01-09 16:36:45,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:45,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:45,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:45,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 16:36:45,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-01-09 16:36:45,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-01-09 16:36:45,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:45,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-01-09 16:36:45,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:45,786 INFO L124 PetriNetUnfolderBase]: 4357/6188 cut-off events. [2025-01-09 16:36:45,786 INFO L125 PetriNetUnfolderBase]: For 2831/2965 co-relation queries the response was YES. [2025-01-09 16:36:45,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 6188 events. 4357/6188 cut-off events. For 2831/2965 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 34284 event pairs, 1057 based on Foata normal form. 3/5282 useless extension candidates. Maximal degree in co-relation 13945. Up to 1821 conditions per place. [2025-01-09 16:36:45,868 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 81 selfloop transitions, 7 changer transitions 3/98 dead transitions. [2025-01-09 16:36:45,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 98 transitions, 517 flow [2025-01-09 16:36:45,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:36:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:36:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2025-01-09 16:36:45,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2025-01-09 16:36:45,870 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 142 flow. Second operand 7 states and 146 transitions. [2025-01-09 16:36:45,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 98 transitions, 517 flow [2025-01-09 16:36:45,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 502 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 16:36:45,872 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 170 flow [2025-01-09 16:36:45,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2025-01-09 16:36:45,873 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 15 predicate places. [2025-01-09 16:36:45,873 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 170 flow [2025-01-09 16:36:45,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-01-09 16:36:45,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:45,873 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:45,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:36:46,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:46,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:46,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:46,076 INFO L85 PathProgramCache]: Analyzing trace with hash -117194156, now seen corresponding path program 1 times [2025-01-09 16:36:46,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:46,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605537895] [2025-01-09 16:36:46,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:46,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:36:46,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:36:46,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:46,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:46,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:46,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605537895] [2025-01-09 16:36:46,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605537895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:46,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:46,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:36:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419995899] [2025-01-09 16:36:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:46,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:36:46,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:46,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:36:46,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 16:36:46,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-01-09 16:36:46,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:46,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:46,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-01-09 16:36:46,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:46,533 INFO L124 PetriNetUnfolderBase]: 4199/6142 cut-off events. [2025-01-09 16:36:46,533 INFO L125 PetriNetUnfolderBase]: For 3213/3335 co-relation queries the response was YES. [2025-01-09 16:36:46,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14211 conditions, 6142 events. 4199/6142 cut-off events. For 3213/3335 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 35990 event pairs, 3102 based on Foata normal form. 126/5836 useless extension candidates. Maximal degree in co-relation 14181. Up to 4931 conditions per place. [2025-01-09 16:36:46,558 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 33 selfloop transitions, 3 changer transitions 21/66 dead transitions. [2025-01-09 16:36:46,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 352 flow [2025-01-09 16:36:46,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:36:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:36:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-01-09 16:36:46,559 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-01-09 16:36:46,559 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 170 flow. Second operand 5 states and 100 transitions. [2025-01-09 16:36:46,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 352 flow [2025-01-09 16:36:46,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:36:46,562 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 182 flow [2025-01-09 16:36:46,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-01-09 16:36:46,563 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2025-01-09 16:36:46,563 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 182 flow [2025-01-09 16:36:46,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:46,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:46,563 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:46,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:36:46,563 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:46,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:46,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1856189124, now seen corresponding path program 1 times [2025-01-09 16:36:46,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:46,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960859811] [2025-01-09 16:36:46,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:46,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:46,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:36:46,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:36:46,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:46,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:46,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:46,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960859811] [2025-01-09 16:36:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960859811] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:46,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657377056] [2025-01-09 16:36:46,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:46,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:46,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:46,712 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:46,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 16:36:46,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:36:46,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:36:46,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:46,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:46,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:36:46,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:46,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:47,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:36:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657377056] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:47,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:36:47,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 13 [2025-01-09 16:36:47,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137047039] [2025-01-09 16:36:47,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:47,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 16:36:47,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:47,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 16:36:47,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:36:47,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-01-09 16:36:47,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:47,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:47,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-01-09 16:36:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:47,513 INFO L124 PetriNetUnfolderBase]: 6384/9350 cut-off events. [2025-01-09 16:36:47,514 INFO L125 PetriNetUnfolderBase]: For 6498/6709 co-relation queries the response was YES. [2025-01-09 16:36:47,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22668 conditions, 9350 events. 6384/9350 cut-off events. For 6498/6709 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 55962 event pairs, 2331 based on Foata normal form. 0/8533 useless extension candidates. Maximal degree in co-relation 22636. Up to 3821 conditions per place. [2025-01-09 16:36:47,548 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 69 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-01-09 16:36:47,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 84 transitions, 490 flow [2025-01-09 16:36:47,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:36:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:36:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2025-01-09 16:36:47,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2025-01-09 16:36:47,550 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 182 flow. Second operand 7 states and 127 transitions. [2025-01-09 16:36:47,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 84 transitions, 490 flow [2025-01-09 16:36:47,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 478 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-01-09 16:36:47,553 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 202 flow [2025-01-09 16:36:47,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=202, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2025-01-09 16:36:47,554 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 23 predicate places. [2025-01-09 16:36:47,554 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 202 flow [2025-01-09 16:36:47,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:47,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:47,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:47,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 16:36:47,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:47,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1782581459, now seen corresponding path program 1 times [2025-01-09 16:36:47,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:47,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301767702] [2025-01-09 16:36:47,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:47,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:47,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:36:47,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:36:47,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:36:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:48,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301767702] [2025-01-09 16:36:48,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301767702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:48,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:36:48,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 16:36:48,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307598400] [2025-01-09 16:36:48,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:48,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:36:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:48,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:36:48,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:36:48,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2025-01-09 16:36:48,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 202 flow. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:48,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:48,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2025-01-09 16:36:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:49,279 INFO L124 PetriNetUnfolderBase]: 9303/13428 cut-off events. [2025-01-09 16:36:49,279 INFO L125 PetriNetUnfolderBase]: For 9915/9915 co-relation queries the response was YES. [2025-01-09 16:36:49,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35806 conditions, 13428 events. 9303/13428 cut-off events. For 9915/9915 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 78755 event pairs, 2563 based on Foata normal form. 23/13442 useless extension candidates. Maximal degree in co-relation 35772. Up to 11743 conditions per place. [2025-01-09 16:36:49,324 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 76 selfloop transitions, 13 changer transitions 11/104 dead transitions. [2025-01-09 16:36:49,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 104 transitions, 592 flow [2025-01-09 16:36:49,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:36:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:36:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2025-01-09 16:36:49,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5583333333333333 [2025-01-09 16:36:49,325 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 202 flow. Second operand 6 states and 134 transitions. [2025-01-09 16:36:49,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 104 transitions, 592 flow [2025-01-09 16:36:49,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:36:49,342 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 305 flow [2025-01-09 16:36:49,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2025-01-09 16:36:49,343 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2025-01-09 16:36:49,343 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 305 flow [2025-01-09 16:36:49,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:49,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:49,343 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:49,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 16:36:49,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:49,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1385381121, now seen corresponding path program 1 times [2025-01-09 16:36:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:49,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423801382] [2025-01-09 16:36:49,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:49,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:49,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:36:49,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:49,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:49,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:49,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423801382] [2025-01-09 16:36:49,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423801382] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:49,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139744140] [2025-01-09 16:36:49,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:49,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:49,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:49,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:49,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 16:36:49,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:36:49,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:49,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:49,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:49,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:36:49,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:49,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:49,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:36:49,673 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 43 treesize of output 39 [2025-01-09 16:36:49,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:49,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139744140] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:36:49,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:36:49,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2025-01-09 16:36:49,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810432543] [2025-01-09 16:36:49,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:36:49,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:36:49,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:49,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:36:49,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:36:49,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 40 [2025-01-09 16:36:49,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 305 flow. Second operand has 13 states, 13 states have (on average 15.153846153846153) internal successors, (197), 13 states have internal predecessors, (197), 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-01-09 16:36:49,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:49,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 40 [2025-01-09 16:36:49,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:50,554 INFO L124 PetriNetUnfolderBase]: 8103/12356 cut-off events. [2025-01-09 16:36:50,555 INFO L125 PetriNetUnfolderBase]: For 16646/16947 co-relation queries the response was YES. [2025-01-09 16:36:50,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35310 conditions, 12356 events. 8103/12356 cut-off events. For 16646/16947 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 79043 event pairs, 5672 based on Foata normal form. 207/12543 useless extension candidates. Maximal degree in co-relation 35054. Up to 7003 conditions per place. [2025-01-09 16:36:50,634 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 85 selfloop transitions, 5 changer transitions 21/118 dead transitions. [2025-01-09 16:36:50,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 118 transitions, 859 flow [2025-01-09 16:36:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:36:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:36:50,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-01-09 16:36:50,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2025-01-09 16:36:50,639 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 305 flow. Second operand 7 states and 143 transitions. [2025-01-09 16:36:50,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 118 transitions, 859 flow [2025-01-09 16:36:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 118 transitions, 822 flow, removed 10 selfloop flow, removed 4 redundant places. [2025-01-09 16:36:50,655 INFO L231 Difference]: Finished difference. Result has 69 places, 59 transitions, 339 flow [2025-01-09 16:36:50,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=69, PETRI_TRANSITIONS=59} [2025-01-09 16:36:50,656 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-01-09 16:36:50,656 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 59 transitions, 339 flow [2025-01-09 16:36:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.153846153846153) internal successors, (197), 13 states have internal predecessors, (197), 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-01-09 16:36:50,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:50,656 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:50,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 16:36:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 16:36:50,857 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:50,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:50,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2141742257, now seen corresponding path program 1 times [2025-01-09 16:36:50,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:50,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099691229] [2025-01-09 16:36:50,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:50,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:50,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:36:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:50,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:50,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:51,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099691229] [2025-01-09 16:36:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099691229] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:51,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963399019] [2025-01-09 16:36:51,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:36:51,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:51,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:51,796 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 16:36:51,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:36:51,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:51,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:36:51,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:51,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 16:36:51,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:36:52,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:36:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963399019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:36:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:36:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 15 [2025-01-09 16:36:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699600781] [2025-01-09 16:36:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:36:52,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:36:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:36:52,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:36:52,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-01-09 16:36:52,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-01-09 16:36:52,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 59 transitions, 339 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:52,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:36:52,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-01-09 16:36:52,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:36:53,072 INFO L124 PetriNetUnfolderBase]: 9695/14426 cut-off events. [2025-01-09 16:36:53,072 INFO L125 PetriNetUnfolderBase]: For 13859/13867 co-relation queries the response was YES. [2025-01-09 16:36:53,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40970 conditions, 14426 events. 9695/14426 cut-off events. For 13859/13867 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 89822 event pairs, 2778 based on Foata normal form. 12/14430 useless extension candidates. Maximal degree in co-relation 33887. Up to 10587 conditions per place. [2025-01-09 16:36:53,119 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 101 selfloop transitions, 27 changer transitions 2/135 dead transitions. [2025-01-09 16:36:53,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 135 transitions, 906 flow [2025-01-09 16:36:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:36:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:36:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2025-01-09 16:36:53,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2025-01-09 16:36:53,120 INFO L175 Difference]: Start difference. First operand has 69 places, 59 transitions, 339 flow. Second operand 7 states and 165 transitions. [2025-01-09 16:36:53,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 135 transitions, 906 flow [2025-01-09 16:36:53,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 135 transitions, 890 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-01-09 16:36:53,149 INFO L231 Difference]: Finished difference. Result has 76 places, 76 transitions, 573 flow [2025-01-09 16:36:53,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=573, PETRI_PLACES=76, PETRI_TRANSITIONS=76} [2025-01-09 16:36:53,150 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2025-01-09 16:36:53,151 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 76 transitions, 573 flow [2025-01-09 16:36:53,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:36:53,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:36:53,152 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:36:53,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 16:36:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:53,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:36:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:36:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash 755356463, now seen corresponding path program 2 times [2025-01-09 16:36:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:36:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061091138] [2025-01-09 16:36:53,353 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:36:53,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:36:53,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:53,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:53,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:54,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 16:36:54,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:36:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061091138] [2025-01-09 16:36:54,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061091138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:36:54,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072562934] [2025-01-09 16:36:54,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:36:54,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:36:54,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:36:54,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:36:54,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 16:36:54,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:36:54,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:36:54,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:36:54,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:36:54,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 16:36:54,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:36:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:36:55,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:36:55,938 INFO L349 Elim1Store]: treesize reduction 8, result has 96.5 percent of original size [2025-01-09 16:36:55,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 235 [2025-01-09 16:37:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:37:01,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072562934] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:01,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:37:01,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 23 [2025-01-09 16:37:01,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509783936] [2025-01-09 16:37:01,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:01,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:37:01,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:37:01,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:37:02,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 40 [2025-01-09 16:37:02,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 76 transitions, 573 flow. Second operand has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-01-09 16:37:02,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:02,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 40 [2025-01-09 16:37:02,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:02,808 INFO L124 PetriNetUnfolderBase]: 9007/13352 cut-off events. [2025-01-09 16:37:02,808 INFO L125 PetriNetUnfolderBase]: For 23239/23523 co-relation queries the response was YES. [2025-01-09 16:37:02,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42427 conditions, 13352 events. 9007/13352 cut-off events. For 23239/23523 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 82239 event pairs, 2960 based on Foata normal form. 12/13360 useless extension candidates. Maximal degree in co-relation 39564. Up to 8193 conditions per place. [2025-01-09 16:37:02,870 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 90 selfloop transitions, 32 changer transitions 2/130 dead transitions. [2025-01-09 16:37:02,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 130 transitions, 1040 flow [2025-01-09 16:37:02,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:37:02,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:37:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2025-01-09 16:37:02,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2025-01-09 16:37:02,872 INFO L175 Difference]: Start difference. First operand has 76 places, 76 transitions, 573 flow. Second operand 6 states and 145 transitions. [2025-01-09 16:37:02,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 130 transitions, 1040 flow [2025-01-09 16:37:02,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 130 transitions, 1024 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-01-09 16:37:02,919 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 717 flow [2025-01-09 16:37:02,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=717, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2025-01-09 16:37:02,920 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 46 predicate places. [2025-01-09 16:37:02,920 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 717 flow [2025-01-09 16:37:02,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.88888888888889) internal successors, (107), 9 states have internal predecessors, (107), 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-01-09 16:37:02,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:02,921 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:02,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 16:37:03,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 16:37:03,125 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:37:03,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:03,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1198062129, now seen corresponding path program 1 times [2025-01-09 16:37:03,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:03,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090496466] [2025-01-09 16:37:03,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:37:03,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:03,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:37:03,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:37:03,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:37:03,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:03,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:37:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090496466] [2025-01-09 16:37:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090496466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:37:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:37:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 16:37:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377880995] [2025-01-09 16:37:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:37:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 16:37:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:37:03,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 16:37:03,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 16:37:03,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2025-01-09 16:37:03,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 717 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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-01-09 16:37:03,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:37:03,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2025-01-09 16:37:03,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:37:04,870 INFO L124 PetriNetUnfolderBase]: 11310/16541 cut-off events. [2025-01-09 16:37:04,870 INFO L125 PetriNetUnfolderBase]: For 35965/36333 co-relation queries the response was YES. [2025-01-09 16:37:04,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54367 conditions, 16541 events. 11310/16541 cut-off events. For 35965/36333 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 101585 event pairs, 2090 based on Foata normal form. 8/16539 useless extension candidates. Maximal degree in co-relation 51017. Up to 11462 conditions per place. [2025-01-09 16:37:04,922 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 123 selfloop transitions, 40 changer transitions 3/171 dead transitions. [2025-01-09 16:37:04,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 1544 flow [2025-01-09 16:37:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 16:37:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 16:37:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2025-01-09 16:37:04,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-01-09 16:37:04,924 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 717 flow. Second operand 9 states and 189 transitions. [2025-01-09 16:37:04,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 1544 flow [2025-01-09 16:37:05,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 171 transitions, 1456 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-01-09 16:37:05,009 INFO L231 Difference]: Finished difference. Result has 91 places, 100 transitions, 981 flow [2025-01-09 16:37:05,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=981, PETRI_PLACES=91, PETRI_TRANSITIONS=100} [2025-01-09 16:37:05,010 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2025-01-09 16:37:05,010 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 100 transitions, 981 flow [2025-01-09 16:37:05,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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-01-09 16:37:05,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:37:05,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:37:05,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 16:37:05,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:37:05,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:37:05,011 INFO L85 PathProgramCache]: Analyzing trace with hash 93069061, now seen corresponding path program 2 times [2025-01-09 16:37:05,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:37:05,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-01-09 16:37:05,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:05,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:37:05,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:37:05,041 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:37:05,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:37:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:06,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:37:06,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:37:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040802508] [2025-01-09 16:37:06,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040802508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:37:06,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063619527] [2025-01-09 16:37:06,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:37:06,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:37:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:37:06,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:37:06,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:37:06,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-09 16:37:06,123 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:37:06,123 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:37:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:37:06,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 16:37:06,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:37:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:37:06,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:37:07,113 INFO L349 Elim1Store]: treesize reduction 15, result has 95.3 percent of original size [2025-01-09 16:37:07,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 91 treesize of output 327