./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 00:58:09,889 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 00:58:09,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-14 00:58:09,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 00:58:09,953 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 00:58:09,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 00:58:09,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 00:58:09,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 00:58:09,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-14 00:58:09,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-14 00:58:09,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 00:58:09,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 00:58:09,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 00:58:09,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 00:58:09,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 00:58:09,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 00:58:09,973 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 00:58:09,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:58:09,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 00:58:09,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 00:58:09,974 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/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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-03-14 00:58:10,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 00:58:10,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 00:58:10,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 00:58:10,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 00:58:10,217 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 00:58:10,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-14 00:58:11,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2145d9ac/13e1c9b8cd46413b9dd51b043a5b199a/FLAG24fa26895 [2025-03-14 00:58:11,704 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 00:58:11,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-03-14 00:58:11,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2145d9ac/13e1c9b8cd46413b9dd51b043a5b199a/FLAG24fa26895 [2025-03-14 00:58:11,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2145d9ac/13e1c9b8cd46413b9dd51b043a5b199a [2025-03-14 00:58:11,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 00:58:11,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 00:58:11,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 00:58:11,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 00:58:11,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 00:58:11,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:58:11" (1/1) ... [2025-03-14 00:58:11,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4b236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:11, skipping insertion in model container [2025-03-14 00:58:11,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 12:58:11" (1/1) ... [2025-03-14 00:58:11,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 00:58:12,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-03-14 00:58:12,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:58:12,104 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 00:58:12,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2025-03-14 00:58:12,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 00:58:12,184 INFO L204 MainTranslator]: Completed translation [2025-03-14 00:58:12,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12 WrapperNode [2025-03-14 00:58:12,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 00:58:12,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 00:58:12,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 00:58:12,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 00:58:12,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,233 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-03-14 00:58:12,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 00:58:12,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 00:58:12,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 00:58:12,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 00:58:12,241 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,258 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 2, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 7 writes are split as follows [0, 0, 1, 6]. [2025-03-14 00:58:12,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,266 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 00:58:12,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 00:58:12,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 00:58:12,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 00:58:12,275 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (1/1) ... [2025-03-14 00:58:12,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 00:58:12,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:58:12,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 00:58:12,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 00:58:12,322 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-14 00:58:12,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-14 00:58:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-14 00:58:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-14 00:58:12,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 00:58:12,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 00:58:12,323 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 00:58:12,447 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 00:58:12,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 00:58:12,803 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 00:58:12,804 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-14 00:58:12,867 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 00:58:12,868 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 00:58:12,868 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 00:58:13,217 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 00:58:13,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:58:13 BoogieIcfgContainer [2025-03-14 00:58:13,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 00:58:13,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 00:58:13,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 00:58:13,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 00:58:13,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 12:58:11" (1/3) ... [2025-03-14 00:58:13,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aba5825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:58:13, skipping insertion in model container [2025-03-14 00:58:13,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 12:58:12" (2/3) ... [2025-03-14 00:58:13,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aba5825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 12:58:13, skipping insertion in model container [2025-03-14 00:58:13,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 12:58:13" (3/3) ... [2025-03-14 00:58:13,226 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-03-14 00:58:13,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 00:58:13,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 94 locations, 1 initial locations, 17 loop locations, and 3 error locations. [2025-03-14 00:58:13,239 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 00:58:13,288 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 00:58:13,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 134 transitions, 275 flow [2025-03-14 00:58:13,378 INFO L124 PetriNetUnfolderBase]: 65/218 cut-off events. [2025-03-14 00:58:13,379 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 00:58:13,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 218 events. 65/218 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1015 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 127. Up to 8 conditions per place. [2025-03-14 00:58:13,391 INFO L82 GeneralOperation]: Start removeDead. Operand has 97 places, 134 transitions, 275 flow [2025-03-14 00:58:13,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 132 transitions, 268 flow [2025-03-14 00:58:13,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:58:13,414 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;@5df59bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:58:13,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-03-14 00:58:13,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:58:13,426 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-14 00:58:13,426 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:58:13,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:13,427 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-14 00:58:13,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:58:13,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1878025250, now seen corresponding path program 1 times [2025-03-14 00:58:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151726732] [2025-03-14 00:58:13,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:13,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-14 00:58:13,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-14 00:58:13,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:13,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151726732] [2025-03-14 00:58:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151726732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:58:13,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:58:13,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:58:13,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451380750] [2025-03-14 00:58:13,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:58:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:58:13,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:58:13,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:58:13,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-14 00:58:13,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 132 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-03-14 00:58:13,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:13,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-14 00:58:13,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:14,042 INFO L124 PetriNetUnfolderBase]: 803/2154 cut-off events. [2025-03-14 00:58:14,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:58:14,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 2154 events. 803/2154 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15757 event pairs, 666 based on Foata normal form. 452/2372 useless extension candidates. Maximal degree in co-relation 3546. Up to 1503 conditions per place. [2025-03-14 00:58:14,058 INFO L140 encePairwiseOnDemand]: 98/134 looper letters, 60 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2025-03-14 00:58:14,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 100 transitions, 328 flow [2025-03-14 00:58:14,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:58:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:58:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-14 00:58:14,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5223880597014925 [2025-03-14 00:58:14,070 INFO L175 Difference]: Start difference. First operand has 96 places, 132 transitions, 268 flow. Second operand 3 states and 210 transitions. [2025-03-14 00:58:14,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 100 transitions, 328 flow [2025-03-14 00:58:14,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 100 transitions, 328 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:58:14,077 INFO L231 Difference]: Finished difference. Result has 99 places, 100 transitions, 214 flow [2025-03-14 00:58:14,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=99, PETRI_TRANSITIONS=100} [2025-03-14 00:58:14,082 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 3 predicate places. [2025-03-14 00:58:14,084 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 100 transitions, 214 flow [2025-03-14 00:58:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-03-14 00:58:14,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:14,085 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:58:14,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 00:58:14,085 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:58:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1531619178, now seen corresponding path program 1 times [2025-03-14 00:58:14,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612832145] [2025-03-14 00:58:14,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:14,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:58:14,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:58:14,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:14,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:14,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:14,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612832145] [2025-03-14 00:58:14,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612832145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:58:14,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643574398] [2025-03-14 00:58:14,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:58:14,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:58:14,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 00:58:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-14 00:58:14,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-14 00:58:14,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:14,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:14,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:58:14,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:58:14,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:14,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:58:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:14,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643574398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:58:14,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:58:14,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:58:14,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144197360] [2025-03-14 00:58:14,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:58:14,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:58:14,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:14,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:58:14,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:58:14,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-14 00:58:14,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 100 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 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-03-14 00:58:14,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:14,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-14 00:58:14,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:14,654 INFO L124 PetriNetUnfolderBase]: 803/2157 cut-off events. [2025-03-14 00:58:14,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 00:58:14,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3678 conditions, 2157 events. 803/2157 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15738 event pairs, 666 based on Foata normal form. 0/1923 useless extension candidates. Maximal degree in co-relation 3666. Up to 1503 conditions per place. [2025-03-14 00:58:14,691 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2025-03-14 00:58:14,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 103 transitions, 356 flow [2025-03-14 00:58:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:58:14,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:58:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 296 transitions. [2025-03-14 00:58:14,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3681592039800995 [2025-03-14 00:58:14,694 INFO L175 Difference]: Start difference. First operand has 99 places, 100 transitions, 214 flow. Second operand 6 states and 296 transitions. [2025-03-14 00:58:14,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 103 transitions, 356 flow [2025-03-14 00:58:14,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 352 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:58:14,698 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 246 flow [2025-03-14 00:58:14,698 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2025-03-14 00:58:14,698 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 10 predicate places. [2025-03-14 00:58:14,698 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 246 flow [2025-03-14 00:58:14,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 39.57142857142857) internal successors, (277), 7 states have internal predecessors, (277), 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-03-14 00:58:14,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:14,699 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-03-14 00:58:14,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-14 00:58:14,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:14,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:58:14,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666526, now seen corresponding path program 2 times [2025-03-14 00:58:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525219515] [2025-03-14 00:58:14,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:58:14,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:14,923 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-14 00:58:14,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:58:14,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:58:14,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:15,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525219515] [2025-03-14 00:58:15,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525219515] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:58:15,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842160833] [2025-03-14 00:58:15,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:58:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:58:15,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:58:15,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 00:58:15,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-14 00:58:15,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:58:15,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:58:15,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:15,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 00:58:15,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:58:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:15,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:58:15,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:15,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842160833] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:58:15,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:58:15,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 00:58:15,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321648674] [2025-03-14 00:58:15,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:58:15,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:58:15,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:15,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:58:15,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:58:15,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 134 [2025-03-14 00:58:15,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 246 flow. Second operand has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 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-03-14 00:58:15,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:15,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 134 [2025-03-14 00:58:15,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:15,571 INFO L124 PetriNetUnfolderBase]: 803/2163 cut-off events. [2025-03-14 00:58:15,571 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 00:58:15,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 2163 events. 803/2163 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 15714 event pairs, 666 based on Foata normal form. 6/1936 useless extension candidates. Maximal degree in co-relation 3657. Up to 1503 conditions per place. [2025-03-14 00:58:15,580 INFO L140 encePairwiseOnDemand]: 131/134 looper letters, 60 selfloop transitions, 11 changer transitions 0/109 dead transitions. [2025-03-14 00:58:15,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 109 transitions, 424 flow [2025-03-14 00:58:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:58:15,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:58:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 533 transitions. [2025-03-14 00:58:15,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3314676616915423 [2025-03-14 00:58:15,585 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 246 flow. Second operand 12 states and 533 transitions. [2025-03-14 00:58:15,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 109 transitions, 424 flow [2025-03-14 00:58:15,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 109 transitions, 410 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:58:15,587 INFO L231 Difference]: Finished difference. Result has 122 places, 109 transitions, 316 flow [2025-03-14 00:58:15,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=134, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=122, PETRI_TRANSITIONS=109} [2025-03-14 00:58:15,588 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 26 predicate places. [2025-03-14 00:58:15,588 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 109 transitions, 316 flow [2025-03-14 00:58:15,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 39.30769230769231) internal successors, (511), 13 states have internal predecessors, (511), 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-03-14 00:58:15,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:15,588 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-03-14 00:58:15,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-14 00:58:15,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-14 00:58:15,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-03-14 00:58:15,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -581177054, now seen corresponding path program 3 times [2025-03-14 00:58:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189542363] [2025-03-14 00:58:15,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:58:15,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:15,808 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-03-14 00:58:15,857 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:58:15,857 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-14 00:58:15,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:58:15,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:58:15,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-14 00:58:15,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-14 00:58:15,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:15,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:58:15,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:58:15,905 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:58:15,905 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-03-14 00:58:15,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-03-14 00:58:15,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-03-14 00:58:15,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-03-14 00:58:15,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-03-14 00:58:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 00:58:15,908 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-14 00:58:15,909 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:58:15,909 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 00:58:15,941 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 00:58:15,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 178 transitions, 372 flow [2025-03-14 00:58:15,960 INFO L124 PetriNetUnfolderBase]: 105/353 cut-off events. [2025-03-14 00:58:15,960 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 00:58:15,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 353 events. 105/353 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1899 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 220. Up to 12 conditions per place. [2025-03-14 00:58:15,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 178 transitions, 372 flow [2025-03-14 00:58:15,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 178 transitions, 372 flow [2025-03-14 00:58:15,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:58:15,964 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;@5df59bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:58:15,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-14 00:58:15,971 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:58:15,973 INFO L124 PetriNetUnfolderBase]: 14/87 cut-off events. [2025-03-14 00:58:15,974 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 00:58:15,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:15,974 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-03-14 00:58:15,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:58:15,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:15,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1419940207, now seen corresponding path program 1 times [2025-03-14 00:58:15,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:15,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680460657] [2025-03-14 00:58:15,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:15,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:15,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-14 00:58:15,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-14 00:58:15,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:15,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:16,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680460657] [2025-03-14 00:58:16,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680460657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:58:16,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:58:16,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:58:16,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885137848] [2025-03-14 00:58:16,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:58:16,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:58:16,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:16,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:58:16,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:58:16,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-14 00:58:16,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 178 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-03-14 00:58:16,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:16,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-14 00:58:16,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:19,224 INFO L124 PetriNetUnfolderBase]: 30545/58198 cut-off events. [2025-03-14 00:58:19,225 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-14 00:58:19,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102127 conditions, 58198 events. 30545/58198 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 574755 event pairs, 26406 based on Foata normal form. 13178/64898 useless extension candidates. Maximal degree in co-relation 83061. Up to 43826 conditions per place. [2025-03-14 00:58:19,467 INFO L140 encePairwiseOnDemand]: 131/178 looper letters, 83 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2025-03-14 00:58:19,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 135 transitions, 456 flow [2025-03-14 00:58:19,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 00:58:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 00:58:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-03-14 00:58:19,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5243445692883895 [2025-03-14 00:58:19,468 INFO L175 Difference]: Start difference. First operand has 129 places, 178 transitions, 372 flow. Second operand 3 states and 280 transitions. [2025-03-14 00:58:19,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 135 transitions, 456 flow [2025-03-14 00:58:19,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 135 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 00:58:19,472 INFO L231 Difference]: Finished difference. Result has 132 places, 135 transitions, 296 flow [2025-03-14 00:58:19,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=132, PETRI_TRANSITIONS=135} [2025-03-14 00:58:19,473 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 3 predicate places. [2025-03-14 00:58:19,473 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 135 transitions, 296 flow [2025-03-14 00:58:19,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-03-14 00:58:19,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:19,473 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-14 00:58:19,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 00:58:19,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:58:19,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash 413299545, now seen corresponding path program 1 times [2025-03-14 00:58:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:19,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045372633] [2025-03-14 00:58:19,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:58:19,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:58:19,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:19,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045372633] [2025-03-14 00:58:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045372633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:58:19,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104154690] [2025-03-14 00:58:19,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:58:19,526 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:58:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 00:58:19,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-14 00:58:19,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-14 00:58:19,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:19,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:19,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-14 00:58:19,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:58:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:19,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:58:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104154690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:58:19,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:58:19,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-14 00:58:19,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275832373] [2025-03-14 00:58:19,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:58:19,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 00:58:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:19,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 00:58:19,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-14 00:58:19,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-14 00:58:19,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 135 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 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-03-14 00:58:19,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:19,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-14 00:58:19,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:22,765 INFO L124 PetriNetUnfolderBase]: 30545/58201 cut-off events. [2025-03-14 00:58:22,765 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2025-03-14 00:58:22,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102143 conditions, 58201 events. 30545/58201 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 575076 event pairs, 26406 based on Foata normal form. 0/51723 useless extension candidates. Maximal degree in co-relation 102130. Up to 43826 conditions per place. [2025-03-14 00:58:23,080 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 5 changer transitions 0/138 dead transitions. [2025-03-14 00:58:23,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 138 transitions, 484 flow [2025-03-14 00:58:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 00:58:23,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 00:58:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 391 transitions. [2025-03-14 00:58:23,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3661048689138577 [2025-03-14 00:58:23,082 INFO L175 Difference]: Start difference. First operand has 132 places, 135 transitions, 296 flow. Second operand 6 states and 391 transitions. [2025-03-14 00:58:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 138 transitions, 484 flow [2025-03-14 00:58:23,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 480 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-14 00:58:23,085 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 328 flow [2025-03-14 00:58:23,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=328, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2025-03-14 00:58:23,087 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 10 predicate places. [2025-03-14 00:58:23,087 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 328 flow [2025-03-14 00:58:23,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 7 states have internal predecessors, (362), 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-03-14 00:58:23,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:23,087 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-03-14 00:58:23,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 00:58:23,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:23,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:58:23,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:23,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1182841839, now seen corresponding path program 2 times [2025-03-14 00:58:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:23,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209308185] [2025-03-14 00:58:23,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:58:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:23,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-14 00:58:23,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:58:23,314 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:58:23,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:23,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209308185] [2025-03-14 00:58:23,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209308185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 00:58:23,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875289578] [2025-03-14 00:58:23,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 00:58:23,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:23,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 00:58:23,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-14 00:58:23,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 00:58:23,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-14 00:58:23,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-14 00:58:23,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 00:58:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:23,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-14 00:58:23,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 00:58:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:23,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 00:58:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:23,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875289578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 00:58:23,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 00:58:23,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-14 00:58:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825107257] [2025-03-14 00:58:23,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 00:58:23,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-14 00:58:23,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:23,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-14 00:58:23,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-14 00:58:23,530 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 178 [2025-03-14 00:58:23,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 328 flow. Second operand has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 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-03-14 00:58:23,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:23,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 178 [2025-03-14 00:58:23,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 00:58:26,573 INFO L124 PetriNetUnfolderBase]: 30545/58207 cut-off events. [2025-03-14 00:58:26,573 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2025-03-14 00:58:26,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102180 conditions, 58207 events. 30545/58207 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 575029 event pairs, 26406 based on Foata normal form. 6/51736 useless extension candidates. Maximal degree in co-relation 102121. Up to 43826 conditions per place. [2025-03-14 00:58:26,955 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 83 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-03-14 00:58:26,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 552 flow [2025-03-14 00:58:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-14 00:58:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-14 00:58:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 700 transitions. [2025-03-14 00:58:26,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32771535580524347 [2025-03-14 00:58:26,960 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 328 flow. Second operand 12 states and 700 transitions. [2025-03-14 00:58:26,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 552 flow [2025-03-14 00:58:26,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 144 transitions, 538 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-14 00:58:26,966 INFO L231 Difference]: Finished difference. Result has 155 places, 144 transitions, 398 flow [2025-03-14 00:58:26,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=398, PETRI_PLACES=155, PETRI_TRANSITIONS=144} [2025-03-14 00:58:26,970 INFO L279 CegarLoopForPetriNet]: 129 programPoint places, 26 predicate places. [2025-03-14 00:58:26,970 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 144 transitions, 398 flow [2025-03-14 00:58:26,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.38461538461539) internal successors, (668), 13 states have internal predecessors, (668), 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-03-14 00:58:26,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:26,970 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-03-14 00:58:26,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 00:58:27,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 00:58:27,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-03-14 00:58:27,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:27,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1815043153, now seen corresponding path program 3 times [2025-03-14 00:58:27,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:27,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583371771] [2025-03-14 00:58:27,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 00:58:27,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:27,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-03-14 00:58:27,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:58:27,214 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-14 00:58:27,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:58:27,214 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 00:58:27,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-14 00:58:27,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-14 00:58:27,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:27,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 00:58:27,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 00:58:27,242 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 00:58:27,242 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-14 00:58:27,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-03-14 00:58:27,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-03-14 00:58:27,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-03-14 00:58:27,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-03-14 00:58:27,243 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-03-14 00:58:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 00:58:27,243 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-03-14 00:58:27,243 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 00:58:27,244 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 00:58:27,278 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 00:58:27,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 222 transitions, 471 flow [2025-03-14 00:58:27,316 INFO L124 PetriNetUnfolderBase]: 148/499 cut-off events. [2025-03-14 00:58:27,316 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 00:58:27,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 499 events. 148/499 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2817 event pairs, 1 based on Foata normal form. 0/336 useless extension candidates. Maximal degree in co-relation 362. Up to 16 conditions per place. [2025-03-14 00:58:27,319 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 222 transitions, 471 flow [2025-03-14 00:58:27,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 222 transitions, 471 flow [2025-03-14 00:58:27,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 00:58:27,324 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;@5df59bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 00:58:27,324 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-14 00:58:27,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 00:58:27,331 INFO L124 PetriNetUnfolderBase]: 23/122 cut-off events. [2025-03-14 00:58:27,331 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 00:58:27,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 00:58:27,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 00:58:27,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-14 00:58:27,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 00:58:27,331 INFO L85 PathProgramCache]: Analyzing trace with hash -285465829, now seen corresponding path program 1 times [2025-03-14 00:58:27,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 00:58:27,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889700148] [2025-03-14 00:58:27,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 00:58:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 00:58:27,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-14 00:58:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-14 00:58:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 00:58:27,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 00:58:27,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 00:58:27,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 00:58:27,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889700148] [2025-03-14 00:58:27,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889700148] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 00:58:27,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 00:58:27,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 00:58:27,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878860297] [2025-03-14 00:58:27,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 00:58:27,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 00:58:27,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 00:58:27,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 00:58:27,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 00:58:27,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 222 [2025-03-14 00:58:27,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 222 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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-03-14 00:58:27,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 00:58:27,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 222 [2025-03-14 00:58:27,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand