./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.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 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:17:08,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:17:08,937 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 04:17:08,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:17:08,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:17:08,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:17:08,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:17:08,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:17:08,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:17:08,967 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:17:08,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:17:08,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:17:08,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:17:08,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:17:08,968 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:17:08,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:17:08,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:17:08,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:17:08,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:17:08,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:17:08,970 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:17:08,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:17:08,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:17:08,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:17:08,971 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 -> 5bf99dd5722e6551de991a345b21615b777cf7cef3d452afb8b79773fd45d3d8 [2025-02-06 04:17:09,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:17:09,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:17:09,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:17:09,204 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:17:09,204 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:17:09,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-02-06 04:17:10,388 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e44e96a/29a8a7eb60c84d04b460c7f209a6fa0a/FLAGf6c6d58f0 [2025-02-06 04:17:10,687 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:17:10,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/36_stack_cas_p0_vs_concur.i [2025-02-06 04:17:10,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e44e96a/29a8a7eb60c84d04b460c7f209a6fa0a/FLAGf6c6d58f0 [2025-02-06 04:17:10,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f3e44e96a/29a8a7eb60c84d04b460c7f209a6fa0a [2025-02-06 04:17:10,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:17:10,723 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:17:10,724 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:17:10,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:17:10,730 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:17:10,731 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:17:10" (1/1) ... [2025-02-06 04:17:10,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7858b86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:10, skipping insertion in model container [2025-02-06 04:17:10,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:17:10" (1/1) ... [2025-02-06 04:17:10,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:17:10,998 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-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2025-02-06 04:17:11,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:17:11,016 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:17:11,065 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-ext/36_stack_cas_p0_vs_concur.i[30869,30882] [2025-02-06 04:17:11,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:17:11,098 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:17:11,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11 WrapperNode [2025-02-06 04:17:11,100 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:17:11,101 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:17:11,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:17:11,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:17:11,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,140 INFO L138 Inliner]: procedures = 172, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 158 [2025-02-06 04:17:11,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:17:11,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:17:11,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:17:11,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:17:11,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,173 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 5, 6, 3]. 38 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0, 0]. The 5 writes are split as follows [0, 1, 2, 2]. [2025-02-06 04:17:11,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,180 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:17:11,186 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:17:11,186 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:17:11,186 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:17:11,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (1/1) ... [2025-02-06 04:17:11,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:17:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:17:11,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 04:17:11,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-06 04:17:11,236 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 04:17:11,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 04:17:11,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 04:17:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 04:17:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:17:11,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:17:11,239 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 04:17:11,341 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:17:11,342 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:17:11,553 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 04:17:11,553 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:17:11,831 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:17:11,831 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:17:11,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:17:11 BoogieIcfgContainer [2025-02-06 04:17:11,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:17:11,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:17:11,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:17:11,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:17:11,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:17:10" (1/3) ... [2025-02-06 04:17:11,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d563372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:17:11, skipping insertion in model container [2025-02-06 04:17:11,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:17:11" (2/3) ... [2025-02-06 04:17:11,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d563372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:17:11, skipping insertion in model container [2025-02-06 04:17:11,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:17:11" (3/3) ... [2025-02-06 04:17:11,838 INFO L128 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2025-02-06 04:17:11,849 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:17:11,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36_stack_cas_p0_vs_concur.i that has 2 procedures, 19 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-02-06 04:17:11,850 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 04:17:11,886 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:11,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 22 transitions, 48 flow [2025-02-06 04:17:11,930 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2025-02-06 04:17:11,932 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:17:11,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 24 events. 3/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-02-06 04:17:11,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 22 transitions, 48 flow [2025-02-06 04:17:11,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 22 transitions, 48 flow [2025-02-06 04:17:11,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:11,964 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6eb64bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:11,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-02-06 04:17:11,973 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:11,974 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-02-06 04:17:11,974 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 04:17:11,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:11,974 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-06 04:17:11,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:17:11,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1925874325, now seen corresponding path program 1 times [2025-02-06 04:17:11,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:11,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317579242] [2025-02-06 04:17:11,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:12,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:17:12,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:17:12,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:12,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 04:17:12,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 04:17:12,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:12,376 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:12,377 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-02-06 04:17:12,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-02-06 04:17:12,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2025-02-06 04:17:12,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 04:17:12,381 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-06 04:17:12,383 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:12,384 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-06 04:17:12,410 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:12,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 39 transitions, 88 flow [2025-02-06 04:17:12,426 INFO L124 PetriNetUnfolderBase]: 6/44 cut-off events. [2025-02-06 04:17:12,427 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:17:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 44 events. 6/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 35. Up to 3 conditions per place. [2025-02-06 04:17:12,429 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 39 transitions, 88 flow [2025-02-06 04:17:12,429 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 39 transitions, 88 flow [2025-02-06 04:17:12,430 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:12,430 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;@6eb64bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:12,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-06 04:17:12,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:12,438 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-02-06 04:17:12,439 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 04:17:12,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:12,439 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-02-06 04:17:12,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-06 04:17:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1347295231, now seen corresponding path program 1 times [2025-02-06 04:17:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952349032] [2025-02-06 04:17:12,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:12,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:17:12,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:17:12,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:12,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 04:17:12,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 04:17:12,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:12,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:12,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:12,758 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:12,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2025-02-06 04:17:12,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2025-02-06 04:17:12,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2025-02-06 04:17:12,758 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-02-06 04:17:12,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:17:12,758 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-02-06 04:17:12,759 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:12,759 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-06 04:17:12,787 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:12,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 56 transitions, 130 flow [2025-02-06 04:17:12,809 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2025-02-06 04:17:12,809 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-06 04:17:12,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 64 events. 9/64 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 152 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 51. Up to 4 conditions per place. [2025-02-06 04:17:12,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 56 transitions, 130 flow [2025-02-06 04:17:12,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 54 places, 56 transitions, 130 flow [2025-02-06 04:17:12,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:12,813 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;@6eb64bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:12,813 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-02-06 04:17:12,818 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:12,818 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-02-06 04:17:12,818 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:17:12,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:12,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:12,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:17:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:12,819 INFO L85 PathProgramCache]: Analyzing trace with hash -615880429, now seen corresponding path program 1 times [2025-02-06 04:17:12,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:12,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452639919] [2025-02-06 04:17:12,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:12,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:17:12,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:17:13,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:13,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:13,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:13,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452639919] [2025-02-06 04:17:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452639919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:13,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:13,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:13,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368942620] [2025-02-06 04:17:13,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:13,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:17:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:13,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:17:13,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:17:13,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 56 [2025-02-06 04:17:13,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 56 transitions, 130 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:17:13,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:13,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 56 [2025-02-06 04:17:13,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:14,685 INFO L124 PetriNetUnfolderBase]: 16061/21909 cut-off events. [2025-02-06 04:17:14,686 INFO L125 PetriNetUnfolderBase]: For 944/944 co-relation queries the response was YES. [2025-02-06 04:17:14,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44230 conditions, 21909 events. 16061/21909 cut-off events. For 944/944 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 110040 event pairs, 13319 based on Foata normal form. 1369/20470 useless extension candidates. Maximal degree in co-relation 25175. Up to 21703 conditions per place. [2025-02-06 04:17:14,850 INFO L140 encePairwiseOnDemand]: 49/56 looper letters, 42 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2025-02-06 04:17:14,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 49 transitions, 200 flow [2025-02-06 04:17:14,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:17:14,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:17:14,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2025-02-06 04:17:14,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-02-06 04:17:14,863 INFO L175 Difference]: Start difference. First operand has 54 places, 56 transitions, 130 flow. Second operand 2 states and 63 transitions. [2025-02-06 04:17:14,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 49 transitions, 200 flow [2025-02-06 04:17:14,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 198 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-06 04:17:14,868 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 114 flow [2025-02-06 04:17:14,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2025-02-06 04:17:14,873 INFO L279 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2025-02-06 04:17:14,873 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 114 flow [2025-02-06 04:17:14,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:17:14,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:14,873 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-02-06 04:17:14,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:17:14,874 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-02-06 04:17:14,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash 829999274, now seen corresponding path program 1 times [2025-02-06 04:17:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:14,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562505598] [2025-02-06 04:17:14,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:15,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:17:15,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:17:15,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:15,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:15,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:15,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 04:17:15,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 04:17:15,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:15,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:15,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:15,139 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:15,140 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-02-06 04:17:15,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-02-06 04:17:15,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-02-06 04:17:15,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-02-06 04:17:15,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-02-06 04:17:15,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:17:15,140 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 04:17:15,141 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:15,141 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-06 04:17:15,177 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:15,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 73 transitions, 174 flow [2025-02-06 04:17:15,191 INFO L124 PetriNetUnfolderBase]: 12/84 cut-off events. [2025-02-06 04:17:15,191 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 04:17:15,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 84 events. 12/84 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 222 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 76. Up to 5 conditions per place. [2025-02-06 04:17:15,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 73 transitions, 174 flow [2025-02-06 04:17:15,193 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 73 transitions, 174 flow [2025-02-06 04:17:15,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:15,197 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;@6eb64bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:15,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-02-06 04:17:15,202 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:15,202 INFO L124 PetriNetUnfolderBase]: 1/27 cut-off events. [2025-02-06 04:17:15,202 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:17:15,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:15,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:15,202 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:17:15,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -368980301, now seen corresponding path program 1 times [2025-02-06 04:17:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:15,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530377684] [2025-02-06 04:17:15,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:15,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:17:15,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:17:15,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:15,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530377684] [2025-02-06 04:17:15,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530377684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:15,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:15,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:15,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764192624] [2025-02-06 04:17:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:15,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:17:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:15,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:17:15,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:17:15,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 73 [2025-02-06 04:17:15,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 174 flow. Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:17:15,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:15,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 73 [2025-02-06 04:17:15,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 04:17:33,760 INFO L124 PetriNetUnfolderBase]: 266341/336197 cut-off events. [2025-02-06 04:17:33,760 INFO L125 PetriNetUnfolderBase]: For 18924/18924 co-relation queries the response was YES. [2025-02-06 04:17:34,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679577 conditions, 336197 events. 266341/336197 cut-off events. For 18924/18924 co-relation queries the response was YES. Maximal size of possible extension queue 4979. Compared 1897508 event pairs, 222127 based on Foata normal form. 22081/313336 useless extension candidates. Maximal degree in co-relation 195411. Up to 334121 conditions per place. [2025-02-06 04:17:35,536 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 55 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2025-02-06 04:17:35,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 266 flow [2025-02-06 04:17:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:17:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-06 04:17:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 82 transitions. [2025-02-06 04:17:35,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5616438356164384 [2025-02-06 04:17:35,538 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 174 flow. Second operand 2 states and 82 transitions. [2025-02-06 04:17:35,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 266 flow [2025-02-06 04:17:35,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 260 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-06 04:17:35,555 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 150 flow [2025-02-06 04:17:35,555 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=150, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2025-02-06 04:17:35,556 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -4 predicate places. [2025-02-06 04:17:35,556 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 150 flow [2025-02-06 04:17:35,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:17:35,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:35,556 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:35,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:17:35,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-02-06 04:17:35,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:35,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1779477377, now seen corresponding path program 1 times [2025-02-06 04:17:35,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:35,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119057938] [2025-02-06 04:17:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:35,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:17:35,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:17:35,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:35,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:35,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:17:35,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 04:17:35,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 04:17:35,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:35,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:17:35,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:17:35,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:17:35,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-02-06 04:17:35,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-02-06 04:17:35,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-02-06 04:17:35,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-02-06 04:17:35,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-02-06 04:17:35,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-02-06 04:17:35,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 04:17:35,924 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-06 04:17:35,924 WARN L246 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-06 04:17:35,924 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-02-06 04:17:35,977 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 04:17:35,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 220 flow [2025-02-06 04:17:35,989 INFO L124 PetriNetUnfolderBase]: 15/104 cut-off events. [2025-02-06 04:17:35,989 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-06 04:17:35,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 104 events. 15/104 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 294 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 102. Up to 6 conditions per place. [2025-02-06 04:17:35,990 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 90 transitions, 220 flow [2025-02-06 04:17:35,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 90 transitions, 220 flow [2025-02-06 04:17:35,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:17:35,992 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;@6eb64bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:17:35,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-02-06 04:17:35,996 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 04:17:35,996 INFO L124 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-02-06 04:17:35,996 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 04:17:35,996 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 04:17:35,996 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:17:35,996 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2025-02-06 04:17:35,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:17:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1138197805, now seen corresponding path program 1 times [2025-02-06 04:17:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:17:35,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849972447] [2025-02-06 04:17:35,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:17:35,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:17:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 04:17:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 04:17:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:17:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:17:36,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 04:17:36,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:17:36,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849972447] [2025-02-06 04:17:36,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849972447] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:17:36,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:17:36,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:17:36,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889773005] [2025-02-06 04:17:36,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:17:36,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:17:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:17:36,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:17:36,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:17:36,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 90 [2025-02-06 04:17:36,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 220 flow. Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 04:17:36,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 04:17:36,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 90 [2025-02-06 04:17:36,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand