./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:30:23,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:30:23,643 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:30:23,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:30:23,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:30:23,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:30:23,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:30:23,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:30:23,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:30:23,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:30:23,670 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:30:23,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:30:23,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:23,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:30:23,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:30:23,673 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-02-06 04:30:23,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:30:23,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:30:23,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:30:23,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:30:23,923 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:30:23,923 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-02-06 04:30:25,064 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cbc4fde/62da34a744294136b3b5c3e11675b54e/FLAGa270aeefc [2025-02-06 04:30:25,411 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:30:25,411 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-02-06 04:30:25,424 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cbc4fde/62da34a744294136b3b5c3e11675b54e/FLAGa270aeefc [2025-02-06 04:30:25,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a1cbc4fde/62da34a744294136b3b5c3e11675b54e [2025-02-06 04:30:25,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:30:25,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:30:25,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:25,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:30:25,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:30:25,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7973a023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:25, skipping insertion in model container [2025-02-06 04:30:25,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:25" (1/1) ... [2025-02-06 04:30:25,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:30:26,031 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-02-06 04:30:26,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:26,086 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:30:26,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2025-02-06 04:30:26,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:26,174 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:30:26,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26 WrapperNode [2025-02-06 04:30:26,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:26,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:26,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:30:26,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:30:26,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,219 INFO L138 Inliner]: procedures = 272, calls = 107, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 308 [2025-02-06 04:30:26,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:26,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:30:26,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:30:26,219 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:30:26,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,233 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,250 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 75, 2]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 60, 0]. The 7 writes are split as follows [0, 0, 6, 1]. [2025-02-06 04:30:26,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,260 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:30:26,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:30:26,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:30:26,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:30:26,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:26,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:30:26,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:30:26,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 04:30:26,323 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:30:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:30:26,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:30:26,325 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:30:26,442 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:30:26,443 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:30:26,765 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 04:30:26,766 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L954-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 04:30:26,818 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:30:26,818 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:30:27,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:30:27,126 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:30:27,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:27 BoogieIcfgContainer [2025-02-06 04:30:27,127 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:30:27,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:30:27,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:30:27,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:30:27,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:30:25" (1/3) ... [2025-02-06 04:30:27,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdc6c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:27, skipping insertion in model container [2025-02-06 04:30:27,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26" (2/3) ... [2025-02-06 04:30:27,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fdc6c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:27, skipping insertion in model container [2025-02-06 04:30:27,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:27" (3/3) ... [2025-02-06 04:30:27,134 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-02-06 04:30:27,144 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:30:27,146 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 103 locations, 1 initial locations, 20 loop locations, and 3 error locations. [2025-02-06 04:30:27,146 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:30:27,193 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:30:27,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 143 transitions, 293 flow [2025-02-06 04:30:27,274 INFO L124 PetriNetUnfolderBase]: 65/232 cut-off events. [2025-02-06 04:30:27,276 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:30:27,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 232 events. 65/232 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1124 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 136. Up to 8 conditions per place. [2025-02-06 04:30:27,280 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 143 transitions, 293 flow [2025-02-06 04:30:27,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 141 transitions, 286 flow [2025-02-06 04:30:27,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:27,302 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;@1caaefbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:27,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:30:27,314 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:27,317 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2025-02-06 04:30:27,317 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:27,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:27,318 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 04:30:27,318 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-02-06 04:30:27,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -986931111, now seen corresponding path program 1 times [2025-02-06 04:30:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93471746] [2025-02-06 04:30:27,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:27,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:27,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:30:27,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:30:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:27,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:27,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:27,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93471746] [2025-02-06 04:30:27,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93471746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:27,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:27,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569672991] [2025-02-06 04:30:27,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:27,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:27,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:27,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:27,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:27,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 143 [2025-02-06 04:30:27,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 141 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-02-06 04:30:27,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 143 [2025-02-06 04:30:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:27,961 INFO L124 PetriNetUnfolderBase]: 752/2221 cut-off events. [2025-02-06 04:30:27,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3623 conditions, 2221 events. 752/2221 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17065 event pairs, 612 based on Foata normal form. 738/2714 useless extension candidates. Maximal degree in co-relation 3505. Up to 1397 conditions per place. [2025-02-06 04:30:27,979 INFO L140 encePairwiseOnDemand]: 107/143 looper letters, 57 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-02-06 04:30:27,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 109 transitions, 340 flow [2025-02-06 04:30:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2025-02-06 04:30:27,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664335664335665 [2025-02-06 04:30:27,992 INFO L175 Difference]: Start difference. First operand has 105 places, 141 transitions, 286 flow. Second operand 3 states and 243 transitions. [2025-02-06 04:30:27,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 109 transitions, 340 flow [2025-02-06 04:30:27,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 109 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:28,000 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 232 flow [2025-02-06 04:30:28,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2025-02-06 04:30:28,006 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 3 predicate places. [2025-02-06 04:30:28,007 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 232 flow [2025-02-06 04:30:28,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-02-06 04:30:28,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:28,007 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:28,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:30:28,008 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-02-06 04:30:28,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:28,008 INFO L85 PathProgramCache]: Analyzing trace with hash 354171074, now seen corresponding path program 1 times [2025-02-06 04:30:28,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:28,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-02-06 04:30:28,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:28,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:28,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:28,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:28,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:28,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3373851] [2025-02-06 04:30:28,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3373851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:28,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12056286] [2025-02-06 04:30:28,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:28,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:28,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:28,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 04:30:28,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:28,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12056286] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:28,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:28,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344675631] [2025-02-06 04:30:28,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:28,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:28,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:28,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:28,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 143 [2025-02-06 04:30:28,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 232 flow. Second operand has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 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-02-06 04:30:28,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:28,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 143 [2025-02-06 04:30:28,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:28,596 INFO L124 PetriNetUnfolderBase]: 752/2224 cut-off events. [2025-02-06 04:30:28,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:28,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3639 conditions, 2224 events. 752/2224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17095 event pairs, 612 based on Foata normal form. 0/1979 useless extension candidates. Maximal degree in co-relation 3627. Up to 1397 conditions per place. [2025-02-06 04:30:28,607 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 57 selfloop transitions, 5 changer transitions 0/112 dead transitions. [2025-02-06 04:30:28,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 112 transitions, 368 flow [2025-02-06 04:30:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 365 transitions. [2025-02-06 04:30:28,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4254079254079254 [2025-02-06 04:30:28,609 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 232 flow. Second operand 6 states and 365 transitions. [2025-02-06 04:30:28,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 112 transitions, 368 flow [2025-02-06 04:30:28,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 112 transitions, 364 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:28,612 INFO L231 Difference]: Finished difference. Result has 115 places, 112 transitions, 264 flow [2025-02-06 04:30:28,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=264, PETRI_PLACES=115, PETRI_TRANSITIONS=112} [2025-02-06 04:30:28,612 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 10 predicate places. [2025-02-06 04:30:28,613 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 112 transitions, 264 flow [2025-02-06 04:30:28,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.57142857142857) internal successors, (361), 7 states have internal predecessors, (361), 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-02-06 04:30:28,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:28,613 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:28,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:30:28,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,814 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-02-06 04:30:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 277082777, now seen corresponding path program 2 times [2025-02-06 04:30:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439074397] [2025-02-06 04:30:28,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:28,830 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:28,852 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:28,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:28,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:28,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:28,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439074397] [2025-02-06 04:30:28,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439074397] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:28,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944603482] [2025-02-06 04:30:28,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:28,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:28,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:28,986 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:28,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 04:30:29,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:29,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:29,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:29,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:29,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:29,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944603482] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233834776] [2025-02-06 04:30:29,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:29,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:29,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 143 [2025-02-06 04:30:29,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 112 transitions, 264 flow. Second operand has 13 states, 13 states have (on average 51.30769230769231) internal successors, (667), 13 states have internal predecessors, (667), 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-02-06 04:30:29,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:29,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 143 [2025-02-06 04:30:29,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:29,524 INFO L124 PetriNetUnfolderBase]: 752/2230 cut-off events. [2025-02-06 04:30:29,524 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:30:29,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3676 conditions, 2230 events. 752/2230 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17117 event pairs, 612 based on Foata normal form. 6/1992 useless extension candidates. Maximal degree in co-relation 3618. Up to 1397 conditions per place. [2025-02-06 04:30:29,537 INFO L140 encePairwiseOnDemand]: 140/143 looper letters, 57 selfloop transitions, 11 changer transitions 0/118 dead transitions. [2025-02-06 04:30:29,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 436 flow [2025-02-06 04:30:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 674 transitions. [2025-02-06 04:30:29,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3927738927738928 [2025-02-06 04:30:29,540 INFO L175 Difference]: Start difference. First operand has 115 places, 112 transitions, 264 flow. Second operand 12 states and 674 transitions. [2025-02-06 04:30:29,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 436 flow [2025-02-06 04:30:29,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 118 transitions, 422 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:29,543 INFO L231 Difference]: Finished difference. Result has 131 places, 118 transitions, 334 flow [2025-02-06 04:30:29,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=334, PETRI_PLACES=131, PETRI_TRANSITIONS=118} [2025-02-06 04:30:29,544 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, 26 predicate places. [2025-02-06 04:30:29,544 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 118 transitions, 334 flow [2025-02-06 04:30:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 51.30769230769231) internal successors, (667), 13 states have internal predecessors, (667), 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-02-06 04:30:29,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:29,545 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:29,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:30:29,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:29,746 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-02-06 04:30:29,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1131671047, now seen corresponding path program 3 times [2025-02-06 04:30:29,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243484104] [2025-02-06 04:30:29,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-02-06 04:30:29,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:30:29,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:29,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:29,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:29,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:30:29,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:30:29,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:29,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:29,835 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:29,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:30:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:30:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:30:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:30:29,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:30:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:30:29,838 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:29,840 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:29,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:30:29,872 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:30:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 191 transitions, 398 flow [2025-02-06 04:30:29,907 INFO L124 PetriNetUnfolderBase]: 105/376 cut-off events. [2025-02-06 04:30:29,908 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:30:29,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 376 events. 105/376 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2115 event pairs, 0 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 234. Up to 12 conditions per place. [2025-02-06 04:30:29,910 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 191 transitions, 398 flow [2025-02-06 04:30:29,913 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 191 transitions, 398 flow [2025-02-06 04:30:29,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:29,914 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;@1caaefbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:29,914 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:30:29,918 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:29,919 INFO L124 PetriNetUnfolderBase]: 11/71 cut-off events. [2025-02-06 04:30:29,919 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:30:29,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:29,919 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:29,919 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-02-06 04:30:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash 287391155, now seen corresponding path program 1 times [2025-02-06 04:30:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016240894] [2025-02-06 04:30:29,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:29,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:30:29,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:30:29,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:29,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:29,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016240894] [2025-02-06 04:30:29,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016240894] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:29,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:29,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:29,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255226355] [2025-02-06 04:30:29,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:29,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:29,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:29,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:29,956 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 191 [2025-02-06 04:30:29,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 191 transitions, 398 flow. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-02-06 04:30:29,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:29,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 191 [2025-02-06 04:30:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:33,532 INFO L124 PetriNetUnfolderBase]: 28517/58085 cut-off events. [2025-02-06 04:30:33,532 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-02-06 04:30:33,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98943 conditions, 58085 events. 28517/58085 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 616476 event pairs, 24301 based on Foata normal form. 21053/72272 useless extension candidates. Maximal degree in co-relation 80414. Up to 40755 conditions per place. [2025-02-06 04:30:33,862 INFO L140 encePairwiseOnDemand]: 144/191 looper letters, 80 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-02-06 04:30:33,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 148 transitions, 476 flow [2025-02-06 04:30:33,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:33,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:33,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2025-02-06 04:30:33,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5671902268760908 [2025-02-06 04:30:33,864 INFO L175 Difference]: Start difference. First operand has 142 places, 191 transitions, 398 flow. Second operand 3 states and 325 transitions. [2025-02-06 04:30:33,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 148 transitions, 476 flow [2025-02-06 04:30:33,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 148 transitions, 476 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:33,870 INFO L231 Difference]: Finished difference. Result has 145 places, 148 transitions, 322 flow [2025-02-06 04:30:33,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=145, PETRI_TRANSITIONS=148} [2025-02-06 04:30:33,872 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 3 predicate places. [2025-02-06 04:30:33,872 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 148 transitions, 322 flow [2025-02-06 04:30:33,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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-02-06 04:30:33,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:33,872 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:33,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:30:33,873 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-02-06 04:30:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1656471209, now seen corresponding path program 1 times [2025-02-06 04:30:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133158980] [2025-02-06 04:30:33,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:33,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:33,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:33,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:33,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:33,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:33,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133158980] [2025-02-06 04:30:33,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133158980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:33,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403157629] [2025-02-06 04:30:33,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:33,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:33,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:33,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:33,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 04:30:34,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:34,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:34,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:34,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:34,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:34,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:34,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:34,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403157629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:34,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315289219] [2025-02-06 04:30:34,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:34,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:34,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:34,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:34,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:34,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 191 [2025-02-06 04:30:34,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 148 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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-02-06 04:30:34,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:34,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 191 [2025-02-06 04:30:34,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:37,108 INFO L124 PetriNetUnfolderBase]: 28517/58088 cut-off events. [2025-02-06 04:30:37,108 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2025-02-06 04:30:37,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98959 conditions, 58088 events. 28517/58088 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 1804. Compared 616534 event pairs, 24301 based on Foata normal form. 0/51222 useless extension candidates. Maximal degree in co-relation 98946. Up to 40755 conditions per place. [2025-02-06 04:30:37,477 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 80 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-02-06 04:30:37,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 151 transitions, 504 flow [2025-02-06 04:30:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2025-02-06 04:30:37,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4223385689354276 [2025-02-06 04:30:37,482 INFO L175 Difference]: Start difference. First operand has 145 places, 148 transitions, 322 flow. Second operand 6 states and 484 transitions. [2025-02-06 04:30:37,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 151 transitions, 504 flow [2025-02-06 04:30:37,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 151 transitions, 500 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:37,485 INFO L231 Difference]: Finished difference. Result has 152 places, 151 transitions, 354 flow [2025-02-06 04:30:37,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=354, PETRI_PLACES=152, PETRI_TRANSITIONS=151} [2025-02-06 04:30:37,486 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 10 predicate places. [2025-02-06 04:30:37,486 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 151 transitions, 354 flow [2025-02-06 04:30:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 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-02-06 04:30:37,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:37,486 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:37,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 04:30:37,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:37,688 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-02-06 04:30:37,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:37,688 INFO L85 PathProgramCache]: Analyzing trace with hash -466302157, now seen corresponding path program 2 times [2025-02-06 04:30:37,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:37,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639833819] [2025-02-06 04:30:37,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:37,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:37,699 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:37,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:30:37,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:37,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:37,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639833819] [2025-02-06 04:30:37,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639833819] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:37,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897087992] [2025-02-06 04:30:37,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:37,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:37,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:37,798 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 04:30:37,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 04:30:37,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:37,888 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 04:30:37,888 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:37,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:37,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:37,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:37,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897087992] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:37,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349231256] [2025-02-06 04:30:37,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:37,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:37,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:37,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:37,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 191 [2025-02-06 04:30:37,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 151 transitions, 354 flow. Second operand has 13 states, 13 states have (on average 67.38461538461539) internal successors, (876), 13 states have internal predecessors, (876), 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-02-06 04:30:37,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:37,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 191 [2025-02-06 04:30:37,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:41,487 INFO L124 PetriNetUnfolderBase]: 28517/58094 cut-off events. [2025-02-06 04:30:41,488 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2025-02-06 04:30:41,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98996 conditions, 58094 events. 28517/58094 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 1804. Compared 616493 event pairs, 24301 based on Foata normal form. 6/51235 useless extension candidates. Maximal degree in co-relation 98937. Up to 40755 conditions per place. [2025-02-06 04:30:41,812 INFO L140 encePairwiseOnDemand]: 188/191 looper letters, 80 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2025-02-06 04:30:41,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 157 transitions, 572 flow [2025-02-06 04:30:41,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 889 transitions. [2025-02-06 04:30:41,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3878708551483421 [2025-02-06 04:30:41,815 INFO L175 Difference]: Start difference. First operand has 152 places, 151 transitions, 354 flow. Second operand 12 states and 889 transitions. [2025-02-06 04:30:41,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 157 transitions, 572 flow [2025-02-06 04:30:41,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 157 transitions, 558 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:41,818 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 424 flow [2025-02-06 04:30:41,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=424, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-02-06 04:30:41,819 INFO L279 CegarLoopForPetriNet]: 142 programPoint places, 26 predicate places. [2025-02-06 04:30:41,819 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 424 flow [2025-02-06 04:30:41,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 67.38461538461539) internal successors, (876), 13 states have internal predecessors, (876), 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-02-06 04:30:41,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:41,819 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:41,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 04:30:42,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-06 04:30:42,020 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-02-06 04:30:42,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -613746829, now seen corresponding path program 3 times [2025-02-06 04:30:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267047492] [2025-02-06 04:30:42,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:42,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:42,032 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-02-06 04:30:42,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:30:42,062 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:42,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:42,062 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:42,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:30:42,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:30:42,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:42,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:42,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:42,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:30:42,081 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:30:42,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:30:42,083 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:42,084 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:42,084 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:30:42,111 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:30:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 239 transitions, 505 flow [2025-02-06 04:30:42,143 INFO L124 PetriNetUnfolderBase]: 148/531 cut-off events. [2025-02-06 04:30:42,144 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:30:42,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 531 events. 148/531 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3185 event pairs, 1 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 385. Up to 16 conditions per place. [2025-02-06 04:30:42,149 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 239 transitions, 505 flow [2025-02-06 04:30:42,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 239 transitions, 505 flow [2025-02-06 04:30:42,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:42,154 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;@1caaefbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:42,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 04:30:42,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:42,158 INFO L124 PetriNetUnfolderBase]: 20/118 cut-off events. [2025-02-06 04:30:42,158 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 04:30:42,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:42,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:42,159 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-02-06 04:30:42,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:42,159 INFO L85 PathProgramCache]: Analyzing trace with hash 238128026, now seen corresponding path program 1 times [2025-02-06 04:30:42,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:42,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613165486] [2025-02-06 04:30:42,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:42,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:42,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:42,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:42,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:42,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:42,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:42,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613165486] [2025-02-06 04:30:42,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613165486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:42,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:42,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576982021] [2025-02-06 04:30:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:42,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:42,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:42,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:42,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 239 [2025-02-06 04:30:42,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 239 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-02-06 04:30:42,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:42,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 239 [2025-02-06 04:30:42,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand