/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:34:10,823 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:34:10,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:34:10,877 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:34:10,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:34:10,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:34:10,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:34:10,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:34:10,896 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:34:10,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:34:10,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:34:10,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:34:10,897 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:34:10,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:34:10,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:34:10,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:34:10,898 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:34:11,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:34:11,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:34:11,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:34:11,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:34:11,129 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:34:11,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2025-04-13 21:34:12,432 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd546ff/05ffc43b5b3c4dc28ebc1da2347f1087/FLAG5ff0cf742 [2025-04-13 21:34:12,693 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:34:12,694 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i [2025-04-13 21:34:12,709 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd546ff/05ffc43b5b3c4dc28ebc1da2347f1087/FLAG5ff0cf742 [2025-04-13 21:34:13,432 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74bd546ff/05ffc43b5b3c4dc28ebc1da2347f1087 [2025-04-13 21:34:13,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:34:13,435 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:34:13,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:34:13,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:34:13,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:34:13,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a01c6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13, skipping insertion in model container [2025-04-13 21:34:13,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,461 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:34:13,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30837,30850] [2025-04-13 21:34:13,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31185,31198] [2025-04-13 21:34:13,773 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31448,31461] [2025-04-13 21:34:13,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:34:13,790 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:34:13,829 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[30837,30850] [2025-04-13 21:34:13,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31185,31198] [2025-04-13 21:34:13,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/08_rand_cas.i[31448,31461] [2025-04-13 21:34:13,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:34:13,852 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:34:13,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13 WrapperNode [2025-04-13 21:34:13,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:34:13,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:34:13,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:34:13,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:34:13,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,885 INFO L138 Inliner]: procedures = 178, calls = 35, calls flagged for inlining = 13, calls inlined = 14, statements flattened = 135 [2025-04-13 21:34:13,885 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:34:13,885 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:34:13,885 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:34:13,885 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:34:13,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,909 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 3, 6]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 4 writes are split as follows [0, 2, 2]. [2025-04-13 21:34:13,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,914 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:34:13,920 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:34:13,920 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:34:13,920 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:34:13,921 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (1/1) ... [2025-04-13 21:34:13,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:34:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:34:13,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:34:13,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-13 21:34:13,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:34:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:34:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:34:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:34:13,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:34:13,963 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:34:14,067 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:34:14,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:34:14,218 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-04-13 21:34:14,219 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-1: SUMMARY for call ULTIMATE.dealloc(PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset); srcloc: null [2025-04-13 21:34:14,251 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:34:14,252 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:34:14,252 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:34:14,405 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:34:14,408 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:34:14,413 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:34:14,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:34:14 BoogieIcfgContainer [2025-04-13 21:34:14,414 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:34:14,415 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:34:14,415 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:34:14,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:34:14,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:34:13" (1/3) ... [2025-04-13 21:34:14,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5c72dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:34:14, skipping insertion in model container [2025-04-13 21:34:14,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:34:13" (2/3) ... [2025-04-13 21:34:14,420 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d5c72dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:34:14, skipping insertion in model container [2025-04-13 21:34:14,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:34:14" (3/3) ... [2025-04-13 21:34:14,421 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2025-04-13 21:34:14,430 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:34:14,430 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas.i that has 2 procedures, 22 locations, 29 edges, 1 initial locations, 4 loop locations, and 3 error locations. [2025-04-13 21:34:14,431 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:34:14,476 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:34:14,501 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 25 places, 30 transitions, 64 flow [2025-04-13 21:34:14,513 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 73 states, 66 states have (on average 2.227272727272727) internal successors, (147), 72 states have internal predecessors, (147), 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-04-13 21:34:14,528 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:34:14,538 INFO L340 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=FINITE_AUTOMATA, 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;@11da5120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:34:14,539 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-13 21:34:14,540 INFO L278 IsEmpty]: Start isEmpty. Operand has 73 states, 66 states have (on average 2.227272727272727) internal successors, (147), 72 states have internal predecessors, (147), 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-04-13 21:34:14,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-04-13 21:34:14,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:34:14,544 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-04-13 21:34:14,545 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 21:34:14,548 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:34:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 10979926, now seen corresponding path program 1 times [2025-04-13 21:34:14,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:34:14,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556129199] [2025-04-13 21:34:14,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:34:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:34:14,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 21:34:14,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 21:34:14,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:14,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:14,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:34:14,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-13 21:34:14,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-13 21:34:14,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:14,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:14,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:34:14,671 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:34:14,672 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-13 21:34:14,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2025-04-13 21:34:14,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2025-04-13 21:34:14,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2025-04-13 21:34:14,673 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2025-04-13 21:34:14,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2025-04-13 21:34:14,675 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2025-04-13 21:34:14,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:34:14,680 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:34:14,682 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:34:14,682 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 21:34:14,728 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:34:14,732 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 55 transitions, 120 flow [2025-04-13 21:34:14,800 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1350 states, 1316 states have (on average 3.451367781155015) internal successors, (4542), 1349 states have internal predecessors, (4542), 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-04-13 21:34:14,803 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:34:14,804 INFO L340 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=FINITE_AUTOMATA, 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;@11da5120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:34:14,804 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-13 21:34:14,808 INFO L278 IsEmpty]: Start isEmpty. Operand has 1350 states, 1316 states have (on average 3.451367781155015) internal successors, (4542), 1349 states have internal predecessors, (4542), 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-04-13 21:34:14,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 21:34:14,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:34:14,809 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2025-04-13 21:34:14,810 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-13 21:34:14,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:34:14,811 INFO L85 PathProgramCache]: Analyzing trace with hash -683902336, now seen corresponding path program 1 times [2025-04-13 21:34:14,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:34:14,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548376991] [2025-04-13 21:34:14,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:34:14,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:34:14,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:34:14,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:34:14,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:14,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:14,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:34:14,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 21:34:14,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 21:34:14,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:14,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:14,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:34:14,846 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (7 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 10 remaining) [2025-04-13 21:34:14,847 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 10 remaining) [2025-04-13 21:34:14,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:34:14,848 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:34:14,848 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:34:14,848 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-13 21:34:14,912 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:34:14,915 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 80 transitions, 178 flow [2025-04-13 21:34:15,659 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 24353 states, 24208 states have (on average 4.728726040978189) internal successors, (114473), 24352 states have internal predecessors, (114473), 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-04-13 21:34:15,660 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:34:15,661 INFO L340 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=FINITE_AUTOMATA, 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;@11da5120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:34:15,661 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-13 21:34:15,748 INFO L278 IsEmpty]: Start isEmpty. Operand has 24353 states, 24208 states have (on average 4.728726040978189) internal successors, (114473), 24352 states have internal predecessors, (114473), 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-04-13 21:34:15,752 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:34:15,752 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:34:15,752 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2025-04-13 21:34:15,753 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 9 more)] === [2025-04-13 21:34:15,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:34:15,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2085706843, now seen corresponding path program 1 times [2025-04-13 21:34:15,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:34:15,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434281506] [2025-04-13 21:34:15,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:34:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:34:15,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:34:15,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:34:15,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:15,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:15,781 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:34:15,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:34:15,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:34:15,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:15,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:34:15,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:34:15,799 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:34:15,799 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-04-13 21:34:15,799 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (11 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (10 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (9 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (7 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONERROR_FUNCTION (1 of 13 remaining) [2025-04-13 21:34:15,800 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 13 remaining) [2025-04-13 21:34:15,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:34:15,803 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-04-13 21:34:15,803 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 21:34:15,803 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-13 21:34:15,869 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:34:15,872 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 105 transitions, 238 flow [2025-04-13 21:34:28,414 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 438424 states, 437832 states have (on average 6.042372416817409) internal successors, (2645544), 438423 states have internal predecessors, (2645544), 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-04-13 21:34:28,419 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:34:28,420 INFO L340 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=FINITE_AUTOMATA, 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;@11da5120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:34:28,420 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-04-13 21:34:29,458 INFO L278 IsEmpty]: Start isEmpty. Operand has 438424 states, 437832 states have (on average 6.042372416817409) internal successors, (2645544), 438423 states have internal predecessors, (2645544), 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-04-13 21:34:29,459 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-13 21:34:29,459 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:34:29,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:34:29,459 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-04-13 21:34:29,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:34:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -685764378, now seen corresponding path program 1 times [2025-04-13 21:34:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:34:29,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767148348] [2025-04-13 21:34:29,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:34:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:34:29,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 21:34:29,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 21:34:29,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:34:29,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:34:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:34:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:34:29,572 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767148348] [2025-04-13 21:34:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767148348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:34:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:34:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:34:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759689682] [2025-04-13 21:34:29,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:34:29,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:34:29,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:34:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:34:29,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:34:30,435 INFO L87 Difference]: Start difference. First operand has 438424 states, 437832 states have (on average 6.042372416817409) internal successors, (2645544), 438423 states have internal predecessors, (2645544), 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) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-13 21:34:45,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:34:45,465 INFO L93 Difference]: Finished difference Result 662124 states and 4036544 transitions. [2025-04-13 21:34:45,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:34:45,468 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2025-04-13 21:34:45,469 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:34:50,938 INFO L225 Difference]: With dead ends: 662124 [2025-04-13 21:34:50,940 INFO L226 Difference]: Without dead ends: 237158 [2025-04-13 21:34:52,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:34:52,446 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:34:52,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 18 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:34:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237158 states. [2025-04-13 21:35:03,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237158 to 237158. [2025-04-13 21:35:03,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237158 states, 236983 states have (on average 5.211209242857082) internal successors, (1234968), 237157 states have internal predecessors, (1234968), 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-04-13 21:35:06,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237158 states to 237158 states and 1234968 transitions. [2025-04-13 21:35:07,230 INFO L79 Accepts]: Start accepts. Automaton has 237158 states and 1234968 transitions. Word has length 8 [2025-04-13 21:35:07,230 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:35:07,231 INFO L485 AbstractCegarLoop]: Abstraction has 237158 states and 1234968 transitions. [2025-04-13 21:35:07,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-13 21:35:07,231 INFO L278 IsEmpty]: Start isEmpty. Operand 237158 states and 1234968 transitions. [2025-04-13 21:35:07,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 21:35:07,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:35:07,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:35:07,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:35:07,232 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err2ASSERT_VIOLATIONERROR_FUNCTION, thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-04-13 21:35:07,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:35:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 215187051, now seen corresponding path program 1 times [2025-04-13 21:35:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:35:07,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484765594] [2025-04-13 21:35:07,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:35:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:35:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 21:35:07,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 21:35:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:35:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:35:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:35:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:35:07,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484765594] [2025-04-13 21:35:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484765594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:35:07,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:35:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:35:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726129804] [2025-04-13 21:35:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:35:07,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:35:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:35:07,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:35:07,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:35:07,343 INFO L87 Difference]: Start difference. First operand 237158 states and 1234968 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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)