./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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/chl-nzb-file-symm.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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:39:11,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:39:11,788 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:39:11,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:39:11,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:39:11,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:39:11,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:39:11,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:39:11,806 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:39:11,806 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:39:11,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:39:11,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:39:11,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:39:11,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:39:11,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:11,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:11,808 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:11,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:39:11,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:39:11,808 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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-01-09 16:39:12,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:39:12,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:39:12,146 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:39:12,146 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:39:12,146 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:39:12,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-01-09 16:39:13,281 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ba8a8735/b03b4c4c632e416b816203218bd64a68/FLAG1ea1ce36b [2025-01-09 16:39:13,505 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:39:13,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-01-09 16:39:13,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ba8a8735/b03b4c4c632e416b816203218bd64a68/FLAG1ea1ce36b [2025-01-09 16:39:13,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ba8a8735/b03b4c4c632e416b816203218bd64a68 [2025-01-09 16:39:13,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:39:13,537 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:39:13,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:13,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:39:13,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:39:13,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397c7f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13, skipping insertion in model container [2025-01-09 16:39:13,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:39:13,759 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-01-09 16:39:13,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:13,773 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:39:13,793 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/chl-nzb-file-symm.wvr.c[4955,4968] [2025-01-09 16:39:13,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:39:13,811 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:39:13,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13 WrapperNode [2025-01-09 16:39:13,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:39:13,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:13,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:39:13,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:39:13,819 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:39:13" (1/1) ... [2025-01-09 16:39:13,825 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:39:13" (1/1) ... [2025-01-09 16:39:13,846 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 399 [2025-01-09 16:39:13,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:39:13,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:39:13,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:39:13,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:39:13,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,869 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-09 16:39:13,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:39:13,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:39:13,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:39:13,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:39:13,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (1/1) ... [2025-01-09 16:39:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:39:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:13,910 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:39:13,912 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:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:39:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:39:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:39:13,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:39:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:39:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:39:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:39:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:39:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:39:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:39:13,929 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:39:14,034 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:39:14,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:39:14,487 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:39:14,488 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:39:14,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:39:14,922 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 16:39:14,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:14 BoogieIcfgContainer [2025-01-09 16:39:14,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:39:14,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:39:14,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:39:14,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:39:14,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:39:13" (1/3) ... [2025-01-09 16:39:14,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7514835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:14, skipping insertion in model container [2025-01-09 16:39:14,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:39:13" (2/3) ... [2025-01-09 16:39:14,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7514835e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:39:14, skipping insertion in model container [2025-01-09 16:39:14,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:39:14" (3/3) ... [2025-01-09 16:39:14,931 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-01-09 16:39:14,949 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:39:14,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 27 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:39:14,950 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:39:15,019 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 16:39:15,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 34 transitions, 82 flow [2025-01-09 16:39:15,092 INFO L124 PetriNetUnfolderBase]: 8/32 cut-off events. [2025-01-09 16:39:15,094 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:39:15,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 32 events. 8/32 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 46 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-01-09 16:39:15,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 34 transitions, 82 flow [2025-01-09 16:39:15,098 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 31 transitions, 74 flow [2025-01-09 16:39:15,106 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:39:15,113 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;@7c671870, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:39:15,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:39:15,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:39:15,126 INFO L124 PetriNetUnfolderBase]: 8/30 cut-off events. [2025-01-09 16:39:15,126 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 16:39:15,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:15,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:15,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:15,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:15,131 INFO L85 PathProgramCache]: Analyzing trace with hash 2027557083, now seen corresponding path program 1 times [2025-01-09 16:39:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618087946] [2025-01-09 16:39:15,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:15,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 16:39:15,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:39:15,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:15,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:15,444 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:39:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618087946] [2025-01-09 16:39:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618087946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:15,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:15,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:39:15,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81985407] [2025-01-09 16:39:15,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:15,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:15,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:15,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:15,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:15,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:15,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:15,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:15,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:15,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:15,622 INFO L124 PetriNetUnfolderBase]: 202/329 cut-off events. [2025-01-09 16:39:15,622 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 16:39:15,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 329 events. 202/329 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1005 event pairs, 138 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 620. Up to 327 conditions per place. [2025-01-09 16:39:15,626 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 26 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-01-09 16:39:15,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 134 flow [2025-01-09 16:39:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:15,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-01-09 16:39:15,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4215686274509804 [2025-01-09 16:39:15,636 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 74 flow. Second operand 3 states and 43 transitions. [2025-01-09 16:39:15,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 134 flow [2025-01-09 16:39:15,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 126 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:15,641 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 84 flow [2025-01-09 16:39:15,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2025-01-09 16:39:15,644 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2025-01-09 16:39:15,645 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 84 flow [2025-01-09 16:39:15,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:15,645 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:15,645 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:15,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:39:15,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:15,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:15,646 INFO L85 PathProgramCache]: Analyzing trace with hash -396809993, now seen corresponding path program 1 times [2025-01-09 16:39:15,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:15,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325627167] [2025-01-09 16:39:15,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:15,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:15,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:39:15,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:39:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:15,833 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:39:15,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325627167] [2025-01-09 16:39:15,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325627167] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:15,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931091958] [2025-01-09 16:39:15,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:15,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:15,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:15,835 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:39:15,837 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:39:15,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:39:15,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:39:15,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:15,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:15,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 16:39:15,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:15,990 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:39:15,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:16,008 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:39:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931091958] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:16,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-01-09 16:39:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061879845] [2025-01-09 16:39:16,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:39:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:16,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:39:16,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:39:16,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:16,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 84 flow. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:16,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:16,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:16,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:16,135 INFO L124 PetriNetUnfolderBase]: 202/335 cut-off events. [2025-01-09 16:39:16,135 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 16:39:16,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 335 events. 202/335 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 998 event pairs, 138 based on Foata normal form. 3/275 useless extension candidates. Maximal degree in co-relation 666. Up to 327 conditions per place. [2025-01-09 16:39:16,137 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2025-01-09 16:39:16,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 180 flow [2025-01-09 16:39:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:39:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:39:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2025-01-09 16:39:16,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2025-01-09 16:39:16,138 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 84 flow. Second operand 6 states and 60 transitions. [2025-01-09 16:39:16,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 180 flow [2025-01-09 16:39:16,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:16,140 INFO L231 Difference]: Finished difference. Result has 36 places, 37 transitions, 146 flow [2025-01-09 16:39:16,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=36, PETRI_TRANSITIONS=37} [2025-01-09 16:39:16,140 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 6 predicate places. [2025-01-09 16:39:16,141 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 37 transitions, 146 flow [2025-01-09 16:39:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:16,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:16,141 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:16,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 16:39:16,345 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:39:16,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:16,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:16,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1517244973, now seen corresponding path program 2 times [2025-01-09 16:39:16,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:16,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111213956] [2025-01-09 16:39:16,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:16,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:39:16,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-01-09 16:39:16,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:16,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111213956] [2025-01-09 16:39:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111213956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024233521] [2025-01-09 16:39:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:17,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:17,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:17,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:17,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:17,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 37 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:17,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:17,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:17,427 INFO L124 PetriNetUnfolderBase]: 244/430 cut-off events. [2025-01-09 16:39:17,428 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 16:39:17,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 430 events. 244/430 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1549 event pairs, 138 based on Foata normal form. 1/363 useless extension candidates. Maximal degree in co-relation 848. Up to 319 conditions per place. [2025-01-09 16:39:17,430 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 45 selfloop transitions, 1 changer transitions 9/56 dead transitions. [2025-01-09 16:39:17,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 299 flow [2025-01-09 16:39:17,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:17,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:17,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-01-09 16:39:17,433 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4485294117647059 [2025-01-09 16:39:17,433 INFO L175 Difference]: Start difference. First operand has 36 places, 37 transitions, 146 flow. Second operand 4 states and 61 transitions. [2025-01-09 16:39:17,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 299 flow [2025-01-09 16:39:17,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 283 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:17,435 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 139 flow [2025-01-09 16:39:17,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2025-01-09 16:39:17,435 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2025-01-09 16:39:17,436 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 139 flow [2025-01-09 16:39:17,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:17,436 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:39:17,436 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:17,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1661242603, now seen corresponding path program 3 times [2025-01-09 16:39:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311128984] [2025-01-09 16:39:17,439 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:17,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:17,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-01-09 16:39:17,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 17 of 25 statements. [2025-01-09 16:39:17,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311128984] [2025-01-09 16:39:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311128984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:39:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233839775] [2025-01-09 16:39:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:39:17,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:17,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:39:17,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:39:17,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:17,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:17,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:17,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:17,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:18,185 INFO L124 PetriNetUnfolderBase]: 272/491 cut-off events. [2025-01-09 16:39:18,185 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-09 16:39:18,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 491 events. 272/491 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1779 event pairs, 181 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1056. Up to 393 conditions per place. [2025-01-09 16:39:18,190 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 1 changer transitions 6/55 dead transitions. [2025-01-09 16:39:18,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 292 flow [2025-01-09 16:39:18,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:39:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:39:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-01-09 16:39:18,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2025-01-09 16:39:18,192 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 139 flow. Second operand 4 states and 59 transitions. [2025-01-09 16:39:18,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 292 flow [2025-01-09 16:39:18,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 286 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:18,195 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 143 flow [2025-01-09 16:39:18,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-01-09 16:39:18,196 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-01-09 16:39:18,196 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 143 flow [2025-01-09 16:39:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:18,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:18,197 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:18,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 16:39:18,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:18,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:18,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1716562089, now seen corresponding path program 1 times [2025-01-09 16:39:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249182695] [2025-01-09 16:39:18,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:18,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:18,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 16:39:18,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 16:39:18,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:18,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249182695] [2025-01-09 16:39:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249182695] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156694116] [2025-01-09 16:39:18,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:18,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:18,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:18,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:18,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:18,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:18,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:18,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:18,371 INFO L124 PetriNetUnfolderBase]: 217/397 cut-off events. [2025-01-09 16:39:18,373 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2025-01-09 16:39:18,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 876 conditions, 397 events. 217/397 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1337 event pairs, 73 based on Foata normal form. 21/382 useless extension candidates. Maximal degree in co-relation 857. Up to 320 conditions per place. [2025-01-09 16:39:18,374 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 41 selfloop transitions, 2 changer transitions 3/47 dead transitions. [2025-01-09 16:39:18,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 259 flow [2025-01-09 16:39:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:18,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-01-09 16:39:18,376 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-01-09 16:39:18,377 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 143 flow. Second operand 3 states and 49 transitions. [2025-01-09 16:39:18,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 259 flow [2025-01-09 16:39:18,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 47 transitions, 256 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 16:39:18,379 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 154 flow [2025-01-09 16:39:18,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2025-01-09 16:39:18,380 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 13 predicate places. [2025-01-09 16:39:18,381 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 154 flow [2025-01-09 16:39:18,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:18,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:18,381 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:18,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 16:39:18,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash 848965, now seen corresponding path program 2 times [2025-01-09 16:39:18,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:18,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050970637] [2025-01-09 16:39:18,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:18,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:18,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-01-09 16:39:18,396 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 28 statements. [2025-01-09 16:39:18,396 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:18,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 16:39:18,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:18,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050970637] [2025-01-09 16:39:18,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050970637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:18,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:18,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:18,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2442943] [2025-01-09 16:39:18,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:18,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:18,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:18,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:18,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:18,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:18,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:18,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:18,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:18,548 INFO L124 PetriNetUnfolderBase]: 179/320 cut-off events. [2025-01-09 16:39:18,548 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-01-09 16:39:18,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 320 events. 179/320 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 908 event pairs, 128 based on Foata normal form. 4/292 useless extension candidates. Maximal degree in co-relation 697. Up to 304 conditions per place. [2025-01-09 16:39:18,549 INFO L140 encePairwiseOnDemand]: 32/34 looper letters, 36 selfloop transitions, 0 changer transitions 4/41 dead transitions. [2025-01-09 16:39:18,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 41 transitions, 240 flow [2025-01-09 16:39:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-01-09 16:39:18,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2025-01-09 16:39:18,551 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 154 flow. Second operand 3 states and 40 transitions. [2025-01-09 16:39:18,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 41 transitions, 240 flow [2025-01-09 16:39:18,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 231 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-01-09 16:39:18,552 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 142 flow [2025-01-09 16:39:18,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-01-09 16:39:18,553 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2025-01-09 16:39:18,553 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 142 flow [2025-01-09 16:39:18,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:18,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:18,553 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:18,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 16:39:18,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:18,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1545369689, now seen corresponding path program 1 times [2025-01-09 16:39:18,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:18,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341028375] [2025-01-09 16:39:18,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:18,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:18,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:18,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:18,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:18,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:39:18,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341028375] [2025-01-09 16:39:18,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341028375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:18,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66780136] [2025-01-09 16:39:18,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:18,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:18,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:18,705 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:39:18,708 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:39:18,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:39:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:39:18,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:18,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:18,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:39:18,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:18,887 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:39:18,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 16:39:19,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66780136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:19,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-01-09 16:39:19,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626824142] [2025-01-09 16:39:19,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:19,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 16:39:19,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:19,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 16:39:19,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-01-09 16:39:19,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:19,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 142 flow. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 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:39:19,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:19,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:19,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,197 INFO L124 PetriNetUnfolderBase]: 171/306 cut-off events. [2025-01-09 16:39:19,197 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-09 16:39:19,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 306 events. 171/306 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 832 event pairs, 128 based on Foata normal form. 1/275 useless extension candidates. Maximal degree in co-relation 696. Up to 296 conditions per place. [2025-01-09 16:39:19,198 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 26 selfloop transitions, 12 changer transitions 0/39 dead transitions. [2025-01-09 16:39:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 230 flow [2025-01-09 16:39:19,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:39:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:39:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2025-01-09 16:39:19,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24789915966386555 [2025-01-09 16:39:19,199 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 142 flow. Second operand 7 states and 59 transitions. [2025-01-09 16:39:19,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 230 flow [2025-01-09 16:39:19,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 228 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:19,200 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 186 flow [2025-01-09 16:39:19,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2025-01-09 16:39:19,201 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 16 predicate places. [2025-01-09 16:39:19,201 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 186 flow [2025-01-09 16:39:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 17 states have internal predecessors, (90), 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:39:19,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:19,201 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:19,208 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:39:19,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:19,405 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:19,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 179944061, now seen corresponding path program 2 times [2025-01-09 16:39:19,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:19,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395783003] [2025-01-09 16:39:19,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:19,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 16:39:19,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 33 statements. [2025-01-09 16:39:19,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 16:39:19,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:19,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:19,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395783003] [2025-01-09 16:39:19,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395783003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:19,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:19,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:19,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042647848] [2025-01-09 16:39:19,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:19,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:19,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:19,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:19,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:19,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:19,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:19,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:19,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:19,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,576 INFO L124 PetriNetUnfolderBase]: 240/423 cut-off events. [2025-01-09 16:39:19,576 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-01-09 16:39:19,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 423 events. 240/423 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1312 event pairs, 139 based on Foata normal form. 16/386 useless extension candidates. Maximal degree in co-relation 950. Up to 306 conditions per place. [2025-01-09 16:39:19,578 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 47 selfloop transitions, 3 changer transitions 1/52 dead transitions. [2025-01-09 16:39:19,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 317 flow [2025-01-09 16:39:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:19,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-01-09 16:39:19,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2025-01-09 16:39:19,578 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 186 flow. Second operand 3 states and 49 transitions. [2025-01-09 16:39:19,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 317 flow [2025-01-09 16:39:19,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 293 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-01-09 16:39:19,580 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 177 flow [2025-01-09 16:39:19,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2025-01-09 16:39:19,580 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2025-01-09 16:39:19,580 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 177 flow [2025-01-09 16:39:19,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:19,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:19,580 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:19,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 16:39:19,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:19,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -512416361, now seen corresponding path program 1 times [2025-01-09 16:39:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655438977] [2025-01-09 16:39:19,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:19,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:19,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 16:39:19,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:39:19,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:19,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655438977] [2025-01-09 16:39:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655438977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:19,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:19,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:39:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766202524] [2025-01-09 16:39:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:19,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:39:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:19,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:39:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:39:19,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:19,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:19,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:19,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:19,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:19,850 INFO L124 PetriNetUnfolderBase]: 333/579 cut-off events. [2025-01-09 16:39:19,850 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-09 16:39:19,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 579 events. 333/579 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1982 event pairs, 191 based on Foata normal form. 21/558 useless extension candidates. Maximal degree in co-relation 1366. Up to 423 conditions per place. [2025-01-09 16:39:19,853 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 48 selfloop transitions, 3 changer transitions 1/53 dead transitions. [2025-01-09 16:39:19,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 320 flow [2025-01-09 16:39:19,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:39:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:39:19,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-01-09 16:39:19,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2025-01-09 16:39:19,854 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 177 flow. Second operand 3 states and 48 transitions. [2025-01-09 16:39:19,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 320 flow [2025-01-09 16:39:19,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:19,855 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 189 flow [2025-01-09 16:39:19,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=189, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2025-01-09 16:39:19,856 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2025-01-09 16:39:19,856 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 189 flow [2025-01-09 16:39:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:39:19,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:19,856 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:19,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 16:39:19,857 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:19,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1875746598, now seen corresponding path program 1 times [2025-01-09 16:39:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:19,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809794194] [2025-01-09 16:39:19,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:19,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:39:20,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:20,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:20,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809794194] [2025-01-09 16:39:25,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809794194] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:25,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657255686] [2025-01-09 16:39:25,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:39:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:25,431 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:39:25,434 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:39:25,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 16:39:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:25,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:39:25,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:25,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 16:39:25,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:26,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:26,830 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 332 treesize of output 276 [2025-01-09 16:39:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:27,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:29,352 INFO L349 Elim1Store]: treesize reduction 13, result has 80.0 percent of original size [2025-01-09 16:39:29,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 373 treesize of output 344 [2025-01-09 16:39:30,463 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657255686] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:30,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9, 9] total 36 [2025-01-09 16:39:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841695764] [2025-01-09 16:39:30,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:30,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 16:39:30,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:30,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 16:39:30,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 16:39:30,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:30,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 189 flow. Second operand has 36 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 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:39:30,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:30,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:30,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:33,944 INFO L124 PetriNetUnfolderBase]: 704/1221 cut-off events. [2025-01-09 16:39:33,944 INFO L125 PetriNetUnfolderBase]: For 409/409 co-relation queries the response was YES. [2025-01-09 16:39:33,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2981 conditions, 1221 events. 704/1221 cut-off events. For 409/409 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5418 event pairs, 139 based on Foata normal form. 2/1223 useless extension candidates. Maximal degree in co-relation 2967. Up to 270 conditions per place. [2025-01-09 16:39:33,949 INFO L140 encePairwiseOnDemand]: 20/34 looper letters, 111 selfloop transitions, 43 changer transitions 20/175 dead transitions. [2025-01-09 16:39:33,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 175 transitions, 921 flow [2025-01-09 16:39:33,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 16:39:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-01-09 16:39:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 247 transitions. [2025-01-09 16:39:33,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2690631808278867 [2025-01-09 16:39:33,951 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 189 flow. Second operand 27 states and 247 transitions. [2025-01-09 16:39:33,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 175 transitions, 921 flow [2025-01-09 16:39:33,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 175 transitions, 906 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:39:33,953 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 457 flow [2025-01-09 16:39:33,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=457, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-01-09 16:39:33,954 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2025-01-09 16:39:33,954 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 457 flow [2025-01-09 16:39:33,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.333333333333333) internal successors, (192), 36 states have internal predecessors, (192), 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:39:33,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:33,954 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:33,961 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:39:34,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:34,155 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:34,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:34,156 INFO L85 PathProgramCache]: Analyzing trace with hash -9398030, now seen corresponding path program 2 times [2025-01-09 16:39:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429298048] [2025-01-09 16:39:34,156 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:34,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:39:34,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:34,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:34,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:38,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429298048] [2025-01-09 16:39:38,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429298048] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:38,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467050835] [2025-01-09 16:39:38,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:39:38,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:38,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:38,395 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:39:38,397 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:39:38,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:39:38,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:38,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:39:38,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:38,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 16:39:38,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:39,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:39,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 274 [2025-01-09 16:39:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:40,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:42,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:42,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 378 treesize of output 356 [2025-01-09 16:39:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467050835] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:43,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 8] total 37 [2025-01-09 16:39:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736111092] [2025-01-09 16:39:43,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:43,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 16:39:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:43,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 16:39:43,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1205, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 16:39:43,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:43,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 457 flow. Second operand has 37 states, 37 states have (on average 5.486486486486487) internal successors, (203), 37 states have internal predecessors, (203), 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:39:43,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:43,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:43,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:45,890 INFO L124 PetriNetUnfolderBase]: 990/1746 cut-off events. [2025-01-09 16:39:45,890 INFO L125 PetriNetUnfolderBase]: For 2284/2284 co-relation queries the response was YES. [2025-01-09 16:39:45,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 1746 events. 990/1746 cut-off events. For 2284/2284 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8572 event pairs, 244 based on Foata normal form. 1/1747 useless extension candidates. Maximal degree in co-relation 5473. Up to 562 conditions per place. [2025-01-09 16:39:45,897 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 118 selfloop transitions, 47 changer transitions 12/178 dead transitions. [2025-01-09 16:39:45,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 178 transitions, 1296 flow [2025-01-09 16:39:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 16:39:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-01-09 16:39:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 222 transitions. [2025-01-09 16:39:45,898 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.251131221719457 [2025-01-09 16:39:45,898 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 457 flow. Second operand 26 states and 222 transitions. [2025-01-09 16:39:45,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 178 transitions, 1296 flow [2025-01-09 16:39:45,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 178 transitions, 1185 flow, removed 38 selfloop flow, removed 9 redundant places. [2025-01-09 16:39:45,909 INFO L231 Difference]: Finished difference. Result has 99 places, 91 transitions, 626 flow [2025-01-09 16:39:45,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=626, PETRI_PLACES=99, PETRI_TRANSITIONS=91} [2025-01-09 16:39:45,910 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2025-01-09 16:39:45,910 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 91 transitions, 626 flow [2025-01-09 16:39:45,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.486486486486487) internal successors, (203), 37 states have internal predecessors, (203), 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:39:45,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:45,910 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:45,917 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:39:46,115 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,SelfDestructingSolverStorable10 [2025-01-09 16:39:46,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:46,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:46,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2065336246, now seen corresponding path program 3 times [2025-01-09 16:39:46,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:46,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519195839] [2025-01-09 16:39:46,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:39:46,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:46,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 4 equivalence classes. [2025-01-09 16:39:46,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 37 statements. [2025-01-09 16:39:46,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 16:39:46,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519195839] [2025-01-09 16:39:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519195839] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:39:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:39:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 16:39:48,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138414782] [2025-01-09 16:39:48,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:39:48,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 16:39:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:48,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 16:39:48,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 16:39:48,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:48,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 91 transitions, 626 flow. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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:39:48,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:48,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:48,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:39:49,310 INFO L124 PetriNetUnfolderBase]: 1136/2006 cut-off events. [2025-01-09 16:39:49,310 INFO L125 PetriNetUnfolderBase]: For 3411/3411 co-relation queries the response was YES. [2025-01-09 16:39:49,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6558 conditions, 2006 events. 1136/2006 cut-off events. For 3411/3411 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10306 event pairs, 608 based on Foata normal form. 1/2007 useless extension candidates. Maximal degree in co-relation 6536. Up to 1411 conditions per place. [2025-01-09 16:39:49,320 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 113 selfloop transitions, 23 changer transitions 9/146 dead transitions. [2025-01-09 16:39:49,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 1168 flow [2025-01-09 16:39:49,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:39:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:39:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-01-09 16:39:49,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35 [2025-01-09 16:39:49,321 INFO L175 Difference]: Start difference. First operand has 99 places, 91 transitions, 626 flow. Second operand 10 states and 119 transitions. [2025-01-09 16:39:49,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 1168 flow [2025-01-09 16:39:49,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 146 transitions, 1095 flow, removed 20 selfloop flow, removed 13 redundant places. [2025-01-09 16:39:49,334 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 708 flow [2025-01-09 16:39:49,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=708, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2025-01-09 16:39:49,334 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 68 predicate places. [2025-01-09 16:39:49,334 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 708 flow [2025-01-09 16:39:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 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:39:49,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:39:49,335 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:39:49,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 16:39:49,335 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:39:49,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:39:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1668064650, now seen corresponding path program 4 times [2025-01-09 16:39:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:39:49,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50049576] [2025-01-09 16:39:49,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:39:49,348 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:39:49,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:49,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:49,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:39:53,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:39:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50049576] [2025-01-09 16:39:53,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50049576] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:39:53,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575926852] [2025-01-09 16:39:53,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:39:53,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:39:53,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:39:53,510 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:39:53,513 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:39:53,628 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-01-09 16:39:53,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:39:53,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:39:53,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:39:53,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-01-09 16:39:53,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:39:54,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:54,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 326 treesize of output 278 [2025-01-09 16:39:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:55,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:39:57,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:39:57,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 392 treesize of output 358 [2025-01-09 16:39:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:39:58,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575926852] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:39:58,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:39:58,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 33 [2025-01-09 16:39:58,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90752550] [2025-01-09 16:39:58,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:39:58,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 16:39:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:39:58,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 16:39:58,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 16:39:58,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 34 [2025-01-09 16:39:58,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 708 flow. Second operand has 33 states, 33 states have (on average 5.454545454545454) internal successors, (180), 33 states have internal predecessors, (180), 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:39:58,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:39:58,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 34 [2025-01-09 16:39:58,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:40:01,014 INFO L124 PetriNetUnfolderBase]: 2342/4150 cut-off events. [2025-01-09 16:40:01,014 INFO L125 PetriNetUnfolderBase]: For 8847/8847 co-relation queries the response was YES. [2025-01-09 16:40:01,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14121 conditions, 4150 events. 2342/4150 cut-off events. For 8847/8847 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 24806 event pairs, 590 based on Foata normal form. 2/4152 useless extension candidates. Maximal degree in co-relation 14098. Up to 760 conditions per place. [2025-01-09 16:40:01,038 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 217 selfloop transitions, 117 changer transitions 31/366 dead transitions. [2025-01-09 16:40:01,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 366 transitions, 2903 flow [2025-01-09 16:40:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-01-09 16:40:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-01-09 16:40:01,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 414 transitions. [2025-01-09 16:40:01,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27058823529411763 [2025-01-09 16:40:01,040 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 708 flow. Second operand 45 states and 414 transitions. [2025-01-09 16:40:01,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 366 transitions, 2903 flow [2025-01-09 16:40:01,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 366 transitions, 2813 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-01-09 16:40:01,073 INFO L231 Difference]: Finished difference. Result has 142 places, 160 transitions, 1444 flow [2025-01-09 16:40:01,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=1444, PETRI_PLACES=142, PETRI_TRANSITIONS=160} [2025-01-09 16:40:01,073 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2025-01-09 16:40:01,073 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 160 transitions, 1444 flow [2025-01-09 16:40:01,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.454545454545454) internal successors, (180), 33 states have internal predecessors, (180), 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:40:01,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:40:01,074 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:40:01,081 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:40:01,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:40:01,275 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:40:01,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:40:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1896059422, now seen corresponding path program 5 times [2025-01-09 16:40:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:40:01,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896968056] [2025-01-09 16:40:01,276 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:40:01,289 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-09 16:40:01,377 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:40:01,377 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:40:01,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 16:40:03,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:40:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896968056] [2025-01-09 16:40:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896968056] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:40:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982047340] [2025-01-09 16:40:03,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:40:03,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:40:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:40:03,691 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:40:03,692 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:40:03,805 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes. [2025-01-09 16:40:03,925 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 16:40:03,925 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 16:40:03,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:40:03,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 78 conjuncts are in the unsatisfiable core [2025-01-09 16:40:03,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:40:03,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-01-09 16:40:03,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 16:40:03,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-01-09 16:40:04,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2025-01-09 16:40:04,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 60 [2025-01-09 16:40:04,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2025-01-09 16:40:04,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 66 [2025-01-09 16:40:04,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 86 [2025-01-09 16:40:04,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 16:40:04,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2025-01-09 16:40:04,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 130 [2025-01-09 16:40:04,452 INFO L349 Elim1Store]: treesize reduction 164, result has 15.0 percent of original size [2025-01-09 16:40:04,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 130 treesize of output 142 [2025-01-09 16:40:04,693 INFO L349 Elim1Store]: treesize reduction 112, result has 32.1 percent of original size [2025-01-09 16:40:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 113 treesize of output 134 [2025-01-09 16:40:05,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 332 [2025-01-09 16:40:06,405 INFO L349 Elim1Store]: treesize reduction 561, result has 49.5 percent of original size [2025-01-09 16:40:06,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 103 case distinctions, treesize of input 332 treesize of output 811