./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-array-hom.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/popl20-more-min-array-hom.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 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:45:42,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:45:42,467 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:45:42,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:45:42,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:45:42,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:45:42,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:45:42,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:45:42,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:45:42,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:45:42,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:45:42,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:45:42,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:45:42,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:45:42,496 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:45:42,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:45:42,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:45:42,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:45:42,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:42,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:45:42,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:42,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:45:42,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:45:42,499 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 -> 0224e82797c7b26c7800eaf85be5e5678e7961d21aa4e2312eda2860d261b33a [2025-01-09 16:45:42,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:45:42,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:45:42,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:45:42,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:45:42,751 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:45:42,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-01-09 16:45:43,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f5e80683/6369e81597914afd91f009c821ec1901/FLAGdbc6b9b14 [2025-01-09 16:45:44,179 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:45:44,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-array-hom.wvr.c [2025-01-09 16:45:44,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f5e80683/6369e81597914afd91f009c821ec1901/FLAGdbc6b9b14 [2025-01-09 16:45:44,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f5e80683/6369e81597914afd91f009c821ec1901 [2025-01-09 16:45:44,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:45:44,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:45:44,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:44,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:45:44,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:45:44,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,500 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28330670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44, skipping insertion in model container [2025-01-09 16:45:44,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:45:44,609 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-01-09 16:45:44,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:44,621 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:45:44,633 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/popl20-more-min-array-hom.wvr.c[2625,2638] [2025-01-09 16:45:44,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:45:44,644 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:45:44,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44 WrapperNode [2025-01-09 16:45:44,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:45:44,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:44,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:45:44,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:45:44,650 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:45:44" (1/1) ... [2025-01-09 16:45:44,655 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:45:44" (1/1) ... [2025-01-09 16:45:44,668 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 84 [2025-01-09 16:45:44,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:45:44,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:45:44,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:45:44,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:45:44,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,687 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-09 16:45:44,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:45:44,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:45:44,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:45:44,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:45:44,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (1/1) ... [2025-01-09 16:45:44,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:45:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:44,723 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:45:44,727 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:45:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:45:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 16:45:44,742 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 16:45:44,742 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 16:45:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 16:45:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:45:44,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 16:45:44,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 16:45:44,744 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:45:44,825 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:45:44,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:45:45,033 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:45:45,034 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:45:45,154 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:45:45,154 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:45:45,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:45 BoogieIcfgContainer [2025-01-09 16:45:45,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:45:45,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:45:45,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:45:45,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:45:45,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:45:44" (1/3) ... [2025-01-09 16:45:45,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:45, skipping insertion in model container [2025-01-09 16:45:45,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:45:44" (2/3) ... [2025-01-09 16:45:45,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151b80ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:45:45, skipping insertion in model container [2025-01-09 16:45:45,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:45:45" (3/3) ... [2025-01-09 16:45:45,161 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-01-09 16:45:45,171 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:45:45,172 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 30 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-01-09 16:45:45,172 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:45:45,215 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 16:45:45,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:45:45,268 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-09 16:45:45,270 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:45:45,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 4/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-09 16:45:45,272 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 33 transitions, 87 flow [2025-01-09 16:45:45,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 29 transitions, 76 flow [2025-01-09 16:45:45,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:45:45,291 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;@f36f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:45:45,292 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-09 16:45:45,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:45:45,299 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-01-09 16:45:45,300 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:45:45,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:45,300 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:45:45,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:45:45,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:45,304 INFO L85 PathProgramCache]: Analyzing trace with hash -68211266, now seen corresponding path program 1 times [2025-01-09 16:45:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:45,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618048131] [2025-01-09 16:45:45,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:45,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 16:45:45,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 16:45:45,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:45,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,605 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:45:45,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618048131] [2025-01-09 16:45:45,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618048131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:45,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:45,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:45,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853573263] [2025-01-09 16:45:45,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:45,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:45,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:45,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:45,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:45,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45:45,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:45,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:45,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:45,767 INFO L124 PetriNetUnfolderBase]: 617/948 cut-off events. [2025-01-09 16:45:45,768 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-01-09 16:45:45,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1943 conditions, 948 events. 617/948 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3738 event pairs, 126 based on Foata normal form. 1/935 useless extension candidates. Maximal degree in co-relation 1709. Up to 677 conditions per place. [2025-01-09 16:45:45,774 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2025-01-09 16:45:45,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2025-01-09 16:45:45,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:45,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-01-09 16:45:45,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2025-01-09 16:45:45,784 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 76 flow. Second operand 3 states and 64 transitions. [2025-01-09 16:45:45,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2025-01-09 16:45:45,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 46 transitions, 187 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 16:45:45,791 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 90 flow [2025-01-09 16:45:45,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-01-09 16:45:45,795 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2025-01-09 16:45:45,795 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 90 flow [2025-01-09 16:45:45,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:45:45,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:45,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:45,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:45:45,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:45:45,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:45,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1795616181, now seen corresponding path program 1 times [2025-01-09 16:45:45,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:45,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201140321] [2025-01-09 16:45:45,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:45,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:45,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 16:45:45,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 16:45:45,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:45,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201140321] [2025-01-09 16:45:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201140321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 16:45:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594099984] [2025-01-09 16:45:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:45:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:45,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:45:45,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:45:45,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:45:45,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:45,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:45,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:45:45,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:46,026 INFO L124 PetriNetUnfolderBase]: 617/949 cut-off events. [2025-01-09 16:45:46,027 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2025-01-09 16:45:46,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 949 events. 617/949 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3903 event pairs, 407 based on Foata normal form. 0/921 useless extension candidates. Maximal degree in co-relation 793. Up to 895 conditions per place. [2025-01-09 16:45:46,032 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2025-01-09 16:45:46,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 150 flow [2025-01-09 16:45:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:45:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:45:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2025-01-09 16:45:46,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2025-01-09 16:45:46,033 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 90 flow. Second operand 3 states and 48 transitions. [2025-01-09 16:45:46,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 150 flow [2025-01-09 16:45:46,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:46,035 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 98 flow [2025-01-09 16:45:46,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2025-01-09 16:45:46,035 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2025-01-09 16:45:46,035 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 98 flow [2025-01-09 16:45:46,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:46,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:46,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:46,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 16:45:46,036 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:45:46,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash -324695831, now seen corresponding path program 1 times [2025-01-09 16:45:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850322802] [2025-01-09 16:45:46,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:46,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:46,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:46,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850322802] [2025-01-09 16:45:46,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850322802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:45:46,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:45:46,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 16:45:46,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113324749] [2025-01-09 16:45:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:46,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 16:45:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:46,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 16:45:46,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 16:45:46,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:46,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:46,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:46,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:46,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:46,336 INFO L124 PetriNetUnfolderBase]: 790/1165 cut-off events. [2025-01-09 16:45:46,337 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2025-01-09 16:45:46,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 1165 events. 790/1165 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4691 event pairs, 246 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 2566. Up to 576 conditions per place. [2025-01-09 16:45:46,343 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-01-09 16:45:46,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 224 flow [2025-01-09 16:45:46,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 16:45:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 16:45:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-01-09 16:45:46,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2025-01-09 16:45:46,346 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 98 flow. Second operand 4 states and 63 transitions. [2025-01-09 16:45:46,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 224 flow [2025-01-09 16:45:46,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 218 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 16:45:46,347 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 113 flow [2025-01-09 16:45:46,348 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-01-09 16:45:46,349 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2025-01-09 16:45:46,349 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 113 flow [2025-01-09 16:45:46,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:45:46,349 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:46,349 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:46,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 16:45:46,350 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:45:46,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:46,351 INFO L85 PathProgramCache]: Analyzing trace with hash -2045713005, now seen corresponding path program 1 times [2025-01-09 16:45:46,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:46,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287727131] [2025-01-09 16:45:46,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:46,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:46,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:46,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:46,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,478 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:45:46,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:46,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287727131] [2025-01-09 16:45:46,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287727131] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:46,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104008285] [2025-01-09 16:45:46,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:46,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:46,483 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:45:46,490 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:45:46,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 16:45:46,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:45:46,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:46,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:46,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:45:46,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:46,634 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:45:46,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:45:46,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104008285] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:46,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:45:46,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-01-09 16:45:46,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543160450] [2025-01-09 16:45:46,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:45:46,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 16:45:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:45:46,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 16:45:46,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 16:45:46,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:45:46,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:45:46,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:45:46,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:45:46,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:45:46,785 INFO L124 PetriNetUnfolderBase]: 855/1297 cut-off events. [2025-01-09 16:45:46,786 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2025-01-09 16:45:46,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1297 events. 855/1297 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5415 event pairs, 256 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 3229. Up to 670 conditions per place. [2025-01-09 16:45:46,792 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-01-09 16:45:46,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 257 flow [2025-01-09 16:45:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 16:45:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 16:45:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2025-01-09 16:45:46,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-01-09 16:45:46,794 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 113 flow. Second operand 5 states and 72 transitions. [2025-01-09 16:45:46,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 257 flow [2025-01-09 16:45:46,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:45:46,796 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 132 flow [2025-01-09 16:45:46,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-01-09 16:45:46,797 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-01-09 16:45:46,797 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 132 flow [2025-01-09 16:45:46,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:45:46,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:45:46,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:45:46,803 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:45:46,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:46,998 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:45:46,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:45:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -309530044, now seen corresponding path program 1 times [2025-01-09 16:45:47,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:45:47,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457359631] [2025-01-09 16:45:47,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:45:47,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:47,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:47,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:45:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457359631] [2025-01-09 16:45:47,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457359631] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:45:47,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521222351] [2025-01-09 16:45:47,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:45:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:45:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:45:47,774 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:45:47,775 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:45:47,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 16:45:47,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:45:47,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:45:47,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:45:47,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:45:47,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:45:47,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-01-09 16:45:48,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:45:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:45:48,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:45:49,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 226 treesize of output 208 [2025-01-09 16:45:49,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:45:49,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 291 [2025-01-09 16:46:06,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 282 treesize of output 254 [2025-01-09 16:46:06,024 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-01-09 16:46:06,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 1 [2025-01-09 16:46:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:06,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521222351] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:06,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:06,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-01-09 16:46:06,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381816902] [2025-01-09 16:46:06,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:06,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 16:46:06,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:06,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 16:46:06,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:46:06,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:06,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 132 flow. Second operand has 23 states, 23 states have (on average 8.73913043478261) internal successors, (201), 23 states have internal predecessors, (201), 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:46:06,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:06,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:06,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:07,934 INFO L124 PetriNetUnfolderBase]: 1841/2767 cut-off events. [2025-01-09 16:46:07,934 INFO L125 PetriNetUnfolderBase]: For 1743/1743 co-relation queries the response was YES. [2025-01-09 16:46:07,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7675 conditions, 2767 events. 1841/2767 cut-off events. For 1743/1743 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12650 event pairs, 98 based on Foata normal form. 1/2767 useless extension candidates. Maximal degree in co-relation 5619. Up to 1375 conditions per place. [2025-01-09 16:46:07,950 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 137 selfloop transitions, 57 changer transitions 1/199 dead transitions. [2025-01-09 16:46:07,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 199 transitions, 1067 flow [2025-01-09 16:46:07,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 16:46:07,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 16:46:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 321 transitions. [2025-01-09 16:46:07,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46320346320346323 [2025-01-09 16:46:07,954 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 132 flow. Second operand 21 states and 321 transitions. [2025-01-09 16:46:07,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 199 transitions, 1067 flow [2025-01-09 16:46:07,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 199 transitions, 1050 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 16:46:07,960 INFO L231 Difference]: Finished difference. Result has 64 places, 91 transitions, 543 flow [2025-01-09 16:46:07,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=543, PETRI_PLACES=64, PETRI_TRANSITIONS=91} [2025-01-09 16:46:07,962 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2025-01-09 16:46:07,962 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 91 transitions, 543 flow [2025-01-09 16:46:07,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.73913043478261) internal successors, (201), 23 states have internal predecessors, (201), 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:46:07,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:07,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:07,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:08,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:08,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash -767621068, now seen corresponding path program 2 times [2025-01-09 16:46:08,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:08,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560510907] [2025-01-09 16:46:08,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:08,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:08,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:08,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:08,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:08,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560510907] [2025-01-09 16:46:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560510907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031162520] [2025-01-09 16:46:08,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:08,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:08,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:08,685 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:46:08,690 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:46:08,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:08,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:08,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:08,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:46:08,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:08,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-01-09 16:46:08,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:46:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:09,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:10,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 282 treesize of output 254 [2025-01-09 16:46:10,290 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:10,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 372 treesize of output 376 [2025-01-09 16:46:25,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 226 treesize of output 208 [2025-01-09 16:46:25,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:25,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 261 treesize of output 291 [2025-01-09 16:46:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031162520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:29,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:29,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 22 [2025-01-09 16:46:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290292354] [2025-01-09 16:46:29,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 16:46:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:29,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 16:46:29,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:46:29,766 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:46:29,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 91 transitions, 543 flow. Second operand has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 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:46:29,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:29,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:46:29,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:31,559 INFO L124 PetriNetUnfolderBase]: 2050/3317 cut-off events. [2025-01-09 16:46:31,559 INFO L125 PetriNetUnfolderBase]: For 4746/4746 co-relation queries the response was YES. [2025-01-09 16:46:31,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10778 conditions, 3317 events. 2050/3317 cut-off events. For 4746/4746 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 17718 event pairs, 72 based on Foata normal form. 3/3316 useless extension candidates. Maximal degree in co-relation 10228. Up to 1815 conditions per place. [2025-01-09 16:46:31,576 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 193 selfloop transitions, 121 changer transitions 2/322 dead transitions. [2025-01-09 16:46:31,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 322 transitions, 2167 flow [2025-01-09 16:46:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 16:46:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-01-09 16:46:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 474 transitions. [2025-01-09 16:46:31,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4633431085043988 [2025-01-09 16:46:31,578 INFO L175 Difference]: Start difference. First operand has 64 places, 91 transitions, 543 flow. Second operand 31 states and 474 transitions. [2025-01-09 16:46:31,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 322 transitions, 2167 flow [2025-01-09 16:46:31,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 1959 flow, removed 77 selfloop flow, removed 3 redundant places. [2025-01-09 16:46:31,588 INFO L231 Difference]: Finished difference. Result has 105 places, 182 transitions, 1307 flow [2025-01-09 16:46:31,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1307, PETRI_PLACES=105, PETRI_TRANSITIONS=182} [2025-01-09 16:46:31,589 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2025-01-09 16:46:31,589 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 182 transitions, 1307 flow [2025-01-09 16:46:31,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.91304347826087) internal successors, (228), 23 states have internal predecessors, (228), 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:46:31,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:31,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:31,596 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:46:31,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:31,790 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:31,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2124524690, now seen corresponding path program 3 times [2025-01-09 16:46:31,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:31,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240172267] [2025-01-09 16:46:31,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:31,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:31,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:31,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:31,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240172267] [2025-01-09 16:46:32,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240172267] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:32,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172392545] [2025-01-09 16:46:32,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:46:32,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:32,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:32,343 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:46:32,345 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:46:32,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:32,400 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:32,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:46:32,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:32,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:46:32,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:32,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-01-09 16:46:32,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:46:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:32,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:33,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 217 treesize of output 195 [2025-01-09 16:46:33,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:33,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 296 treesize of output 278 [2025-01-09 16:46:37,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 106 treesize of output 96 [2025-01-09 16:46:37,697 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:46:37,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 125 treesize of output 115 [2025-01-09 16:46:37,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 183 treesize of output 167 [2025-01-09 16:46:37,961 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-01-09 16:46:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 215 treesize of output 1 [2025-01-09 16:46:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172392545] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:38,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2025-01-09 16:46:38,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648639347] [2025-01-09 16:46:38,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 16:46:38,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:38,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 16:46:38,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-01-09 16:46:38,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:46:38,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 182 transitions, 1307 flow. Second operand has 23 states, 23 states have (on average 9.826086956521738) internal successors, (226), 23 states have internal predecessors, (226), 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:46:38,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:38,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:46:38,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:40,615 INFO L124 PetriNetUnfolderBase]: 3836/6223 cut-off events. [2025-01-09 16:46:40,615 INFO L125 PetriNetUnfolderBase]: For 16977/17030 co-relation queries the response was YES. [2025-01-09 16:46:40,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23985 conditions, 6223 events. 3836/6223 cut-off events. For 16977/17030 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 38069 event pairs, 277 based on Foata normal form. 37/6258 useless extension candidates. Maximal degree in co-relation 22841. Up to 2782 conditions per place. [2025-01-09 16:46:40,657 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 233 selfloop transitions, 247 changer transitions 2/488 dead transitions. [2025-01-09 16:46:40,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 488 transitions, 4097 flow [2025-01-09 16:46:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 16:46:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-01-09 16:46:40,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 523 transitions. [2025-01-09 16:46:40,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4661319073083779 [2025-01-09 16:46:40,659 INFO L175 Difference]: Start difference. First operand has 105 places, 182 transitions, 1307 flow. Second operand 34 states and 523 transitions. [2025-01-09 16:46:40,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 488 transitions, 4097 flow [2025-01-09 16:46:40,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 488 transitions, 3910 flow, removed 91 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:40,694 INFO L231 Difference]: Finished difference. Result has 148 places, 329 transitions, 3031 flow [2025-01-09 16:46:40,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3031, PETRI_PLACES=148, PETRI_TRANSITIONS=329} [2025-01-09 16:46:40,696 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 113 predicate places. [2025-01-09 16:46:40,696 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 329 transitions, 3031 flow [2025-01-09 16:46:40,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.826086956521738) internal successors, (226), 23 states have internal predecessors, (226), 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:46:40,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:40,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:40,702 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:46:40,897 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,SelfDestructingSolverStorable6 [2025-01-09 16:46:40,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:40,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:40,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2077780812, now seen corresponding path program 4 times [2025-01-09 16:46:40,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:40,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556081874] [2025-01-09 16:46:40,899 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:40,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:40,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:40,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:41,170 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:46:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556081874] [2025-01-09 16:46:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556081874] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:41,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000639454] [2025-01-09 16:46:41,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:46:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:41,174 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:46:41,182 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:46:41,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:41,242 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:41,242 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:46:41,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:41,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 16:46:41,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:41,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:46:41,495 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:46:41,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:41,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:41,620 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 123 treesize of output 75 [2025-01-09 16:46:41,864 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:46:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000639454] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:41,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:41,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 24 [2025-01-09 16:46:41,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369468421] [2025-01-09 16:46:41,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:41,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:46:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:41,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:46:41,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=476, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:46:41,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:41,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 329 transitions, 3031 flow. Second operand has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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:46:41,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:41,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:41,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:42,920 INFO L124 PetriNetUnfolderBase]: 6093/9528 cut-off events. [2025-01-09 16:46:42,920 INFO L125 PetriNetUnfolderBase]: For 38234/38250 co-relation queries the response was YES. [2025-01-09 16:46:42,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41864 conditions, 9528 events. 6093/9528 cut-off events. For 38234/38250 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 59600 event pairs, 1015 based on Foata normal form. 13/9538 useless extension candidates. Maximal degree in co-relation 39825. Up to 7187 conditions per place. [2025-01-09 16:46:42,986 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 369 selfloop transitions, 246 changer transitions 1/621 dead transitions. [2025-01-09 16:46:42,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 621 transitions, 6818 flow [2025-01-09 16:46:42,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 16:46:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-01-09 16:46:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2025-01-09 16:46:42,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2025-01-09 16:46:42,988 INFO L175 Difference]: Start difference. First operand has 148 places, 329 transitions, 3031 flow. Second operand 15 states and 192 transitions. [2025-01-09 16:46:42,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 621 transitions, 6818 flow [2025-01-09 16:46:43,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 621 transitions, 6504 flow, removed 99 selfloop flow, removed 12 redundant places. [2025-01-09 16:46:43,126 INFO L231 Difference]: Finished difference. Result has 159 places, 522 transitions, 5678 flow [2025-01-09 16:46:43,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2823, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5678, PETRI_PLACES=159, PETRI_TRANSITIONS=522} [2025-01-09 16:46:43,127 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 124 predicate places. [2025-01-09 16:46:43,127 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 522 transitions, 5678 flow [2025-01-09 16:46:43,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 8.52) internal successors, (213), 25 states have internal predecessors, (213), 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:46:43,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:43,127 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:43,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:43,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -500869906, now seen corresponding path program 5 times [2025-01-09 16:46:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292442858] [2025-01-09 16:46:43,333 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:43,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:43,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:43,354 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:43,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:43,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292442858] [2025-01-09 16:46:43,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292442858] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:43,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824300208] [2025-01-09 16:46:43,835 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:46:43,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:43,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:43,840 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:46:43,841 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:46:43,878 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:43,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:43,893 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:43,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:43,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 16:46:43,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:44,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:46:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:44,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:44,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:44,344 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 123 treesize of output 75 [2025-01-09 16:46:44,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:44,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824300208] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:44,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:44,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 25 [2025-01-09 16:46:44,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768237689] [2025-01-09 16:46:44,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:44,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 16:46:44,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:44,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 16:46:44,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-01-09 16:46:44,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:46:44,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 522 transitions, 5678 flow. Second operand has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 26 states have internal predecessors, (251), 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:46:44,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:44,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:46:44,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:46,116 INFO L124 PetriNetUnfolderBase]: 5850/9293 cut-off events. [2025-01-09 16:46:46,123 INFO L125 PetriNetUnfolderBase]: For 50281/50704 co-relation queries the response was YES. [2025-01-09 16:46:46,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45770 conditions, 9293 events. 5850/9293 cut-off events. For 50281/50704 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 59589 event pairs, 1050 based on Foata normal form. 347/9604 useless extension candidates. Maximal degree in co-relation 45080. Up to 7525 conditions per place. [2025-01-09 16:46:46,188 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 494 selfloop transitions, 143 changer transitions 1/645 dead transitions. [2025-01-09 16:46:46,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 645 transitions, 8040 flow [2025-01-09 16:46:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 16:46:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 16:46:46,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 258 transitions. [2025-01-09 16:46:46,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41148325358851673 [2025-01-09 16:46:46,189 INFO L175 Difference]: Start difference. First operand has 159 places, 522 transitions, 5678 flow. Second operand 19 states and 258 transitions. [2025-01-09 16:46:46,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 645 transitions, 8040 flow [2025-01-09 16:46:46,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 645 transitions, 7863 flow, removed 65 selfloop flow, removed 2 redundant places. [2025-01-09 16:46:46,325 INFO L231 Difference]: Finished difference. Result has 183 places, 592 transitions, 6782 flow [2025-01-09 16:46:46,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5535, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6782, PETRI_PLACES=183, PETRI_TRANSITIONS=592} [2025-01-09 16:46:46,326 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 148 predicate places. [2025-01-09 16:46:46,326 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 592 transitions, 6782 flow [2025-01-09 16:46:46,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.653846153846153) internal successors, (251), 26 states have internal predecessors, (251), 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:46:46,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:46,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:46,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:46,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 16:46:46,531 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:46,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:46,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1709144578, now seen corresponding path program 6 times [2025-01-09 16:46:46,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:46,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079701844] [2025-01-09 16:46:46,532 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:46,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:46,537 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:46,552 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:46,552 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:46:46,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:47,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079701844] [2025-01-09 16:46:47,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079701844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:47,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992836110] [2025-01-09 16:46:47,021 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:46:47,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:47,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:47,026 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 16:46:47,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 16:46:47,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-01-09 16:46:47,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 16:46:47,086 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:46:47,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:47,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 16:46:47,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:47,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2025-01-09 16:46:47,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 59 treesize of output 35 [2025-01-09 16:46:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:47,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:48,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 183 treesize of output 167 [2025-01-09 16:46:48,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 16:46:48,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 215 treesize of output 219 [2025-01-09 16:46:52,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 106 treesize of output 96 [2025-01-09 16:46:52,265 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 16:46:52,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 125 treesize of output 115 [2025-01-09 16:46:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 217 treesize of output 195 [2025-01-09 16:46:52,436 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2025-01-09 16:46:52,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 296 treesize of output 1 [2025-01-09 16:46:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:46:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992836110] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:52,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:52,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2025-01-09 16:46:52,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474825252] [2025-01-09 16:46:52,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 16:46:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 16:46:52,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-01-09 16:46:52,608 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2025-01-09 16:46:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 592 transitions, 6782 flow. Second operand has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 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:46:52,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:52,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2025-01-09 16:46:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:55,660 INFO L124 PetriNetUnfolderBase]: 6804/10853 cut-off events. [2025-01-09 16:46:55,661 INFO L125 PetriNetUnfolderBase]: For 71181/71617 co-relation queries the response was YES. [2025-01-09 16:46:55,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55963 conditions, 10853 events. 6804/10853 cut-off events. For 71181/71617 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 71729 event pairs, 311 based on Foata normal form. 404/11241 useless extension candidates. Maximal degree in co-relation 55293. Up to 3716 conditions per place. [2025-01-09 16:46:55,745 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 265 selfloop transitions, 667 changer transitions 2/941 dead transitions. [2025-01-09 16:46:55,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 941 transitions, 11755 flow [2025-01-09 16:46:55,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 16:46:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-01-09 16:46:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 644 transitions. [2025-01-09 16:46:55,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45384073291050037 [2025-01-09 16:46:55,747 INFO L175 Difference]: Start difference. First operand has 183 places, 592 transitions, 6782 flow. Second operand 43 states and 644 transitions. [2025-01-09 16:46:55,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 941 transitions, 11755 flow [2025-01-09 16:46:55,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 941 transitions, 11479 flow, removed 105 selfloop flow, removed 6 redundant places. [2025-01-09 16:46:55,988 INFO L231 Difference]: Finished difference. Result has 226 places, 761 transitions, 10528 flow [2025-01-09 16:46:55,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=6570, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=510, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=10528, PETRI_PLACES=226, PETRI_TRANSITIONS=761} [2025-01-09 16:46:55,988 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 191 predicate places. [2025-01-09 16:46:55,989 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 761 transitions, 10528 flow [2025-01-09 16:46:55,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.75) internal successors, (234), 24 states have internal predecessors, (234), 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:46:55,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:55,989 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:46:55,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:56,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:56,189 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:56,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:56,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1520267860, now seen corresponding path program 7 times [2025-01-09 16:46:56,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:56,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795115819] [2025-01-09 16:46:56,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:56,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:56,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:56,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:56,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:56,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795115819] [2025-01-09 16:46:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795115819] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100401510] [2025-01-09 16:46:56,265 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:46:56,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:56,267 INFO L229 MonitoredProcess]: Starting monitored process 9 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:46:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 16:46:56,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 16:46:56,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 16:46:56,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:46:56,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:56,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:56,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:56,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:46:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100401510] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:46:56,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:46:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-09 16:46:56,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697381541] [2025-01-09 16:46:56,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:46:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:46:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:56,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:46:56,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:46:56,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:46:56,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 761 transitions, 10528 flow. Second operand has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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:46:56,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:56,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:46:56,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:46:58,303 INFO L124 PetriNetUnfolderBase]: 10521/15817 cut-off events. [2025-01-09 16:46:58,304 INFO L125 PetriNetUnfolderBase]: For 149844/150581 co-relation queries the response was YES. [2025-01-09 16:46:58,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91868 conditions, 15817 events. 10521/15817 cut-off events. For 149844/150581 co-relation queries the response was YES. Maximal size of possible extension queue 800. Compared 101913 event pairs, 2077 based on Foata normal form. 743/16531 useless extension candidates. Maximal degree in co-relation 91078. Up to 5786 conditions per place. [2025-01-09 16:46:58,460 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 992 selfloop transitions, 81 changer transitions 0/1078 dead transitions. [2025-01-09 16:46:58,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1078 transitions, 16783 flow [2025-01-09 16:46:58,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 16:46:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 16:46:58,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2025-01-09 16:46:58,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5181818181818182 [2025-01-09 16:46:58,461 INFO L175 Difference]: Start difference. First operand has 226 places, 761 transitions, 10528 flow. Second operand 10 states and 171 transitions. [2025-01-09 16:46:58,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 1078 transitions, 16783 flow [2025-01-09 16:46:59,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 1078 transitions, 15525 flow, removed 555 selfloop flow, removed 15 redundant places. [2025-01-09 16:46:59,382 INFO L231 Difference]: Finished difference. Result has 223 places, 770 transitions, 10014 flow [2025-01-09 16:46:59,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9658, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=10014, PETRI_PLACES=223, PETRI_TRANSITIONS=770} [2025-01-09 16:46:59,383 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 188 predicate places. [2025-01-09 16:46:59,383 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 770 transitions, 10014 flow [2025-01-09 16:46:59,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.857142857142858) internal successors, (124), 14 states have internal predecessors, (124), 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:46:59,383 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:46:59,384 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:46:59,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 16:46:59,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:59,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:46:59,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:46:59,585 INFO L85 PathProgramCache]: Analyzing trace with hash 695424645, now seen corresponding path program 8 times [2025-01-09 16:46:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:46:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815938564] [2025-01-09 16:46:59,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:59,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:46:59,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:59,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:59,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:59,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:59,666 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:46:59,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:46:59,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815938564] [2025-01-09 16:46:59,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815938564] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:46:59,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326345398] [2025-01-09 16:46:59,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:46:59,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:46:59,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:46:59,672 INFO L229 MonitoredProcess]: Starting monitored process 10 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:46:59,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 16:46:59,710 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:46:59,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:46:59,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:46:59,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:46:59,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:46:59,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:46:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:46:59,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 16:46:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326345398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:46:59,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 16:46:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2025-01-09 16:46:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859217684] [2025-01-09 16:46:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:46:59,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:46:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:46:59,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:46:59,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:46:59,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:46:59,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 770 transitions, 10014 flow. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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:46:59,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:46:59,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:46:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:02,671 INFO L124 PetriNetUnfolderBase]: 15040/22717 cut-off events. [2025-01-09 16:47:02,672 INFO L125 PetriNetUnfolderBase]: For 192174/192252 co-relation queries the response was YES. [2025-01-09 16:47:02,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126260 conditions, 22717 events. 15040/22717 cut-off events. For 192174/192252 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 152567 event pairs, 4120 based on Foata normal form. 38/22753 useless extension candidates. Maximal degree in co-relation 123480. Up to 10186 conditions per place. [2025-01-09 16:47:02,938 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 1259 selfloop transitions, 89 changer transitions 0/1351 dead transitions. [2025-01-09 16:47:02,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1351 transitions, 20125 flow [2025-01-09 16:47:02,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:47:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:47:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2025-01-09 16:47:02,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2025-01-09 16:47:02,941 INFO L175 Difference]: Start difference. First operand has 223 places, 770 transitions, 10014 flow. Second operand 12 states and 187 transitions. [2025-01-09 16:47:02,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1351 transitions, 20125 flow [2025-01-09 16:47:03,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 1351 transitions, 19894 flow, removed 40 selfloop flow, removed 5 redundant places. [2025-01-09 16:47:03,670 INFO L231 Difference]: Finished difference. Result has 239 places, 821 transitions, 11078 flow [2025-01-09 16:47:03,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9893, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11078, PETRI_PLACES=239, PETRI_TRANSITIONS=821} [2025-01-09 16:47:03,671 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 204 predicate places. [2025-01-09 16:47:03,671 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 821 transitions, 11078 flow [2025-01-09 16:47:03,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 9 states have internal predecessors, (72), 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:47:03,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:03,671 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:47:03,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 16:47:03,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:03,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:03,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1012265935, now seen corresponding path program 9 times [2025-01-09 16:47:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567387480] [2025-01-09 16:47:03,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:03,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:47:03,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:03,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:47:03,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:03,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:03,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:03,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567387480] [2025-01-09 16:47:03,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567387480] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533880757] [2025-01-09 16:47:03,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:47:03,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:03,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:03,944 INFO L229 MonitoredProcess]: Starting monitored process 11 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:47:03,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 16:47:03,984 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:47:04,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:04,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 16:47:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:04,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:04,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:04,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:04,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533880757] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:04,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:04,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-09 16:47:04,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650906045] [2025-01-09 16:47:04,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:04,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:47:04,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:04,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:47:04,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:47:04,114 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:47:04,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 821 transitions, 11078 flow. Second operand has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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:47:04,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:04,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:47:04,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:06,731 INFO L124 PetriNetUnfolderBase]: 10836/16921 cut-off events. [2025-01-09 16:47:06,732 INFO L125 PetriNetUnfolderBase]: For 184364/184936 co-relation queries the response was YES. [2025-01-09 16:47:06,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103120 conditions, 16921 events. 10836/16921 cut-off events. For 184364/184936 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 115833 event pairs, 3631 based on Foata normal form. 1140/18029 useless extension candidates. Maximal degree in co-relation 101567. Up to 6365 conditions per place. [2025-01-09 16:47:06,895 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 850 selfloop transitions, 86 changer transitions 0/941 dead transitions. [2025-01-09 16:47:06,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 941 transitions, 14317 flow [2025-01-09 16:47:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2025-01-09 16:47:06,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-01-09 16:47:06,896 INFO L175 Difference]: Start difference. First operand has 239 places, 821 transitions, 11078 flow. Second operand 7 states and 121 transitions. [2025-01-09 16:47:06,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 941 transitions, 14317 flow [2025-01-09 16:47:07,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 941 transitions, 14211 flow, removed 53 selfloop flow, removed 0 redundant places. [2025-01-09 16:47:07,993 INFO L231 Difference]: Finished difference. Result has 246 places, 743 transitions, 10188 flow [2025-01-09 16:47:07,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=9921, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=740, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=10188, PETRI_PLACES=246, PETRI_TRANSITIONS=743} [2025-01-09 16:47:07,995 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 211 predicate places. [2025-01-09 16:47:07,995 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 743 transitions, 10188 flow [2025-01-09 16:47:07,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.5) internal successors, (133), 14 states have internal predecessors, (133), 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:47:07,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:07,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:47:08,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:08,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 16:47:08,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:08,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:08,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1729741806, now seen corresponding path program 1 times [2025-01-09 16:47:08,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:08,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600382985] [2025-01-09 16:47:08,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:08,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:08,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:47:08,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:08,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:08,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:08,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600382985] [2025-01-09 16:47:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600382985] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:08,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423467142] [2025-01-09 16:47:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:47:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:08,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:08,426 INFO L229 MonitoredProcess]: Starting monitored process 12 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:47:08,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 16:47:08,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 16:47:08,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:08,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:08,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:08,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 16:47:08,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:08,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:08,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:08,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423467142] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:08,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:08,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 16:47:08,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141162120] [2025-01-09 16:47:08,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:08,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:47:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:08,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:47:08,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:47:08,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:47:08,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 743 transitions, 10188 flow. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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:47:08,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:08,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:47:08,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:09,871 INFO L124 PetriNetUnfolderBase]: 5462/8909 cut-off events. [2025-01-09 16:47:09,872 INFO L125 PetriNetUnfolderBase]: For 111829/111955 co-relation queries the response was YES. [2025-01-09 16:47:09,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55640 conditions, 8909 events. 5462/8909 cut-off events. For 111829/111955 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 59159 event pairs, 2671 based on Foata normal form. 283/9174 useless extension candidates. Maximal degree in co-relation 55562. Up to 5155 conditions per place. [2025-01-09 16:47:09,971 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 477 selfloop transitions, 16 changer transitions 0/501 dead transitions. [2025-01-09 16:47:09,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 501 transitions, 8031 flow [2025-01-09 16:47:09,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:47:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:47:09,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-01-09 16:47:09,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.494949494949495 [2025-01-09 16:47:09,977 INFO L175 Difference]: Start difference. First operand has 246 places, 743 transitions, 10188 flow. Second operand 6 states and 98 transitions. [2025-01-09 16:47:09,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 501 transitions, 8031 flow [2025-01-09 16:47:10,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 501 transitions, 7706 flow, removed 80 selfloop flow, removed 11 redundant places. [2025-01-09 16:47:10,406 INFO L231 Difference]: Finished difference. Result has 223 places, 404 transitions, 5552 flow [2025-01-09 16:47:10,407 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5464, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5552, PETRI_PLACES=223, PETRI_TRANSITIONS=404} [2025-01-09 16:47:10,407 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 188 predicate places. [2025-01-09 16:47:10,407 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 404 transitions, 5552 flow [2025-01-09 16:47:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 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:47:10,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:10,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:47:10,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 16:47:10,611 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -280429095, now seen corresponding path program 10 times [2025-01-09 16:47:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049677418] [2025-01-09 16:47:10,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:47:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:10,616 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-01-09 16:47:10,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 29 statements. [2025-01-09 16:47:10,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 16:47:10,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:10,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:10,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:10,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049677418] [2025-01-09 16:47:10,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049677418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:47:10,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:47:10,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 16:47:10,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800357075] [2025-01-09 16:47:10,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:10,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 16:47:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:10,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 16:47:10,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 16:47:10,670 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:47:10,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 404 transitions, 5552 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:10,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:10,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:47:10,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:12,198 INFO L124 PetriNetUnfolderBase]: 8649/13147 cut-off events. [2025-01-09 16:47:12,198 INFO L125 PetriNetUnfolderBase]: For 128853/129259 co-relation queries the response was YES. [2025-01-09 16:47:12,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77038 conditions, 13147 events. 8649/13147 cut-off events. For 128853/129259 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 81087 event pairs, 1786 based on Foata normal form. 204/13340 useless extension candidates. Maximal degree in co-relation 76965. Up to 4365 conditions per place. [2025-01-09 16:47:12,329 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 386 selfloop transitions, 99 changer transitions 19/507 dead transitions. [2025-01-09 16:47:12,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 507 transitions, 7578 flow [2025-01-09 16:47:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 16:47:12,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-09 16:47:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2025-01-09 16:47:12,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2025-01-09 16:47:12,330 INFO L175 Difference]: Start difference. First operand has 223 places, 404 transitions, 5552 flow. Second operand 8 states and 133 transitions. [2025-01-09 16:47:12,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 507 transitions, 7578 flow [2025-01-09 16:47:12,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 507 transitions, 7523 flow, removed 24 selfloop flow, removed 3 redundant places. [2025-01-09 16:47:12,932 INFO L231 Difference]: Finished difference. Result has 230 places, 404 transitions, 5743 flow [2025-01-09 16:47:12,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5533, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5743, PETRI_PLACES=230, PETRI_TRANSITIONS=404} [2025-01-09 16:47:12,933 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 195 predicate places. [2025-01-09 16:47:12,933 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 404 transitions, 5743 flow [2025-01-09 16:47:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:12,933 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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:47:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 16:47:12,934 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash 160225109, now seen corresponding path program 11 times [2025-01-09 16:47:12,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:12,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771363169] [2025-01-09 16:47:12,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:12,938 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-01-09 16:47:12,941 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:12,942 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:47:12,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:13,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:13,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771363169] [2025-01-09 16:47:13,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771363169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:13,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163511637] [2025-01-09 16:47:13,009 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 16:47:13,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:13,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:13,011 INFO L229 MonitoredProcess]: Starting monitored process 13 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:47:13,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 16:47:13,055 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 3 equivalence classes. [2025-01-09 16:47:13,070 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 16:47:13,070 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-01-09 16:47:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:13,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 16:47:13,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:13,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:13,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:13,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163511637] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:13,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:13,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-01-09 16:47:13,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217003324] [2025-01-09 16:47:13,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:13,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 16:47:13,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:13,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 16:47:13,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 16:47:13,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-01-09 16:47:13,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 404 transitions, 5743 flow. Second operand has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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:47:13,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:13,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-01-09 16:47:13,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:14,495 INFO L124 PetriNetUnfolderBase]: 5483/8786 cut-off events. [2025-01-09 16:47:14,495 INFO L125 PetriNetUnfolderBase]: For 98595/98797 co-relation queries the response was YES. [2025-01-09 16:47:14,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53971 conditions, 8786 events. 5483/8786 cut-off events. For 98595/98797 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 56686 event pairs, 2549 based on Foata normal form. 420/9164 useless extension candidates. Maximal degree in co-relation 53895. Up to 5693 conditions per place. [2025-01-09 16:47:14,577 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 237 selfloop transitions, 3 changer transitions 184/431 dead transitions. [2025-01-09 16:47:14,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 431 transitions, 6998 flow [2025-01-09 16:47:14,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 16:47:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-09 16:47:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-01-09 16:47:14,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2025-01-09 16:47:14,578 INFO L175 Difference]: Start difference. First operand has 230 places, 404 transitions, 5743 flow. Second operand 7 states and 110 transitions. [2025-01-09 16:47:14,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 431 transitions, 6998 flow [2025-01-09 16:47:15,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 431 transitions, 6752 flow, removed 4 selfloop flow, removed 6 redundant places. [2025-01-09 16:47:15,093 INFO L231 Difference]: Finished difference. Result has 229 places, 247 transitions, 3072 flow [2025-01-09 16:47:15,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=5188, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3072, PETRI_PLACES=229, PETRI_TRANSITIONS=247} [2025-01-09 16:47:15,094 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 194 predicate places. [2025-01-09 16:47:15,094 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 247 transitions, 3072 flow [2025-01-09 16:47:15,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.357142857142858) internal successors, (131), 14 states have internal predecessors, (131), 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:47:15,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:15,095 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:47:15,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:15,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:15,296 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:15,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1086023991, now seen corresponding path program 12 times [2025-01-09 16:47:15,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:15,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120073332] [2025-01-09 16:47:15,297 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:15,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:15,302 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:47:15,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:47:15,312 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:47:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:15,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 16:47:15,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120073332] [2025-01-09 16:47:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120073332] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155929955] [2025-01-09 16:47:15,386 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 16:47:15,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:15,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:15,387 INFO L229 MonitoredProcess]: Starting monitored process 14 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:47:15,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 16:47:15,430 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 2 equivalence classes. [2025-01-09 16:47:15,447 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:47:15,447 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 16:47:15,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:15,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:47:15,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:15,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:15,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155929955] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:15,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 16:47:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 19 [2025-01-09 16:47:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633202871] [2025-01-09 16:47:15,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:47:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 16:47:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:15,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 16:47:15,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2025-01-09 16:47:15,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:47:15,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 247 transitions, 3072 flow. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:15,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:15,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:47:15,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:47:17,208 INFO L124 PetriNetUnfolderBase]: 7642/11295 cut-off events. [2025-01-09 16:47:17,208 INFO L125 PetriNetUnfolderBase]: For 112775/112795 co-relation queries the response was YES. [2025-01-09 16:47:17,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69271 conditions, 11295 events. 7642/11295 cut-off events. For 112775/112795 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 66068 event pairs, 952 based on Foata normal form. 60/11351 useless extension candidates. Maximal degree in co-relation 69196. Up to 4917 conditions per place. [2025-01-09 16:47:17,477 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 541 selfloop transitions, 74 changer transitions 0/620 dead transitions. [2025-01-09 16:47:17,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 620 transitions, 8387 flow [2025-01-09 16:47:17,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 16:47:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 16:47:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 191 transitions. [2025-01-09 16:47:17,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44522144522144524 [2025-01-09 16:47:17,479 INFO L175 Difference]: Start difference. First operand has 229 places, 247 transitions, 3072 flow. Second operand 13 states and 191 transitions. [2025-01-09 16:47:17,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 620 transitions, 8387 flow [2025-01-09 16:47:17,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 620 transitions, 7754 flow, removed 219 selfloop flow, removed 28 redundant places. [2025-01-09 16:47:17,736 INFO L231 Difference]: Finished difference. Result has 185 places, 284 transitions, 3307 flow [2025-01-09 16:47:17,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3307, PETRI_PLACES=185, PETRI_TRANSITIONS=284} [2025-01-09 16:47:17,737 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 150 predicate places. [2025-01-09 16:47:17,737 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 284 transitions, 3307 flow [2025-01-09 16:47:17,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:47:17,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:47:17,737 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:47:17,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 16:47:17,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 16:47:17,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-09 16:47:17,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:47:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash 620891751, now seen corresponding path program 13 times [2025-01-09 16:47:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:47:17,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678801577] [2025-01-09 16:47:17,939 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:17,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:47:17,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:47:17,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:47:17,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:18,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:47:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678801577] [2025-01-09 16:47:18,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678801577] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:47:18,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865370240] [2025-01-09 16:47:18,058 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 16:47:18,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:47:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:47:18,060 INFO L229 MonitoredProcess]: Starting monitored process 15 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:47:18,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 16:47:18,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 16:47:18,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 16:47:18,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:47:18,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:47:18,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 16:47:18,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:47:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:18,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:47:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 16:47:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865370240] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:47:18,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:47:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-01-09 16:47:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521345251] [2025-01-09 16:47:18,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:47:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 16:47:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:47:18,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 16:47:18,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2025-01-09 16:47:18,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 33 [2025-01-09 16:47:18,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 284 transitions, 3307 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 states have internal predecessors, (146), 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:47:18,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:47:18,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 33 [2025-01-09 16:47:18,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand