./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_72-funloop_hard_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 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:30:24,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:30:24,339 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:24,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:30:24,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:30:24,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:30:24,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:30:24,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:30:24,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:30:24,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:30:24,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:30:24,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:30:24,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:30:24,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:30:24,367 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:30:24,367 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:30:24,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:30:24,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:30:24,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:30:24,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:30:24,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:24,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:30:24,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:30:24,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:30:24,372 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 -> 566e2cbe460cf96671c9cef5a53ce51910e23c462e96f394be80b957976729c5 [2025-02-06 04:30:24,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:30:24,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:30:24,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:30:24,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:30:24,600 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:30:24,600 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_72-funloop_hard_racing.i [2025-02-06 04:30:26,430 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c81620fc6/80b173f4ad7d49dcaafc74643d4f9b11/FLAG49e23030a [2025-02-06 04:30:26,785 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:30:26,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2025-02-06 04:30:26,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c81620fc6/80b173f4ad7d49dcaafc74643d4f9b11/FLAG49e23030a [2025-02-06 04:30:26,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c81620fc6/80b173f4ad7d49dcaafc74643d4f9b11 [2025-02-06 04:30:26,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:30:26,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:30:26,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:26,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:30:26,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:30:26,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57aca075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:26, skipping insertion in model container [2025-02-06 04:30:26,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:30:26" (1/1) ... [2025-02-06 04:30:26,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:30:27,140 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_72-funloop_hard_racing.i[41323,41336] [2025-02-06 04:30:27,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:27,191 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:30:27,224 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_72-funloop_hard_racing.i[41323,41336] [2025-02-06 04:30:27,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:30:27,269 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:30:27,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:27 WrapperNode [2025-02-06 04:30:27,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:30:27,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:27,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:30:27,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:30:27,276 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:27" (1/1) ... [2025-02-06 04:30:27,286 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:27" (1/1) ... [2025-02-06 04:30:27,306 INFO L138 Inliner]: procedures = 272, calls = 109, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 314 [2025-02-06 04:30:27,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:30:27,307 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:30:27,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:30:27,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:30:27,313 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:27" (1/1) ... [2025-02-06 04:30:27,313 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:27" (1/1) ... [2025-02-06 04:30:27,316 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:27" (1/1) ... [2025-02-06 04:30:27,327 INFO L175 MemorySlicer]: Split 84 memory accesses to 4 slices as follows [2, 5, 2, 75]. 89 percent of accesses are in the largest equivalence class. The 67 initializations are split as follows [2, 5, 0, 60]. The 7 writes are split as follows [0, 0, 1, 6]. [2025-02-06 04:30:27,327 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:27" (1/1) ... [2025-02-06 04:30:27,327 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:27" (1/1) ... [2025-02-06 04:30:27,334 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:27" (1/1) ... [2025-02-06 04:30:27,335 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:27" (1/1) ... [2025-02-06 04:30:27,336 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:27" (1/1) ... [2025-02-06 04:30:27,337 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:27" (1/1) ... [2025-02-06 04:30:27,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:30:27,339 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:30:27,339 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:30:27,339 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:30:27,340 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:27" (1/1) ... [2025-02-06 04:30:27,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:30:27,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:27,369 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:27,372 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:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:30:27,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 04:30:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:30:27,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:30:27,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:30:27,389 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:27,486 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:30:27,487 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:30:27,827 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-06 04:30:27,828 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L953-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-06 04:30:27,890 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:30:27,890 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:30:28,195 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:30:28,196 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:30:28,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:28 BoogieIcfgContainer [2025-02-06 04:30:28,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:30:28,198 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:30:28,198 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:30:28,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:30:28,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:30:26" (1/3) ... [2025-02-06 04:30:28,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad3d4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:28, skipping insertion in model container [2025-02-06 04:30:28,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:30:27" (2/3) ... [2025-02-06 04:30:28,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad3d4bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:30:28, skipping insertion in model container [2025-02-06 04:30:28,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:30:28" (3/3) ... [2025-02-06 04:30:28,202 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2025-02-06 04:30:28,212 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:30:28,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_72-funloop_hard_racing.i that has 2 procedures, 106 locations, 1 initial locations, 20 loop locations, and 3 error locations. [2025-02-06 04:30:28,214 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:30:28,261 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-06 04:30:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 146 transitions, 299 flow [2025-02-06 04:30:28,332 INFO L124 PetriNetUnfolderBase]: 65/238 cut-off events. [2025-02-06 04:30:28,334 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 04:30:28,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 238 events. 65/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1159 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 139. Up to 8 conditions per place. [2025-02-06 04:30:28,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 146 transitions, 299 flow [2025-02-06 04:30:28,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 108 places, 144 transitions, 292 flow [2025-02-06 04:30:28,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:28,357 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;@2877b36c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:28,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:30:28,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:28,364 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2025-02-06 04:30:28,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:28,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:28,365 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-06 04:30:28,365 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:28,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:28,369 INFO L85 PathProgramCache]: Analyzing trace with hash -908734103, now seen corresponding path program 1 times [2025-02-06 04:30:28,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:28,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893974136] [2025-02-06 04:30:28,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:28,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:28,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 04:30:28,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 04:30:28,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:28,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:28,648 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:28,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:28,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893974136] [2025-02-06 04:30:28,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893974136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:28,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:28,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717290058] [2025-02-06 04:30:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:28,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:28,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:28,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:28,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 146 [2025-02-06 04:30:28,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 144 transitions, 292 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:28,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:28,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 146 [2025-02-06 04:30:28,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:29,018 INFO L124 PetriNetUnfolderBase]: 803/2335 cut-off events. [2025-02-06 04:30:29,020 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:29,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3845 conditions, 2335 events. 803/2335 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17923 event pairs, 666 based on Foata normal form. 767/2859 useless extension candidates. Maximal degree in co-relation 3722. Up to 1505 conditions per place. [2025-02-06 04:30:29,046 INFO L140 encePairwiseOnDemand]: 110/146 looper letters, 60 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-02-06 04:30:29,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 112 transitions, 352 flow [2025-02-06 04:30:29,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:29,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-02-06 04:30:29,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5616438356164384 [2025-02-06 04:30:29,064 INFO L175 Difference]: Start difference. First operand has 108 places, 144 transitions, 292 flow. Second operand 3 states and 246 transitions. [2025-02-06 04:30:29,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 112 transitions, 352 flow [2025-02-06 04:30:29,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 352 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:29,071 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 238 flow [2025-02-06 04:30:29,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2025-02-06 04:30:29,077 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 3 predicate places. [2025-02-06 04:30:29,077 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 238 flow [2025-02-06 04:30:29,078 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:29,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:29,078 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:30:29,079 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:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 979467467, now seen corresponding path program 1 times [2025-02-06 04:30:29,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:29,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571104500] [2025-02-06 04:30:29,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:29,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:29,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:29,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:30:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571104500] [2025-02-06 04:30:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571104500] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:29,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138882023] [2025-02-06 04:30:29,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:29,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:29,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:29,219 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:29,221 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:29,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 04:30:29,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 04:30:29,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:29,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:29,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:29,320 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:29,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:29,333 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:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138882023] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:29,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272832669] [2025-02-06 04:30:29,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:29,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:29,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:29,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 146 [2025-02-06 04:30:29,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 112 transitions, 238 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:29,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:29,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 146 [2025-02-06 04:30:29,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:29,649 INFO L124 PetriNetUnfolderBase]: 803/2338 cut-off events. [2025-02-06 04:30:29,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:30:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3861 conditions, 2338 events. 803/2338 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17926 event pairs, 666 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 3849. Up to 1505 conditions per place. [2025-02-06 04:30:29,661 INFO L140 encePairwiseOnDemand]: 143/146 looper letters, 60 selfloop transitions, 5 changer transitions 0/115 dead transitions. [2025-02-06 04:30:29,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 115 transitions, 380 flow [2025-02-06 04:30:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:29,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:29,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 368 transitions. [2025-02-06 04:30:29,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4200913242009132 [2025-02-06 04:30:29,663 INFO L175 Difference]: Start difference. First operand has 111 places, 112 transitions, 238 flow. Second operand 6 states and 368 transitions. [2025-02-06 04:30:29,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 115 transitions, 380 flow [2025-02-06 04:30:29,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 115 transitions, 376 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:29,666 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 270 flow [2025-02-06 04:30:29,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2025-02-06 04:30:29,667 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 10 predicate places. [2025-02-06 04:30:29,667 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 270 flow [2025-02-06 04:30:29,667 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:29,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:29,667 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:30:29,868 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:29,869 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:29,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:29,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1695980009, now seen corresponding path program 2 times [2025-02-06 04:30:29,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:29,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156894965] [2025-02-06 04:30:29,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:29,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:29,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:29,908 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,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:29,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:30,084 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:30,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156894965] [2025-02-06 04:30:30,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156894965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577065963] [2025-02-06 04:30:30,085 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:30,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:30,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:30,090 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:30,096 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:30,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-06 04:30:30,190 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:30,190 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:30,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:30,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:30,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:30,208 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:30,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:30,265 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:30,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577065963] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:30,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:30,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:30,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177443205] [2025-02-06 04:30:30,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:30,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:30,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:30,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:30,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:30,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 146 [2025-02-06 04:30:30,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 270 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:30,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:30,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 146 [2025-02-06 04:30:30,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:30,638 INFO L124 PetriNetUnfolderBase]: 803/2344 cut-off events. [2025-02-06 04:30:30,638 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-06 04:30:30,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3898 conditions, 2344 events. 803/2344 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 17934 event pairs, 666 based on Foata normal form. 6/2108 useless extension candidates. Maximal degree in co-relation 3840. Up to 1505 conditions per place. [2025-02-06 04:30:30,648 INFO L140 encePairwiseOnDemand]: 143/146 looper letters, 60 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2025-02-06 04:30:30,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 121 transitions, 448 flow [2025-02-06 04:30:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 677 transitions. [2025-02-06 04:30:30,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3864155251141553 [2025-02-06 04:30:30,653 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 270 flow. Second operand 12 states and 677 transitions. [2025-02-06 04:30:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 121 transitions, 448 flow [2025-02-06 04:30:30,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 121 transitions, 434 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:30,657 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 340 flow [2025-02-06 04:30:30,657 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=146, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=340, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2025-02-06 04:30:30,658 INFO L279 CegarLoopForPetriNet]: 108 programPoint places, 26 predicate places. [2025-02-06 04:30:30,658 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 340 flow [2025-02-06 04:30:30,659 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:30,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:30,659 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:30,666 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:30,859 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:30,860 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:30,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:30,861 INFO L85 PathProgramCache]: Analyzing trace with hash 639913641, now seen corresponding path program 3 times [2025-02-06 04:30:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097456684] [2025-02-06 04:30:30,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:30,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 6 equivalence classes. [2025-02-06 04:30:30,923 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:30,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:30,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:30,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 04:30:30,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 04:30:30,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:30,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:30,970 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:30,970 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:30,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:30:30,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:30:30,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:30:30,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:30:30,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:30:30,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:30:30,976 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:30,982 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:30,982 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:30:31,043 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 04:30:31,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 194 transitions, 404 flow [2025-02-06 04:30:31,094 INFO L124 PetriNetUnfolderBase]: 105/385 cut-off events. [2025-02-06 04:30:31,095 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 04:30:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 385 events. 105/385 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2169 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 240. Up to 12 conditions per place. [2025-02-06 04:30:31,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 194 transitions, 404 flow [2025-02-06 04:30:31,109 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 194 transitions, 404 flow [2025-02-06 04:30:31,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:31,110 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;@2877b36c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:31,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:30:31,119 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:31,119 INFO L124 PetriNetUnfolderBase]: 10/65 cut-off events. [2025-02-06 04:30:31,119 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:30:31,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:31,119 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:31,119 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:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -344915249, now seen corresponding path program 1 times [2025-02-06 04:30:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165200685] [2025-02-06 04:30:31,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:31,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:30:31,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:30:31,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:31,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:31,193 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:31,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:31,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165200685] [2025-02-06 04:30:31,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165200685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:31,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:31,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:31,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956528405] [2025-02-06 04:30:31,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:31,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:31,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:31,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:31,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:31,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 194 [2025-02-06 04:30:31,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 194 transitions, 404 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:31,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:31,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 194 [2025-02-06 04:30:31,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:34,907 INFO L124 PetriNetUnfolderBase]: 30545/61738 cut-off events. [2025-02-06 04:30:34,907 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-02-06 04:30:35,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105709 conditions, 61738 events. 30545/61738 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 651274 event pairs, 26406 based on Foata normal form. 22075/76792 useless extension candidates. Maximal degree in co-relation 85940. Up to 43868 conditions per place. [2025-02-06 04:30:35,366 INFO L140 encePairwiseOnDemand]: 147/194 looper letters, 83 selfloop transitions, 2 changer transitions 0/151 dead transitions. [2025-02-06 04:30:35,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 151 transitions, 488 flow [2025-02-06 04:30:35,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:30:35,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 04:30:35,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2025-02-06 04:30:35,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.563573883161512 [2025-02-06 04:30:35,368 INFO L175 Difference]: Start difference. First operand has 145 places, 194 transitions, 404 flow. Second operand 3 states and 328 transitions. [2025-02-06 04:30:35,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 151 transitions, 488 flow [2025-02-06 04:30:35,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 151 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 04:30:35,374 INFO L231 Difference]: Finished difference. Result has 148 places, 151 transitions, 328 flow [2025-02-06 04:30:35,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=148, PETRI_TRANSITIONS=151} [2025-02-06 04:30:35,377 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 3 predicate places. [2025-02-06 04:30:35,377 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 151 transitions, 328 flow [2025-02-06 04:30:35,377 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:35,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:35,377 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:35,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:30:35,378 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:35,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:35,378 INFO L85 PathProgramCache]: Analyzing trace with hash -834831761, now seen corresponding path program 1 times [2025-02-06 04:30:35,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:35,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168724175] [2025-02-06 04:30:35,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:35,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:35,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:35,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:35,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:35,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:35,443 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:35,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168724175] [2025-02-06 04:30:35,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168724175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:35,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214079813] [2025-02-06 04:30:35,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:35,450 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:35,451 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:35,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 04:30:35,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 04:30:35,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:35,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:35,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 04:30:35,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:35,538 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:35,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:35,552 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:35,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214079813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:35,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:35,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 04:30:35,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245510411] [2025-02-06 04:30:35,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:35,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 04:30:35,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:35,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 04:30:35,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 04:30:35,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 194 [2025-02-06 04:30:35,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 151 transitions, 328 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:35,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:35,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 194 [2025-02-06 04:30:35,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:38,583 INFO L124 PetriNetUnfolderBase]: 30545/61741 cut-off events. [2025-02-06 04:30:38,584 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-02-06 04:30:38,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105725 conditions, 61741 events. 30545/61741 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 651020 event pairs, 26406 based on Foata normal form. 0/54720 useless extension candidates. Maximal degree in co-relation 105712. Up to 43868 conditions per place. [2025-02-06 04:30:38,816 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 83 selfloop transitions, 5 changer transitions 0/154 dead transitions. [2025-02-06 04:30:38,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 154 transitions, 516 flow [2025-02-06 04:30:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:30:38,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 04:30:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-02-06 04:30:38,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4183848797250859 [2025-02-06 04:30:38,820 INFO L175 Difference]: Start difference. First operand has 148 places, 151 transitions, 328 flow. Second operand 6 states and 487 transitions. [2025-02-06 04:30:38,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 154 transitions, 516 flow [2025-02-06 04:30:38,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 154 transitions, 512 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:38,825 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 360 flow [2025-02-06 04:30:38,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-02-06 04:30:38,825 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 10 predicate places. [2025-02-06 04:30:38,825 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 360 flow [2025-02-06 04:30:38,826 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:38,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:38,826 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:38,833 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:39,026 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:39,027 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:39,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:39,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1990322895, now seen corresponding path program 2 times [2025-02-06 04:30:39,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:39,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586269604] [2025-02-06 04:30:39,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:39,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:39,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:39,047 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:39,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:39,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:39,128 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:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:39,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586269604] [2025-02-06 04:30:39,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586269604] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:30:39,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586542361] [2025-02-06 04:30:39,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 04:30:39,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:30:39,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:30:39,134 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:39,140 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:39,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-06 04:30:39,223 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:39,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 04:30:39,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:39,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 04:30:39,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:30:39,239 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:39,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:30:39,282 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:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586542361] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 04:30:39,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 04:30:39,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 04:30:39,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500923373] [2025-02-06 04:30:39,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 04:30:39,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 04:30:39,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:39,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 04:30:39,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:30:39,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 194 [2025-02-06 04:30:39,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 360 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:39,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 194 [2025-02-06 04:30:39,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:30:42,761 INFO L124 PetriNetUnfolderBase]: 30545/61747 cut-off events. [2025-02-06 04:30:42,762 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2025-02-06 04:30:42,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105762 conditions, 61747 events. 30545/61747 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 651096 event pairs, 26406 based on Foata normal form. 6/54733 useless extension candidates. Maximal degree in co-relation 105703. Up to 43868 conditions per place. [2025-02-06 04:30:43,286 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 83 selfloop transitions, 11 changer transitions 0/160 dead transitions. [2025-02-06 04:30:43,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 160 transitions, 584 flow [2025-02-06 04:30:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 04:30:43,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 04:30:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 892 transitions. [2025-02-06 04:30:43,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38316151202749144 [2025-02-06 04:30:43,289 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 360 flow. Second operand 12 states and 892 transitions. [2025-02-06 04:30:43,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 160 transitions, 584 flow [2025-02-06 04:30:43,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 160 transitions, 570 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-02-06 04:30:43,293 INFO L231 Difference]: Finished difference. Result has 171 places, 160 transitions, 430 flow [2025-02-06 04:30:43,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=430, PETRI_PLACES=171, PETRI_TRANSITIONS=160} [2025-02-06 04:30:43,293 INFO L279 CegarLoopForPetriNet]: 145 programPoint places, 26 predicate places. [2025-02-06 04:30:43,294 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 160 transitions, 430 flow [2025-02-06 04:30:43,294 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:43,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:43,294 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 1, 1, 1, 1, 1] [2025-02-06 04:30:43,301 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:43,494 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:43,495 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:43,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:43,496 INFO L85 PathProgramCache]: Analyzing trace with hash -730216753, now seen corresponding path program 3 times [2025-02-06 04:30:43,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:43,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817740164] [2025-02-06 04:30:43,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 04:30:43,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:43,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 6 equivalence classes. [2025-02-06 04:30:43,533 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:43,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 04:30:43,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:43,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:30:43,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 04:30:43,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 04:30:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:30:43,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:30:43,553 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:30:43,554 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:30:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 04:30:43,554 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-06 04:30:43,555 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:30:43,555 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:30:43,579 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 04:30:43,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 242 transitions, 511 flow [2025-02-06 04:30:43,605 INFO L124 PetriNetUnfolderBase]: 148/543 cut-off events. [2025-02-06 04:30:43,605 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-06 04:30:43,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 543 events. 148/543 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3241 event pairs, 1 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 394. Up to 16 conditions per place. [2025-02-06 04:30:43,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 242 transitions, 511 flow [2025-02-06 04:30:43,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 242 transitions, 511 flow [2025-02-06 04:30:43,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:30:43,612 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;@2877b36c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:30:43,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 04:30:43,620 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:30:43,620 INFO L124 PetriNetUnfolderBase]: 29/154 cut-off events. [2025-02-06 04:30:43,620 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 04:30:43,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:30:43,620 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2025-02-06 04:30:43,620 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 4 more)] === [2025-02-06 04:30:43,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:30:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1849481852, now seen corresponding path program 1 times [2025-02-06 04:30:43,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:30:43,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802073639] [2025-02-06 04:30:43,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:30:43,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:30:43,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 04:30:43,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 04:30:43,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:30:43,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:30:43,647 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:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:30:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802073639] [2025-02-06 04:30:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802073639] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:30:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:30:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:30:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262773319] [2025-02-06 04:30:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:30:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:30:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:30:43,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:30:43,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:30:43,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 242 [2025-02-06 04:30:43,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 242 transitions, 511 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:43,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:30:43,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 242 [2025-02-06 04:30:43,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand