./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-complex/safestack_relacy.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-complex/safestack_relacy.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 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 01:07:08,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 01:07:08,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-08 01:07:08,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 01:07:08,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 01:07:08,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 01:07:08,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 01:07:08,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 01:07:08,857 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 01:07:08,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 01:07:08,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 01:07:08,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 01:07:08,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 01:07:08,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 01:07:08,858 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 01:07:08,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 01:07:08,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 01:07:08,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 01:07:08,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 01:07:08,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 01:07:08,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 01:07:08,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 01:07:08,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:07:08,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 01:07:08,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 01:07:08,862 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 -> 516fee84c55ddb7fa4275a43ad5a2da6ea994abf63bbbbd8ed5c82108d65f7b0 [2025-02-08 01:07:09,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 01:07:09,170 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 01:07:09,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 01:07:09,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 01:07:09,178 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 01:07:09,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 01:07:10,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bee39b3b/98bf423fa81e4831b2be570984a66d83/FLAG07084f341 [2025-02-08 01:07:11,070 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 01:07:11,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i [2025-02-08 01:07:11,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bee39b3b/98bf423fa81e4831b2be570984a66d83/FLAG07084f341 [2025-02-08 01:07:11,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3bee39b3b/98bf423fa81e4831b2be570984a66d83 [2025-02-08 01:07:11,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 01:07:11,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 01:07:11,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 01:07:11,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 01:07:11,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 01:07:11,173 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:07:11" (1/1) ... [2025-02-08 01:07:11,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52f53cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:11, skipping insertion in model container [2025-02-08 01:07:11,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 01:07:11" (1/1) ... [2025-02-08 01:07:11,254 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 01:07:11,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i[76630,76643] [2025-02-08 01:07:11,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:07:11,915 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 01:07:11,981 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-complex/safestack_relacy.i[76630,76643] [2025-02-08 01:07:11,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 01:07:12,053 INFO L204 MainTranslator]: Completed translation [2025-02-08 01:07:12,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12 WrapperNode [2025-02-08 01:07:12,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 01:07:12,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 01:07:12,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 01:07:12,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 01:07:12,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,123 INFO L138 Inliner]: procedures = 458, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2025-02-08 01:07:12,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 01:07:12,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 01:07:12,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 01:07:12,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 01:07:12,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,167 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 5, 30]. 81 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 3, 8]. The 13 writes are split as follows [0, 1, 12]. [2025-02-08 01:07:12,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,184 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 01:07:12,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 01:07:12,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 01:07:12,191 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 01:07:12,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (1/1) ... [2025-02-08 01:07:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 01:07:12,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:07:12,221 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-08 01:07:12,230 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-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-02-08 01:07:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 01:07:12,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 01:07:12,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 01:07:12,250 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 01:07:12,478 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 01:07:12,479 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742: havoc #t~ret21#1; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-1: ~elem~0#1 := #t~ret21#1; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-2: assume { :end_inline_Pop } true;assume -2147483648 <= #t~ret21#1 && #t~ret21#1 <= 2147483647; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-3: havoc Pop_#t~mem8#1, Pop_#t~mem9#1, Pop_#t~mem10#1, Pop_#t~ret11#1, Pop_#t~mem12#1, Pop_#t~ret13#1, Pop_#t~mem14#1, Pop_#t~mem15#1, Pop_~head2~0#1, Pop_~head1~0#1, Pop_~next1~0#1; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1742-4: #t~ret21#1 := Pop_#res#1; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume ~elem~0#1 >= 0; [2025-02-08 01:07:12,672 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1743: assume !(~elem~0#1 >= 0); [2025-02-08 01:07:12,673 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 01:07:12,673 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 01:07:12,749 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 01:07:12,749 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 01:07:12,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:07:12 BoogieIcfgContainer [2025-02-08 01:07:12,749 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 01:07:12,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 01:07:12,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 01:07:12,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 01:07:12,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 01:07:11" (1/3) ... [2025-02-08 01:07:12,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27613c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:07:12, skipping insertion in model container [2025-02-08 01:07:12,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 01:07:12" (2/3) ... [2025-02-08 01:07:12,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27613c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 01:07:12, skipping insertion in model container [2025-02-08 01:07:12,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 01:07:12" (3/3) ... [2025-02-08 01:07:12,757 INFO L128 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2025-02-08 01:07:12,768 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 01:07:12,769 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safestack_relacy.i that has 2 procedures, 49 locations, 1 initial locations, 7 loop locations, and 1 error locations. [2025-02-08 01:07:12,769 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 01:07:12,812 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 01:07:12,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 59 transitions, 125 flow [2025-02-08 01:07:12,862 INFO L124 PetriNetUnfolderBase]: 10/63 cut-off events. [2025-02-08 01:07:12,864 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:07:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 63 events. 10/63 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 45. Up to 3 conditions per place. [2025-02-08 01:07:12,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 59 transitions, 125 flow [2025-02-08 01:07:12,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 57 transitions, 118 flow [2025-02-08 01:07:12,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:07:12,883 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;@3b481f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:07:12,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-08 01:07:12,888 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:07:12,888 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2025-02-08 01:07:12,888 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:07:12,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:12,889 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:12,889 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:07:12,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1918809193, now seen corresponding path program 1 times [2025-02-08 01:07:12,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:12,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479055988] [2025-02-08 01:07:12,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:12,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:13,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 01:07:13,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 01:07:13,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:13,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:13,472 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-08 01:07:13,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:13,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479055988] [2025-02-08 01:07:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479055988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:13,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:13,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:07:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23448039] [2025-02-08 01:07:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:13,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:07:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:13,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:07:13,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:07:13,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 59 [2025-02-08 01:07:13,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 57 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-08 01:07:13,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:13,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 59 [2025-02-08 01:07:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:13,622 INFO L124 PetriNetUnfolderBase]: 104/247 cut-off events. [2025-02-08 01:07:13,622 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 01:07:13,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 247 events. 104/247 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 734 event pairs, 85 based on Foata normal form. 7/198 useless extension candidates. Maximal degree in co-relation 432. Up to 211 conditions per place. [2025-02-08 01:07:13,624 INFO L140 encePairwiseOnDemand]: 52/59 looper letters, 30 selfloop transitions, 4 changer transitions 2/42 dead transitions. [2025-02-08 01:07:13,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 160 flow [2025-02-08 01:07:13,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:07:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:07:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-02-08 01:07:13,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3008474576271186 [2025-02-08 01:07:13,640 INFO L175 Difference]: Start difference. First operand has 51 places, 57 transitions, 118 flow. Second operand 4 states and 71 transitions. [2025-02-08 01:07:13,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 160 flow [2025-02-08 01:07:13,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:13,649 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 96 flow [2025-02-08 01:07:13,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2025-02-08 01:07:13,659 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2025-02-08 01:07:13,660 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 96 flow [2025-02-08 01:07:13,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-08 01:07:13,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:13,660 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:13,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 01:07:13,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:07:13,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash 272863259, now seen corresponding path program 1 times [2025-02-08 01:07:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-02-08 01:07:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:13,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:07:13,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:07:13,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:13,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:13,819 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-08 01:07:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223132194] [2025-02-08 01:07:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223132194] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:07:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127850546] [2025-02-08 01:07:13,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:13,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:07:13,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:07:13,823 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-08 01:07:13,824 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-08 01:07:13,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:07:13,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:07:13,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:13,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:13,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:07:13,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:07:14,029 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-08 01:07:14,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:07:14,064 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-08 01:07:14,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127850546] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:07:14,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:07:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 01:07:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631296824] [2025-02-08 01:07:14,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:07:14,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:07:14,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:14,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:07:14,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:07:14,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 59 [2025-02-08 01:07:14,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 96 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-08 01:07:14,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:14,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 59 [2025-02-08 01:07:14,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:14,228 INFO L124 PetriNetUnfolderBase]: 64/166 cut-off events. [2025-02-08 01:07:14,229 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 01:07:14,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 166 events. 64/166 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 400 event pairs, 51 based on Foata normal form. 1/136 useless extension candidates. Maximal degree in co-relation 290. Up to 135 conditions per place. [2025-02-08 01:07:14,230 INFO L140 encePairwiseOnDemand]: 53/59 looper letters, 32 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2025-02-08 01:07:14,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 186 flow [2025-02-08 01:07:14,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:07:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:07:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-02-08 01:07:14,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23163841807909605 [2025-02-08 01:07:14,232 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 96 flow. Second operand 6 states and 82 transitions. [2025-02-08 01:07:14,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 186 flow [2025-02-08 01:07:14,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:07:14,233 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 122 flow [2025-02-08 01:07:14,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2025-02-08 01:07:14,234 INFO L279 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2025-02-08 01:07:14,234 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 122 flow [2025-02-08 01:07:14,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-08 01:07:14,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:14,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:14,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 01:07:14,439 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-08 01:07:14,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 01:07:14,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:14,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1539161897, now seen corresponding path program 2 times [2025-02-08 01:07:14,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:14,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141485574] [2025-02-08 01:07:14,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:07:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:14,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-08 01:07:14,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:07:14,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:07:14,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:07:14,494 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:07:14,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:07:14,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:07:14,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:14,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:07:14,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:07:14,526 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:07:14,527 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-08 01:07:14,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-08 01:07:14,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-08 01:07:14,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 01:07:14,528 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-02-08 01:07:14,534 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 01:07:14,534 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 01:07:14,591 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 01:07:14,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 101 transitions, 218 flow [2025-02-08 01:07:14,630 INFO L124 PetriNetUnfolderBase]: 20/116 cut-off events. [2025-02-08 01:07:14,634 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 01:07:14,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 116 events. 20/116 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 353 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 90. Up to 6 conditions per place. [2025-02-08 01:07:14,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 101 transitions, 218 flow [2025-02-08 01:07:14,637 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 101 transitions, 218 flow [2025-02-08 01:07:14,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:07:14,642 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;@3b481f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:07:14,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-08 01:07:14,652 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:07:14,656 INFO L124 PetriNetUnfolderBase]: 2/37 cut-off events. [2025-02-08 01:07:14,656 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 01:07:14,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:14,657 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:14,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 01:07:14,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 115866696, now seen corresponding path program 1 times [2025-02-08 01:07:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105148619] [2025-02-08 01:07:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:14,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:07:14,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:07:14,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:14,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:14,746 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-08 01:07:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105148619] [2025-02-08 01:07:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105148619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:07:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422472616] [2025-02-08 01:07:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:07:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:07:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:07:14,747 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 101 [2025-02-08 01:07:14,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 218 flow. Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-08 01:07:14,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:14,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 101 [2025-02-08 01:07:14,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:15,842 INFO L124 PetriNetUnfolderBase]: 4399/7085 cut-off events. [2025-02-08 01:07:15,846 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2025-02-08 01:07:15,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13743 conditions, 7085 events. 4399/7085 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 37758 event pairs, 3907 based on Foata normal form. 227/5815 useless extension candidates. Maximal degree in co-relation 10885. Up to 6561 conditions per place. [2025-02-08 01:07:15,890 INFO L140 encePairwiseOnDemand]: 97/101 looper letters, 50 selfloop transitions, 0 changer transitions 5/67 dead transitions. [2025-02-08 01:07:15,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 67 transitions, 260 flow [2025-02-08 01:07:15,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:07:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:07:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 91 transitions. [2025-02-08 01:07:15,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4504950495049505 [2025-02-08 01:07:15,895 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 218 flow. Second operand 2 states and 91 transitions. [2025-02-08 01:07:15,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 67 transitions, 260 flow [2025-02-08 01:07:15,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 67 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:15,896 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 134 flow [2025-02-08 01:07:15,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2025-02-08 01:07:15,897 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -23 predicate places. [2025-02-08 01:07:15,897 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 134 flow [2025-02-08 01:07:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-08 01:07:15,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:15,897 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:15,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 01:07:15,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 01:07:15,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:15,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2093444547, now seen corresponding path program 1 times [2025-02-08 01:07:15,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:15,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572647800] [2025-02-08 01:07:15,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:15,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 01:07:15,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 01:07:15,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:15,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:16,036 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-08 01:07:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:16,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572647800] [2025-02-08 01:07:16,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572647800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:16,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:16,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:07:16,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104667820] [2025-02-08 01:07:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:16,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:07:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:16,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:07:16,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:07:16,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 101 [2025-02-08 01:07:16,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 01:07:16,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:16,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 101 [2025-02-08 01:07:16,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:16,388 INFO L124 PetriNetUnfolderBase]: 2733/4463 cut-off events. [2025-02-08 01:07:16,389 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 01:07:16,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8645 conditions, 4463 events. 2733/4463 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 22034 event pairs, 2428 based on Foata normal form. 1/3616 useless extension candidates. Maximal degree in co-relation 8640. Up to 4112 conditions per place. [2025-02-08 01:07:16,406 INFO L140 encePairwiseOnDemand]: 96/101 looper letters, 50 selfloop transitions, 4 changer transitions 0/64 dead transitions. [2025-02-08 01:07:16,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 246 flow [2025-02-08 01:07:16,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:07:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:07:16,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-02-08 01:07:16,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2747524752475248 [2025-02-08 01:07:16,407 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 134 flow. Second operand 4 states and 111 transitions. [2025-02-08 01:07:16,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 246 flow [2025-02-08 01:07:16,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:16,409 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 150 flow [2025-02-08 01:07:16,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2025-02-08 01:07:16,410 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -22 predicate places. [2025-02-08 01:07:16,410 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 150 flow [2025-02-08 01:07:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-08 01:07:16,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:16,410 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:16,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 01:07:16,410 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 01:07:16,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash 660664940, now seen corresponding path program 1 times [2025-02-08 01:07:16,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:16,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41884095] [2025-02-08 01:07:16,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:16,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:16,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:07:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:07:16,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:16,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:16,562 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-08 01:07:16,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:16,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41884095] [2025-02-08 01:07:16,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41884095] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:07:16,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032168203] [2025-02-08 01:07:16,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:07:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:07:16,568 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-08 01:07:16,570 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-08 01:07:16,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:07:16,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:07:16,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:16,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:16,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:07:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:07:16,775 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-08 01:07:16,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:07:16,809 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-08 01:07:16,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032168203] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:07:16,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:07:16,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 01:07:16,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146612985] [2025-02-08 01:07:16,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:07:16,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:07:16,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:16,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:07:16,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:07:16,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 101 [2025-02-08 01:07:16,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 150 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-08 01:07:16,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:16,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 101 [2025-02-08 01:07:16,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:17,138 INFO L124 PetriNetUnfolderBase]: 2733/4466 cut-off events. [2025-02-08 01:07:17,139 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-02-08 01:07:17,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8663 conditions, 4466 events. 2733/4466 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 22051 event pairs, 2428 based on Foata normal form. 1/3619 useless extension candidates. Maximal degree in co-relation 8656. Up to 4112 conditions per place. [2025-02-08 01:07:17,152 INFO L140 encePairwiseOnDemand]: 95/101 looper letters, 52 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-02-08 01:07:17,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 280 flow [2025-02-08 01:07:17,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:07:17,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:07:17,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-02-08 01:07:17,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22772277227722773 [2025-02-08 01:07:17,154 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 150 flow. Second operand 6 states and 138 transitions. [2025-02-08 01:07:17,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 280 flow [2025-02-08 01:07:17,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:07:17,156 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 176 flow [2025-02-08 01:07:17,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2025-02-08 01:07:17,156 INFO L279 CegarLoopForPetriNet]: 87 programPoint places, -17 predicate places. [2025-02-08 01:07:17,156 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 176 flow [2025-02-08 01:07:17,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-08 01:07:17,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:17,157 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:17,163 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-08 01:07:17,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:07:17,361 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-08 01:07:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash 108380451, now seen corresponding path program 2 times [2025-02-08 01:07:17,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:17,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259452033] [2025-02-08 01:07:17,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:07:17,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:17,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 01:07:17,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:07:17,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 01:07:17,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:07:17,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 01:07:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:07:17,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:07:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:17,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 01:07:17,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 01:07:17,432 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 01:07:17,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-08 01:07:17,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-08 01:07:17,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-08 01:07:17,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-08 01:07:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 01:07:17,433 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-02-08 01:07:17,433 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 01:07:17,434 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 01:07:17,488 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 01:07:17,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 143 transitions, 313 flow [2025-02-08 01:07:17,511 INFO L124 PetriNetUnfolderBase]: 33/180 cut-off events. [2025-02-08 01:07:17,514 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 01:07:17,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 180 events. 33/180 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs, 1 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 142. Up to 12 conditions per place. [2025-02-08 01:07:17,516 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 143 transitions, 313 flow [2025-02-08 01:07:17,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 143 transitions, 313 flow [2025-02-08 01:07:17,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 01:07:17,522 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;@3b481f4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 01:07:17,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-08 01:07:17,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 01:07:17,527 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2025-02-08 01:07:17,528 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 01:07:17,528 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:17,528 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:17,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:07:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 76605072, now seen corresponding path program 1 times [2025-02-08 01:07:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:17,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199149011] [2025-02-08 01:07:17,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:17,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 01:07:17,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 01:07:17,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:17,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:17,577 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-08 01:07:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:17,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199149011] [2025-02-08 01:07:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199149011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:17,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 01:07:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330371371] [2025-02-08 01:07:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:17,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 01:07:17,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:17,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 01:07:17,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 01:07:17,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 143 [2025-02-08 01:07:17,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 143 transitions, 313 flow. Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-08 01:07:17,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:17,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 143 [2025-02-08 01:07:17,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:26,962 INFO L124 PetriNetUnfolderBase]: 138439/193245 cut-off events. [2025-02-08 01:07:26,963 INFO L125 PetriNetUnfolderBase]: For 5680/5680 co-relation queries the response was YES. [2025-02-08 01:07:27,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378658 conditions, 193245 events. 138439/193245 cut-off events. For 5680/5680 co-relation queries the response was YES. Maximal size of possible extension queue 2517. Compared 1276753 event pairs, 127951 based on Foata normal form. 7090/162163 useless extension candidates. Maximal degree in co-relation 218952. Up to 182709 conditions per place. [2025-02-08 01:07:27,763 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 70 selfloop transitions, 0 changer transitions 6/92 dead transitions. [2025-02-08 01:07:27,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 92 transitions, 363 flow [2025-02-08 01:07:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 01:07:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 01:07:27,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2025-02-08 01:07:27,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4405594405594406 [2025-02-08 01:07:27,765 INFO L175 Difference]: Start difference. First operand has 122 places, 143 transitions, 313 flow. Second operand 2 states and 126 transitions. [2025-02-08 01:07:27,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 92 transitions, 363 flow [2025-02-08 01:07:27,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 92 transitions, 363 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:27,769 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 190 flow [2025-02-08 01:07:27,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=190, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2025-02-08 01:07:27,769 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -35 predicate places. [2025-02-08 01:07:27,769 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 190 flow [2025-02-08 01:07:27,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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-08 01:07:27,772 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:27,772 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:27,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 01:07:27,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:07:27,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:27,773 INFO L85 PathProgramCache]: Analyzing trace with hash -560927704, now seen corresponding path program 1 times [2025-02-08 01:07:27,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:27,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436543295] [2025-02-08 01:07:27,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:27,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:27,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 01:07:27,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 01:07:27,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:27,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:27,843 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-08 01:07:27,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:27,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436543295] [2025-02-08 01:07:27,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436543295] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:27,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:27,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 01:07:27,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729356150] [2025-02-08 01:07:27,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:27,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 01:07:27,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:27,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 01:07:27,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 01:07:27,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 143 [2025-02-08 01:07:27,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-08 01:07:27,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:27,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 143 [2025-02-08 01:07:27,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:33,502 INFO L124 PetriNetUnfolderBase]: 84898/118912 cut-off events. [2025-02-08 01:07:33,502 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2025-02-08 01:07:33,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232744 conditions, 118912 events. 84898/118912 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 744882 event pairs, 78633 based on Foata normal form. 1/97253 useless extension candidates. Maximal degree in co-relation 232738. Up to 112317 conditions per place. [2025-02-08 01:07:33,982 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 70 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-02-08 01:07:33,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 88 transitions, 342 flow [2025-02-08 01:07:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 01:07:33,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 01:07:33,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2025-02-08 01:07:33,987 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.270979020979021 [2025-02-08 01:07:33,988 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 190 flow. Second operand 4 states and 155 transitions. [2025-02-08 01:07:33,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 88 transitions, 342 flow [2025-02-08 01:07:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 88 transitions, 340 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 01:07:33,993 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 204 flow [2025-02-08 01:07:33,995 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2025-02-08 01:07:33,996 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -34 predicate places. [2025-02-08 01:07:33,996 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 204 flow [2025-02-08 01:07:33,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-08 01:07:33,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:33,996 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:33,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 01:07:33,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:07:33,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash 212481998, now seen corresponding path program 1 times [2025-02-08 01:07:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650041295] [2025-02-08 01:07:33,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:34,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:07:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:07:34,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:34,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:34,211 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-08 01:07:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650041295] [2025-02-08 01:07:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650041295] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 01:07:34,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335874774] [2025-02-08 01:07:34,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 01:07:34,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:07:34,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 01:07:34,216 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-08 01:07:34,230 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-08 01:07:34,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 01:07:34,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 01:07:34,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 01:07:34,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:34,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 01:07:34,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 01:07:34,377 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-08 01:07:34,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 01:07:34,402 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-08 01:07:34,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335874774] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 01:07:34,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 01:07:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 01:07:34,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64917351] [2025-02-08 01:07:34,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 01:07:34,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 01:07:34,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:34,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 01:07:34,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-02-08 01:07:34,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 143 [2025-02-08 01:07:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 204 flow. Second operand has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 143 [2025-02-08 01:07:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 01:07:40,364 INFO L124 PetriNetUnfolderBase]: 84898/118915 cut-off events. [2025-02-08 01:07:40,365 INFO L125 PetriNetUnfolderBase]: For 1198/1198 co-relation queries the response was YES. [2025-02-08 01:07:40,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232401 conditions, 118915 events. 84898/118915 cut-off events. For 1198/1198 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 744965 event pairs, 78633 based on Foata normal form. 1/97256 useless extension candidates. Maximal degree in co-relation 232393. Up to 112317 conditions per place. [2025-02-08 01:07:40,915 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 72 selfloop transitions, 7 changer transitions 0/92 dead transitions. [2025-02-08 01:07:40,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 374 flow [2025-02-08 01:07:40,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 01:07:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 01:07:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2025-02-08 01:07:40,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2261072261072261 [2025-02-08 01:07:40,918 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 204 flow. Second operand 6 states and 194 transitions. [2025-02-08 01:07:40,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 374 flow [2025-02-08 01:07:40,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 92 transitions, 368 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 01:07:40,922 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 230 flow [2025-02-08 01:07:40,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=230, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2025-02-08 01:07:40,924 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -29 predicate places. [2025-02-08 01:07:40,926 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 230 flow [2025-02-08 01:07:40,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 22.0) internal successors, (176), 8 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 01:07:40,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 01:07:40,926 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 01:07:40,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 01:07:41,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 01:07:41,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadErr0ASSERT_VIOLATIONERROR_FUNCTION, threadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-08 01:07:41,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 01:07:41,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1638628760, now seen corresponding path program 2 times [2025-02-08 01:07:41,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 01:07:41,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782820381] [2025-02-08 01:07:41,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 01:07:41,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 01:07:41,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-08 01:07:41,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 24 statements. [2025-02-08 01:07:41,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 01:07:41,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 01:07:41,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 01:07:41,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 01:07:41,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782820381] [2025-02-08 01:07:41,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782820381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 01:07:41,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 01:07:41,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 01:07:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325880975] [2025-02-08 01:07:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 01:07:41,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 01:07:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 01:07:41,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 01:07:41,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-08 01:07:41,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 143 [2025-02-08 01:07:41,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 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-08 01:07:41,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 01:07:41,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 143 [2025-02-08 01:07:41,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand