./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-5.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-5.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 e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 16:20:09,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 16:20:09,073 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:20:09,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 16:20:09,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 16:20:09,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 16:20:09,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 16:20:09,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 16:20:09,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 16:20:09,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 16:20:09,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 16:20:09,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 16:20:09,102 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 16:20:09,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 16:20:09,102 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 16:20:09,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 16:20:09,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 16:20:09,104 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:09,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:09,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:09,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 16:20:09,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 16:20:09,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 16:20:09,106 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 -> e0f90189cbea201dcd094fc9e84327a00ade17017ada90c5df84c8712afaf176 [2025-01-09 16:20:09,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 16:20:09,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 16:20:09,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 16:20:09,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 16:20:09,291 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 16:20:09,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5.i [2025-01-09 16:20:10,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4354f012e/f959d741e9bb4229a9d785aac1c2b460/FLAGd40e28fab [2025-01-09 16:20:10,661 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 16:20:10,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5.i [2025-01-09 16:20:10,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4354f012e/f959d741e9bb4229a9d785aac1c2b460/FLAGd40e28fab [2025-01-09 16:20:10,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4354f012e/f959d741e9bb4229a9d785aac1c2b460 [2025-01-09 16:20:10,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 16:20:10,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 16:20:10,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:10,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 16:20:10,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 16:20:10,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:10,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f5ffe3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10, skipping insertion in model container [2025-01-09 16:20:10,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:10,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 16:20:10,873 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-5.i[30243,30256] [2025-01-09 16:20:10,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:10,900 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 16:20:10,938 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-5.i[30243,30256] [2025-01-09 16:20:10,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 16:20:10,970 INFO L204 MainTranslator]: Completed translation [2025-01-09 16:20:10,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10 WrapperNode [2025-01-09 16:20:10,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 16:20:10,971 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:10,971 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 16:20:10,971 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 16:20:10,975 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:20:10" (1/1) ... [2025-01-09 16:20:10,982 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:20:10" (1/1) ... [2025-01-09 16:20:10,993 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-01-09 16:20:10,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 16:20:10,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 16:20:10,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 16:20:10,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 16:20:10,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:10,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,008 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:20:11,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 16:20:11,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 16:20:11,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 16:20:11,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 16:20:11,016 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (1/1) ... [2025-01-09 16:20:11,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 16:20:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:11,040 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:20:11,042 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:20:11,056 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-01-09 16:20:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-01-09 16:20:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 16:20:11,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 16:20:11,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 16:20:11,058 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:20:11,133 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 16:20:11,135 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 16:20:11,268 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 16:20:11,268 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 16:20:11,353 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 16:20:11,355 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 16:20:11,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:11 BoogieIcfgContainer [2025-01-09 16:20:11,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 16:20:11,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 16:20:11,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 16:20:11,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 16:20:11,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:20:10" (1/3) ... [2025-01-09 16:20:11,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b78356e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:11, skipping insertion in model container [2025-01-09 16:20:11,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:20:10" (2/3) ... [2025-01-09 16:20:11,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b78356e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:20:11, skipping insertion in model container [2025-01-09 16:20:11,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:20:11" (3/3) ... [2025-01-09 16:20:11,366 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2025-01-09 16:20:11,376 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 16:20:11,377 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-5.i that has 3 procedures, 26 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-09 16:20:11,377 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 16:20:11,405 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 16:20:11,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:20:11,453 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-01-09 16:20:11,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:20:11,459 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:20:11,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-01-09 16:20:11,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-01-09 16:20:11,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 16:20:11,478 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;@62f90d95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 16:20:11,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-01-09 16:20:11,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 16:20:11,487 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-01-09 16:20:11,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 16:20:11,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:11,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:11,488 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:20:11,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:11,491 INFO L85 PathProgramCache]: Analyzing trace with hash 55803422, now seen corresponding path program 1 times [2025-01-09 16:20:11,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:11,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721225649] [2025-01-09 16:20:11,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:11,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 16:20:11,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 16:20:11,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:11,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:11,698 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:20:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:11,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721225649] [2025-01-09 16:20:11,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721225649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 16:20:11,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 16:20:11,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 16:20:11,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371688085] [2025-01-09 16:20:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 16:20:11,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 16:20:11,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:11,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 16:20:11,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 16:20:11,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:11,732 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:20:11,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:11,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:11,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:11,838 INFO L124 PetriNetUnfolderBase]: 115/223 cut-off events. [2025-01-09 16:20:11,839 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 16:20:11,840 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:20:11,843 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 20 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2025-01-09 16:20:11,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 118 flow [2025-01-09 16:20:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 16:20:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 16:20:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-01-09 16:20:11,856 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7011494252873564 [2025-01-09 16:20:11,858 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:20:11,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 118 flow [2025-01-09 16:20:11,861 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:20:11,863 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-01-09 16:20:11,866 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:20:11,868 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2025-01-09 16:20:11,868 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-01-09 16:20:11,868 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:20:11,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:11,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:11,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 16:20:11,869 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:20:11,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:11,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1745155739, now seen corresponding path program 1 times [2025-01-09 16:20:11,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:11,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611566302] [2025-01-09 16:20:11,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:11,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:11,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:20:11,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:20:11,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:11,954 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:20:11,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:11,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611566302] [2025-01-09 16:20:11,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611566302] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261889071] [2025-01-09 16:20:11,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:11,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:11,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:11,961 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:20:11,961 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:20:12,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 16:20:12,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 16:20:12,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:12,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:12,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 16:20:12,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:12,048 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:20:12,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:12,065 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:20:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261889071] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:12,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:12,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 16:20:12,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327588443] [2025-01-09 16:20:12,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:12,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 16:20:12,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:12,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 16:20:12,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 16:20:12,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:12,067 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:20:12,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:12,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:12,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:12,160 INFO L124 PetriNetUnfolderBase]: 151/277 cut-off events. [2025-01-09 16:20:12,160 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 16:20:12,161 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:20:12,162 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 38 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2025-01-09 16:20:12,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 212 flow [2025-01-09 16:20:12,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 16:20:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 16:20:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-01-09 16:20:12,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2025-01-09 16:20:12,164 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:20:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 212 flow [2025-01-09 16:20:12,164 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:20:12,165 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 100 flow [2025-01-09 16:20:12,165 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:20:12,165 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2025-01-09 16:20:12,166 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 100 flow [2025-01-09 16:20:12,166 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:20:12,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:12,166 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:12,173 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:20:12,366 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:20:12,367 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:20:12,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:12,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1613509982, now seen corresponding path program 2 times [2025-01-09 16:20:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395277733] [2025-01-09 16:20:12,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:12,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:20:12,388 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:20:12,388 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:12,515 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:20:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395277733] [2025-01-09 16:20:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395277733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061278960] [2025-01-09 16:20:12,515 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 16:20:12,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:12,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:12,519 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:20:12,520 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:20:12,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-01-09 16:20:12,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 16:20:12,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 16:20:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:12,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 16:20:12,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:12,603 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:20:12,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:12,657 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:20:12,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061278960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:12,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:12,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 16:20:12,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314048945] [2025-01-09 16:20:12,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:12,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 16:20:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:12,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 16:20:12,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-09 16:20:12,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:12,659 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:20:12,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:12,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:12,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:12,859 INFO L124 PetriNetUnfolderBase]: 259/439 cut-off events. [2025-01-09 16:20:12,861 INFO L125 PetriNetUnfolderBase]: For 207/207 co-relation queries the response was YES. [2025-01-09 16:20:12,863 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:20:12,865 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 74 selfloop transitions, 11 changer transitions 0/95 dead transitions. [2025-01-09 16:20:12,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 95 transitions, 426 flow [2025-01-09 16:20:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 16:20:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 16:20:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 235 transitions. [2025-01-09 16:20:12,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752873563218391 [2025-01-09 16:20:12,869 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:20:12,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 95 transitions, 426 flow [2025-01-09 16:20:12,873 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:20:12,875 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 170 flow [2025-01-09 16:20:12,875 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:20:12,876 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2025-01-09 16:20:12,876 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 170 flow [2025-01-09 16:20:12,876 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:20:12,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:12,877 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:12,883 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:20:13,077 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:20:13,079 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:20:13,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:13,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1271708734, now seen corresponding path program 3 times [2025-01-09 16:20:13,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945265297] [2025-01-09 16:20:13,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:13,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:20:13,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:13,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:20:13,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:13,281 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:20:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945265297] [2025-01-09 16:20:13,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945265297] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:13,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049036396] [2025-01-09 16:20:13,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 16:20:13,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:13,289 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:20:13,293 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:20:13,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-01-09 16:20:13,351 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 16:20:13,351 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-09 16:20:13,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:13,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 16:20:13,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:13,390 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:20:13,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:13,485 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:20:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049036396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:13,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:13,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 15 [2025-01-09 16:20:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837121241] [2025-01-09 16:20:13,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:13,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 16:20:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:13,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 16:20:13,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-01-09 16:20:13,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 29 [2025-01-09 16:20:13,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 170 flow. Second operand has 15 states, 15 states have (on average 13.533333333333333) internal successors, (203), 15 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:13,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:13,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 29 [2025-01-09 16:20:13,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:13,655 INFO L124 PetriNetUnfolderBase]: 295/493 cut-off events. [2025-01-09 16:20:13,656 INFO L125 PetriNetUnfolderBase]: For 963/963 co-relation queries the response was YES. [2025-01-09 16:20:13,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 493 events. 295/493 cut-off events. For 963/963 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1334 event pairs, 20 based on Foata normal form. 18/497 useless extension candidates. Maximal degree in co-relation 1406. Up to 100 conditions per place. [2025-01-09 16:20:13,659 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 86 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2025-01-09 16:20:13,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 109 transitions, 528 flow [2025-01-09 16:20:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 16:20:13,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 16:20:13,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 269 transitions. [2025-01-09 16:20:13,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6625615763546798 [2025-01-09 16:20:13,662 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 170 flow. Second operand 14 states and 269 transitions. [2025-01-09 16:20:13,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 109 transitions, 528 flow [2025-01-09 16:20:13,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 109 transitions, 476 flow, removed 21 selfloop flow, removed 5 redundant places. [2025-01-09 16:20:13,672 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 170 flow [2025-01-09 16:20:13,672 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=14, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2025-01-09 16:20:13,673 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2025-01-09 16:20:13,673 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 170 flow [2025-01-09 16:20:13,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.533333333333333) internal successors, (203), 15 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 16:20:13,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:13,674 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:13,682 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:20:13,874 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:20:13,875 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:20:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1465596962, now seen corresponding path program 4 times [2025-01-09 16:20:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825191733] [2025-01-09 16:20:13,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:20:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:13,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:20:13,900 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:20:13,900 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:20:13,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825191733] [2025-01-09 16:20:14,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825191733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:14,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558729989] [2025-01-09 16:20:14,543 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 16:20:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:14,545 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:20:14,547 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:20:14,585 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-01-09 16:20:14,605 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 16:20:14,606 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 16:20:14,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:14,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 16:20:14,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:15,286 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:15,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:16,079 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:16,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558729989] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:16,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:16,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2025-01-09 16:20:16,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509969562] [2025-01-09 16:20:16,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:16,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 16:20:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:16,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 16:20:16,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=2678, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 16:20:16,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-01-09 16:20:16,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 37 transitions, 170 flow. Second operand has 56 states, 56 states have (on average 6.285714285714286) internal successors, (352), 56 states have internal predecessors, (352), 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:16,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:16,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-01-09 16:20:16,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:20:27,405 INFO L124 PetriNetUnfolderBase]: 12265/19887 cut-off events. [2025-01-09 16:20:27,405 INFO L125 PetriNetUnfolderBase]: For 30072/30072 co-relation queries the response was YES. [2025-01-09 16:20:27,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51517 conditions, 19887 events. 12265/19887 cut-off events. For 30072/30072 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 124062 event pairs, 399 based on Foata normal form. 0/19601 useless extension candidates. Maximal degree in co-relation 51487. Up to 2550 conditions per place. [2025-01-09 16:20:27,496 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 403 selfloop transitions, 404 changer transitions 613/1423 dead transitions. [2025-01-09 16:20:27,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1423 transitions, 8221 flow [2025-01-09 16:20:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-01-09 16:20:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2025-01-09 16:20:27,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 1780 transitions. [2025-01-09 16:20:27,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46499477533960293 [2025-01-09 16:20:27,505 INFO L175 Difference]: Start difference. First operand has 63 places, 37 transitions, 170 flow. Second operand 132 states and 1780 transitions. [2025-01-09 16:20:27,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1423 transitions, 8221 flow [2025-01-09 16:20:27,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1423 transitions, 7239 flow, removed 210 selfloop flow, removed 11 redundant places. [2025-01-09 16:20:27,578 INFO L231 Difference]: Finished difference. Result has 245 places, 484 transitions, 3000 flow [2025-01-09 16:20:27,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=132, PETRI_FLOW=3000, PETRI_PLACES=245, PETRI_TRANSITIONS=484} [2025-01-09 16:20:27,581 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2025-01-09 16:20:27,581 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 484 transitions, 3000 flow [2025-01-09 16:20:27,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.285714285714286) internal successors, (352), 56 states have internal predecessors, (352), 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:27,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 16:20:27,582 INFO L206 CegarLoopForPetriNet]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 16:20:27,590 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:27,786 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:27,786 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:27,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 16:20:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash -444412836, now seen corresponding path program 1 times [2025-01-09 16:20:27,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 16:20:27,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481277454] [2025-01-09 16:20:27,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:27,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 16:20:27,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:20:27,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:20:27,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:27,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 16:20:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481277454] [2025-01-09 16:20:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481277454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 16:20:28,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860021908] [2025-01-09 16:20:28,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 16:20:28,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 16:20:28,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 16:20:28,455 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:28,456 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:28,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 16:20:28,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 16:20:28,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 16:20:28,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 16:20:28,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-01-09 16:20:28,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 16:20:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 55 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:29,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 16:20:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 16:20:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860021908] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 16:20:29,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 16:20:29,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2025-01-09 16:20:29,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150893771] [2025-01-09 16:20:29,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 16:20:29,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 16:20:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 16:20:29,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 16:20:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=3350, Unknown=0, NotChecked=0, Total=3782 [2025-01-09 16:20:30,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2025-01-09 16:20:30,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 484 transitions, 3000 flow. Second operand has 62 states, 62 states have (on average 6.354838709677419) internal successors, (394), 62 states have internal predecessors, (394), 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,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 16:20:30,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2025-01-09 16:20:30,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 16:21:31,907 INFO L124 PetriNetUnfolderBase]: 126760/208750 cut-off events. [2025-01-09 16:21:31,908 INFO L125 PetriNetUnfolderBase]: For 9393762/9393762 co-relation queries the response was YES. [2025-01-09 16:21:34,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100558 conditions, 208750 events. 126760/208750 cut-off events. For 9393762/9393762 co-relation queries the response was YES. Maximal size of possible extension queue 3481. Compared 1879578 event pairs, 7928 based on Foata normal form. 5070/213816 useless extension candidates. Maximal degree in co-relation 1100464. Up to 23712 conditions per place. [2025-01-09 16:21:35,616 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 1696 selfloop transitions, 4961 changer transitions 3153/9813 dead transitions. [2025-01-09 16:21:35,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 9813 transitions, 85331 flow [2025-01-09 16:21:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 392 states. [2025-01-09 16:21:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2025-01-09 16:21:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 5221 transitions. [2025-01-09 16:21:35,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4592716396903589 [2025-01-09 16:21:35,630 INFO L175 Difference]: Start difference. First operand has 245 places, 484 transitions, 3000 flow. Second operand 392 states and 5221 transitions. [2025-01-09 16:21:35,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 9813 transitions, 85331 flow