./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-10.i --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/pthread/fib_unsafe-10.i -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 89d9c43e2f37f1bac8114d01260f8a993f33530b50231d4afed1f3cf3859d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:19:47,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:19:47,782 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:19:47,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:19:47,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:19:47,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:19:47,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:19:47,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:19:47,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:19:47,813 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:19:47,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:19:47,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:19:47,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:19:47,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:19:47,814 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:19:47,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:19:47,815 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:19:47,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:19:47,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:19:47,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:19:47,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:19:47,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:19:47,817 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 -> 89d9c43e2f37f1bac8114d01260f8a993f33530b50231d4afed1f3cf3859d385 [2025-01-09 16:19:48,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:19:48,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:19:48,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:19:48,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:19:48,034 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:19:48,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-10.i [2025-01-09 16:19:49,168 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6783a670/d04ce3f6a0214bf597086167a28ad4fe/FLAGe06c576e3 [2025-01-09 16:19:49,557 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:19:49,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-10.i [2025-01-09 16:19:49,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6783a670/d04ce3f6a0214bf597086167a28ad4fe/FLAGe06c576e3 [2025-01-09 16:19:49,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6783a670/d04ce3f6a0214bf597086167a28ad4fe [2025-01-09 16:19:49,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:19:49,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:19:49,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:19:49,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:19:49,766 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:19:49,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:49" (1/1) ... [2025-01-09 16:19:49,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdf414e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:49, skipping insertion in model container [2025-01-09 16:19:49,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:19:49" (1/1) ... [2025-01-09 16:19:49,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:19:50,031 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/pthread/fib_unsafe-10.i[30243,30256] [2025-01-09 16:19:50,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:19:50,083 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:19:50,120 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/pthread/fib_unsafe-10.i[30243,30256] [2025-01-09 16:19:50,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:19:50,148 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:19:50,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50 WrapperNode [2025-01-09 16:19:50,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:19:50,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:19:50,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:19:50,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:19:50,153 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:19:50" (1/1) ... [2025-01-09 16:19:50,161 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:19:50" (1/1) ... [2025-01-09 16:19:50,171 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-01-09 16:19:50,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:19:50,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:19:50,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:19:50,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:19:50,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,185 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,197 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 16:19:50,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:19:50,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:19:50,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:19:50,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:19:50,217 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (1/1) ... [2025-01-09 16:19:50,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:19:50,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:19:50,242 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:19:50,250 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:19:50,271 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:19:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:19:50,272 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:19:50,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:19:50,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:19:50,273 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:19:50,372 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:19:50,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:19:50,523 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:19:50,524 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:19:50,587 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:19:50,588 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:19:50,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:50 BoogieIcfgContainer [2025-01-09 16:19:50,588 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:19:50,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:19:50,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:19:50,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:19:50,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:19:49" (1/3) ... [2025-01-09 16:19:50,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2849abff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:50, skipping insertion in model container [2025-01-09 16:19:50,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:19:50" (2/3) ... [2025-01-09 16:19:50,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2849abff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:19:50, skipping insertion in model container [2025-01-09 16:19:50,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:19:50" (3/3) ... [2025-01-09 16:19:50,597 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2025-01-09 16:19:50,608 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:19:50,609 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-10.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:19:50,609 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:19:50,643 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:19:50,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:19:50,692 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-09 16:19:50,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:19:50,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-01-09 16:19:50,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:19:50,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-01-09 16:19:50,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:19:50,714 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;@45461f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:19:50,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:19:50,720 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:19:50,721 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-01-09 16:19:50,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:19:50,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:19:50,721 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:19:50,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:19:50,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:19:50,726 INFO L85 PathProgramCache]: Analyzing trace with hash 55803422, now seen corresponding path program 1 times [2025-01-09 16:19:50,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:19:50,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911561819] [2025-01-09 16:19:50,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:19:50,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:19:50,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:19:50,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:19:50,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:19:50,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:50,914 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:19:50,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:19:50,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911561819] [2025-01-09 16:19:50,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911561819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:19:50,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:19:50,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:19:50,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924315780] [2025-01-09 16:19:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:19:50,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:19:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:19:50,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:19:50,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:19:50,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:19:50,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:19:50,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:19:50,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:19:50,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:19:51,057 INFO L124 PetriNetUnfolderBase]: 115/223 cut-off events. [2025-01-09 16:19:51,058 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:19:51,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 223 events. 115/223 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 692 event pairs, 20 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 398. Up to 118 conditions per place. [2025-01-09 16:19:51,060 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 20 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2025-01-09 16:19:51,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 118 flow [2025-01-09 16:19:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:19:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:19:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-01-09 16:19:51,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2025-01-09 16:19:51,070 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 61 transitions. [2025-01-09 16:19:51,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 118 flow [2025-01-09 16:19:51,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 16:19:51,074 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-01-09 16:19:51,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-01-09 16:19:51,078 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-01-09 16:19:51,078 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-01-09 16:19:51,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:19:51,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:19:51,079 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:19:51,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:19:51,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:19:51,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:19:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1745155739, now seen corresponding path program 1 times [2025-01-09 16:19:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:19:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273626225] [2025-01-09 16:19:51,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:19:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:19:51,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:19:51,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:19:51,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:19:51,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:51,185 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:19:51,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:19:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273626225] [2025-01-09 16:19:51,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273626225] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:19:51,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454468467] [2025-01-09 16:19:51,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:19:51,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:19:51,188 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:19:51,189 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:19:51,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:19:51,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:19:51,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:19:51,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:51,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:19:51,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:19:51,274 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:19:51,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:19:51,289 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:19:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454468467] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:19:51,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:19:51,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 16:19:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606279374] [2025-01-09 16:19:51,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:19:51,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:19:51,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:19:51,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:19:51,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:19:51,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:19:51,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:19:51,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:19:51,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:19:51,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:19:51,392 INFO L124 PetriNetUnfolderBase]: 151/277 cut-off events. [2025-01-09 16:19:51,392 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:19:51,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 277 events. 151/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 798 event pairs, 20 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 569. Up to 91 conditions per place. [2025-01-09 16:19:51,397 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 38 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-09 16:19:51,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 212 flow [2025-01-09 16:19:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:19:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:19:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-09 16:19:51,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-01-09 16:19:51,399 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 6 states and 118 transitions. [2025-01-09 16:19:51,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 212 flow [2025-01-09 16:19:51,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 53 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 16:19:51,401 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 100 flow [2025-01-09 16:19:51,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-01-09 16:19:51,401 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-01-09 16:19:51,401 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 100 flow [2025-01-09 16:19:51,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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:19:51,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:19:51,402 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:19:51,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 16:19:51,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:51,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:19:51,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:19:51,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1613509982, now seen corresponding path program 2 times [2025-01-09 16:19:51,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:19:51,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435251004] [2025-01-09 16:19:51,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:19:51,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:19:51,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:19:51,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:19:51,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:19:51,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:51,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:19:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435251004] [2025-01-09 16:19:51,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435251004] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:19:51,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892083197] [2025-01-09 16:19:51,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:19:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:19:51,710 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:19:51,711 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:19:51,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:19:51,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:19:51,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:19:51,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:51,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:19:51,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:19:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:51,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:19:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892083197] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:19:51,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:19:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 16:19:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831031184] [2025-01-09 16:19:51,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:19:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:19:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:19:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:19:51,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:19:51,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:19:51,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 100 flow. Second operand has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:19:51,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:19:51,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:19:51,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:19:51,991 INFO L124 PetriNetUnfolderBase]: 259/439 cut-off events. [2025-01-09 16:19:51,991 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-01-09 16:19:51,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 439 events. 259/439 cut-off events. For 207/207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1196 event pairs, 20 based on Foata normal form. 54/479 useless extension candidates. Maximal degree in co-relation 1091. Up to 109 conditions per place. [2025-01-09 16:19:51,997 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 74 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2025-01-09 16:19:51,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 426 flow [2025-01-09 16:19:51,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:19:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:19:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2025-01-09 16:19:52,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752873563218391 [2025-01-09 16:19:52,000 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 100 flow. Second operand 12 states and 235 transitions. [2025-01-09 16:19:52,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 426 flow [2025-01-09 16:19:52,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 95 transitions, 412 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-01-09 16:19:52,007 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 170 flow [2025-01-09 16:19:52,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=170, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2025-01-09 16:19:52,007 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-01-09 16:19:52,007 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 170 flow [2025-01-09 16:19:52,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.538461538461538) internal successors, (176), 13 states have internal predecessors, (176), 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:19:52,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:19:52,008 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:19:52,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 16:19:52,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:52,208 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:19:52,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:19:52,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1271708734, now seen corresponding path program 3 times [2025-01-09 16:19:52,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:19:52,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771409843] [2025-01-09 16:19:52,209 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:19:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:19:52,221 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:19:52,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:19:52,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:19:52,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:52,478 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:52,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:19:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771409843] [2025-01-09 16:19:52,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771409843] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:19:52,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673179181] [2025-01-09 16:19:52,479 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:19:52,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:52,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:19:52,481 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:19:52,484 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:19:52,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:19:52,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:19:52,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:19:52,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:52,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:19:52,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:19:52,589 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:52,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:19:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:52,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673179181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:19:52,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:19:52,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 16:19:52,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003956279] [2025-01-09 16:19:52,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:19:52,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 16:19:52,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:19:52,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 16:19:52,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-01-09 16:19:52,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:19:52,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 170 flow. Second operand has 25 states, 25 states have (on average 13.28) internal successors, (332), 25 states have internal predecessors, (332), 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:19:52,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:19:52,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:19:52,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:19:53,065 INFO L124 PetriNetUnfolderBase]: 475/763 cut-off events. [2025-01-09 16:19:53,068 INFO L125 PetriNetUnfolderBase]: For 4203/4203 co-relation queries the response was YES. [2025-01-09 16:19:53,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 763 events. 475/763 cut-off events. For 4203/4203 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1995 event pairs, 20 based on Foata normal form. 108/857 useless extension candidates. Maximal degree in co-relation 2216. Up to 190 conditions per place. [2025-01-09 16:19:53,073 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 146 selfloop transitions, 23 changer transitions 0/179 dead transitions. [2025-01-09 16:19:53,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 179 transitions, 868 flow [2025-01-09 16:19:53,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 16:19:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-01-09 16:19:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 469 transitions. [2025-01-09 16:19:53,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6738505747126436 [2025-01-09 16:19:53,075 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 170 flow. Second operand 24 states and 469 transitions. [2025-01-09 16:19:53,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 179 transitions, 868 flow [2025-01-09 16:19:53,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 179 transitions, 796 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-01-09 16:19:53,088 INFO L231 Difference]: Finished difference. Result has 83 places, 47 transitions, 290 flow [2025-01-09 16:19:53,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=290, PETRI_PLACES=83, PETRI_TRANSITIONS=47} [2025-01-09 16:19:53,089 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 53 predicate places. [2025-01-09 16:19:53,090 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 47 transitions, 290 flow [2025-01-09 16:19:53,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 13.28) internal successors, (332), 25 states have internal predecessors, (332), 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:19:53,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:19:53,090 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:19:53,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 16:19:53,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:53,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:19:53,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:19:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1886268930, now seen corresponding path program 4 times [2025-01-09 16:19:53,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:19:53,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477330942] [2025-01-09 16:19:53,295 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:19:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:19:53,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-01-09 16:19:53,344 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:19:53,344 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:19:53,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:54,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:19:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477330942] [2025-01-09 16:19:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477330942] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:19:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613873846] [2025-01-09 16:19:54,743 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:19:54,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:19:54,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:19:54,745 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:19:54,745 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:19:54,781 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-01-09 16:19:54,809 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 16:19:54,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:19:54,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:19:54,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-01-09 16:19:54,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:19:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:56,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:19:57,693 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:19:57,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613873846] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:19:57,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:19:57,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2025-01-09 16:19:57,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530761322] [2025-01-09 16:19:57,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:19:57,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2025-01-09 16:19:57,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:19:57,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2025-01-09 16:19:57,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=6283, Unknown=0, NotChecked=0, Total=7310 [2025-01-09 16:19:57,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-01-09 16:19:57,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 47 transitions, 290 flow. Second operand has 86 states, 86 states have (on average 6.186046511627907) internal successors, (532), 86 states have internal predecessors, (532), 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:19:57,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:19:57,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-01-09 16:19:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:29,733 INFO L124 PetriNetUnfolderBase]: 31510/50982 cut-off events. [2025-01-09 16:20:29,733 INFO L125 PetriNetUnfolderBase]: For 171672/171672 co-relation queries the response was YES. [2025-01-09 16:20:29,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146807 conditions, 50982 events. 31510/50982 cut-off events. For 171672/171672 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 339772 event pairs, 599 based on Foata normal form. 0/50486 useless extension candidates. Maximal degree in co-relation 146767. Up to 7717 conditions per place. [2025-01-09 16:20:30,055 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 693 selfloop transitions, 1174 changer transitions 1053/2923 dead transitions. [2025-01-09 16:20:30,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 2923 transitions, 20971 flow [2025-01-09 16:20:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2025-01-09 16:20:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2025-01-09 16:20:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 3020 transitions. [2025-01-09 16:20:30,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.469089779434607 [2025-01-09 16:20:30,070 INFO L175 Difference]: Start difference. First operand has 83 places, 47 transitions, 290 flow. Second operand 222 states and 3020 transitions. [2025-01-09 16:20:30,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 2923 transitions, 20971 flow [2025-01-09 16:20:30,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 2923 transitions, 16309 flow, removed 1850 selfloop flow, removed 11 redundant places. [2025-01-09 16:20:30,481 INFO L231 Difference]: Finished difference. Result has 395 places, 1304 transitions, 8060 flow [2025-01-09 16:20:30,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=222, PETRI_FLOW=8060, PETRI_PLACES=395, PETRI_TRANSITIONS=1304} [2025-01-09 16:20:30,486 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 365 predicate places. [2025-01-09 16:20:30,486 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 1304 transitions, 8060 flow [2025-01-09 16:20:30,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 6.186046511627907) internal successors, (532), 86 states have internal predecessors, (532), 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:20:30,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:30,490 INFO L206 CegarLoopForPetriNet]: trace histogram [22, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:30,521 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:20:30,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:30,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-01-09 16:20:30,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:30,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1451460216, now seen corresponding path program 1 times [2025-01-09 16:20:30,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:30,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-01-09 16:20:30,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:30,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:30,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:20:30,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:20:30,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:30,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675310598] [2025-01-09 16:20:32,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675310598] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:32,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429383920] [2025-01-09 16:20:32,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:32,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:32,067 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:20:32,068 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:20:32,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 16:20:32,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 16:20:32,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:32,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:32,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-01-09 16:20:32,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 126 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:33,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429383920] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:35,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-01-09 16:20:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126062345] [2025-01-09 16:20:35,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2025-01-09 16:20:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:35,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2025-01-09 16:20:35,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1067, Invalid=7305, Unknown=0, NotChecked=0, Total=8372 [2025-01-09 16:20:35,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-01-09 16:20:35,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 1304 transitions, 8060 flow. Second operand has 92 states, 92 states have (on average 6.239130434782608) internal successors, (574), 92 states have internal predecessors, (574), 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:20:35,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:35,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-01-09 16:20:35,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand