/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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:50:58,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:50:59,003 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:50:59,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:50:59,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:50:59,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:50:59,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:50:59,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:50:59,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:50:59,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:50:59,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:50:59,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:50:59,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:50:59,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:50:59,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:50:59,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:59,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:50:59,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:50:59,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:50:59,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:50:59,035 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:50:59,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:50:59,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:50:59,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:50:59,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:50:59,290 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:50:59,290 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2025-04-13 21:51:00,687 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2a3b67/68637f1f43904d2f94c770c23545ce08/FLAG56a3ef2cb [2025-04-13 21:51:01,028 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:51:01,028 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2025-04-13 21:51:01,059 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2a3b67/68637f1f43904d2f94c770c23545ce08/FLAG56a3ef2cb [2025-04-13 21:51:01,737 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2aa2a3b67/68637f1f43904d2f94c770c23545ce08 [2025-04-13 21:51:01,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:51:01,740 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:51:01,741 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:01,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:51:01,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:51:01,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:01" (1/1) ... [2025-04-13 21:51:01,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408867c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:01, skipping insertion in model container [2025-04-13 21:51:01,746 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:51:01" (1/1) ... [2025-04-13 21:51:01,782 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:51:02,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2025-04-13 21:51:02,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:02,222 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:51:02,288 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2025-04-13 21:51:02,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:51:02,340 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:51:02,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02 WrapperNode [2025-04-13 21:51:02,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:51:02,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:02,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:51:02,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:51:02,348 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:51:02" (1/1) ... [2025-04-13 21:51:02,374 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:51:02" (1/1) ... [2025-04-13 21:51:02,403 INFO L138 Inliner]: procedures = 246, calls = 43, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 127 [2025-04-13 21:51:02,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:51:02,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:51:02,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:51:02,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:51:02,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,440 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 2, 13]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6]. [2025-04-13 21:51:02,441 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:51:02,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:51:02,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:51:02,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:51:02,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (1/1) ... [2025-04-13 21:51:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:51:02,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:51:02,516 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:51:02,521 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:51:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-13 21:51:02,536 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:51:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:51:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:51:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:51:02,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:51:02,538 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:51:02,779 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:51:02,780 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:51:02,987 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:51:02,988 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:51:02,988 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:51:03,209 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:51:03,235 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:51:03,269 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:51:03,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:03 BoogieIcfgContainer [2025-04-13 21:51:03,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:51:03,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:51:03,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:51:03,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:51:03,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:51:01" (1/3) ... [2025-04-13 21:51:03,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:03, skipping insertion in model container [2025-04-13 21:51:03,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:51:02" (2/3) ... [2025-04-13 21:51:03,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215629f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:51:03, skipping insertion in model container [2025-04-13 21:51:03,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:51:03" (3/3) ... [2025-04-13 21:51:03,279 INFO L128 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2025-04-13 21:51:03,290 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:51:03,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-3_2-container_of-global.i that has 2 procedures, 22 locations, 27 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-13 21:51:03,292 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:51:03,349 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:51:03,375 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 34 transitions, 82 flow [2025-04-13 21:51:03,405 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 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:51:03,428 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:51:03,436 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;@302a8214, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:51:03,436 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-13 21:51:03,441 INFO L278 IsEmpty]: Start isEmpty. Operand has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 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:51:03,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2025-04-13 21:51:03,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:03,445 INFO L218 NwaCegarLoop]: trace histogram [1] [2025-04-13 21:51:03,446 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:03,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 389, now seen corresponding path program 1 times [2025-04-13 21:51:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:03,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152464679] [2025-04-13 21:51:03,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 21:51:03,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 21:51:03,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:03,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:03,915 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:51:03,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:03,916 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152464679] [2025-04-13 21:51:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152464679] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:03,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 21:51:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896597927] [2025-04-13 21:51:03,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:03,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:51:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:03,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:51:03,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:03,937 INFO L87 Difference]: Start difference. First operand has 214 states, 204 states have (on average 2.450980392156863) internal successors, (500), 213 states have internal predecessors, (500), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:51:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:04,022 INFO L93 Difference]: Finished difference Result 214 states and 500 transitions. [2025-04-13 21:51:04,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:51:04,023 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2025-04-13 21:51:04,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:04,031 INFO L225 Difference]: With dead ends: 214 [2025-04-13 21:51:04,032 INFO L226 Difference]: Without dead ends: 101 [2025-04-13 21:51:04,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:51:04,038 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:04,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-13 21:51:04,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-13 21:51:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 2.0707070707070705) internal successors, (205), 100 states have internal predecessors, (205), 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:51:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 205 transitions. [2025-04-13 21:51:04,075 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 205 transitions. Word has length 1 [2025-04-13 21:51:04,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:04,076 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 205 transitions. [2025-04-13 21:51:04,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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:51:04,076 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 205 transitions. [2025-04-13 21:51:04,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:04,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:04,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:04,079 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:51:04,079 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:04,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1765587717, now seen corresponding path program 1 times [2025-04-13 21:51:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:04,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969243575] [2025-04-13 21:51:04,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:04,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:04,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:04,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:04,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:04,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:04,772 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:51:04,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:04,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969243575] [2025-04-13 21:51:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969243575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:51:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818421412] [2025-04-13 21:51:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:04,773 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:51:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:51:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:51:04,777 INFO L87 Difference]: Start difference. First operand 101 states and 205 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:51:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:04,932 INFO L93 Difference]: Finished difference Result 127 states and 250 transitions. [2025-04-13 21:51:04,932 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:51:04,933 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2025-04-13 21:51:04,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:04,934 INFO L225 Difference]: With dead ends: 127 [2025-04-13 21:51:04,934 INFO L226 Difference]: Without dead ends: 126 [2025-04-13 21:51:04,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 21:51:04,935 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:04,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-04-13 21:51:04,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-04-13 21:51:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 124 states have (on average 2.0080645161290325) internal successors, (249), 125 states have internal predecessors, (249), 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:51:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 249 transitions. [2025-04-13 21:51:04,949 INFO L79 Accepts]: Start accepts. Automaton has 126 states and 249 transitions. Word has length 19 [2025-04-13 21:51:04,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:04,949 INFO L485 AbstractCegarLoop]: Abstraction has 126 states and 249 transitions. [2025-04-13 21:51:04,950 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:51:04,950 INFO L278 IsEmpty]: Start isEmpty. Operand 126 states and 249 transitions. [2025-04-13 21:51:04,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:04,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:04,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:04,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:51:04,953 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:04,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:04,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2042841402, now seen corresponding path program 1 times [2025-04-13 21:51:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:04,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294781948] [2025-04-13 21:51:04,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:51:04,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:04,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:05,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:05,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:05,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:06,179 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:51:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:06,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294781948] [2025-04-13 21:51:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294781948] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 21:51:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90836272] [2025-04-13 21:51:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:06,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 21:51:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 21:51:06,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-04-13 21:51:06,180 INFO L87 Difference]: Start difference. First operand 126 states and 249 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:51:06,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:06,556 INFO L93 Difference]: Finished difference Result 174 states and 339 transitions. [2025-04-13 21:51:06,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:51:06,557 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 19 [2025-04-13 21:51:06,557 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:06,558 INFO L225 Difference]: With dead ends: 174 [2025-04-13 21:51:06,559 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 21:51:06,559 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-04-13 21:51:06,559 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:06,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:51:06,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 21:51:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 116. [2025-04-13 21:51:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.9912280701754386) internal successors, (227), 115 states have internal predecessors, (227), 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:51:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 227 transitions. [2025-04-13 21:51:06,566 INFO L79 Accepts]: Start accepts. Automaton has 116 states and 227 transitions. Word has length 19 [2025-04-13 21:51:06,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:06,567 INFO L485 AbstractCegarLoop]: Abstraction has 116 states and 227 transitions. [2025-04-13 21:51:06,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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:51:06,567 INFO L278 IsEmpty]: Start isEmpty. Operand 116 states and 227 transitions. [2025-04-13 21:51:06,567 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:06,567 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:06,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:06,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:51:06,568 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:06,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash 583800743, now seen corresponding path program 2 times [2025-04-13 21:51:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:06,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303736845] [2025-04-13 21:51:06,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:06,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:06,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:06,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:06,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:06,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:51:07,114 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:51:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:51:07,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303736845] [2025-04-13 21:51:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303736845] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:51:07,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:51:07,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 21:51:07,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962847287] [2025-04-13 21:51:07,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:51:07,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 21:51:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:51:07,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 21:51:07,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:51:07,116 INFO L87 Difference]: Start difference. First operand 116 states and 227 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:51:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:51:07,222 INFO L93 Difference]: Finished difference Result 215 states and 411 transitions. [2025-04-13 21:51:07,222 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:51:07,222 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 19 [2025-04-13 21:51:07,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:51:07,224 INFO L225 Difference]: With dead ends: 215 [2025-04-13 21:51:07,224 INFO L226 Difference]: Without dead ends: 214 [2025-04-13 21:51:07,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-04-13 21:51:07,224 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:51:07,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:51:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-04-13 21:51:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 136. [2025-04-13 21:51:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 2.037313432835821) internal successors, (273), 135 states have internal predecessors, (273), 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:51:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 273 transitions. [2025-04-13 21:51:07,231 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 273 transitions. Word has length 19 [2025-04-13 21:51:07,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:51:07,231 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 273 transitions. [2025-04-13 21:51:07,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:51:07,231 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 273 transitions. [2025-04-13 21:51:07,232 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 21:51:07,232 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:51:07,232 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:51:07,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:51:07,232 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-13 21:51:07,232 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:51:07,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1070338920, now seen corresponding path program 2 times [2025-04-13 21:51:07,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:51:07,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132101462] [2025-04-13 21:51:07,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:51:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:51:07,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:07,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:07,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:51:07,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:07,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 21:51:07,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 21:51:07,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 21:51:07,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:51:07,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 21:51:07,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 21:51:07,318 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 21:51:07,319 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-13 21:51:07,321 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-13 21:51:07,321 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:51:07,323 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2025-04-13 21:51:07,384 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:51:07,385 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:51:07,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:51:07 BasicIcfg [2025-04-13 21:51:07,387 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:51:07,387 INFO L158 Benchmark]: Toolchain (without parser) took 5647.27ms. Allocated memory was 142.6MB in the beginning and 297.8MB in the end (delta: 155.2MB). Free memory was 94.8MB in the beginning and 249.5MB in the end (delta: -154.6MB). Peak memory consumption was 171.8MB. Max. memory is 8.0GB. [2025-04-13 21:51:07,388 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:51:07,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 599.88ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 61.5MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 21:51:07,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.33ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 58.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:51:07,388 INFO L158 Benchmark]: Boogie Preprocessor took 62.51ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 54.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:51:07,388 INFO L158 Benchmark]: IcfgBuilder took 802.37ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 57.0MB in the end (delta: -2.2MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2025-04-13 21:51:07,389 INFO L158 Benchmark]: TraceAbstraction took 4116.38ms. Allocated memory was 142.6MB in the beginning and 297.8MB in the end (delta: 155.2MB). Free memory was 57.0MB in the beginning and 249.5MB in the end (delta: -192.4MB). Peak memory consumption was 133.7MB. Max. memory is 8.0GB. [2025-04-13 21:51:07,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 599.88ms. Allocated memory is still 142.6MB. Free memory was 94.8MB in the beginning and 61.5MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.33ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 58.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 62.51ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 54.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 802.37ms. Allocated memory is still 142.6MB. Free memory was 54.9MB in the beginning and 57.0MB in the end (delta: -2.2MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * TraceAbstraction took 4116.38ms. Allocated memory was 142.6MB in the beginning and 297.8MB in the end (delta: 155.2MB). Free memory was 57.0MB in the beginning and 249.5MB in the end (delta: -192.4MB). Peak memory consumption was 133.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3901] 0 struct device *my_dev; [L3953] CALL, EXPR 0 my_drv_init() [L3947] 0 return 0; [L3953] RET, EXPR 0 my_drv_init() [L3953] 0 int ret = my_drv_init(); [L3954] COND TRUE 0 ret==0 [L3955] 0 int probe_ret; [L3956] 0 struct my_data data; [L3957] CALL, EXPR 0 my_drv_probe(&data) [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] EXPR 0 data->shared.a [L3925] CALL 0 ldv_assert(data->shared.a==0) [L3887] COND FALSE 0 !(!expression) [L3925] RET 0 ldv_assert(data->shared.a==0) [L3926] EXPR 0 data->shared.b [L3926] CALL 0 ldv_assert(data->shared.b==0) [L3887] COND FALSE 0 !(!expression) [L3926] RET 0 ldv_assert(data->shared.b==0) [L3927] 0 int res = __VERIFIER_nondet_int(); [L3928] COND FALSE 0 !(\read(res)) [L3931] 0 my_dev = &data->dev [L3933] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(data, Pre)={5:0}, data={5:0}, my_dev={5:24}, res=0, t1=-1, t2=0] [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 1 data->shared.a = 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={5:0}, my_dev={5:24}, t1=-1, t2=0] [L3911] EXPR 1 data->shared.b [L3911] 1 int lb = data->shared.b; [L3934] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(data, Pre)={5:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, res=0, t1=-1, t2=0] [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3908] 2 data->shared.a = 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3911] EXPR 2 data->shared.b [L3911] 2 int lb = data->shared.b; [L3914] 2 data->shared.b = lb + 1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3917] 2 return 0; [L3935] 0 return 0; [L3957] RET, EXPR 0 my_drv_probe(&data) [L3957] 0 probe_ret = my_drv_probe(&data) [L3958] COND TRUE 0 probe_ret==0 [L3959] CALL 0 my_drv_disconnect(&data) [L3941] 0 void *status; VAL [\at(arg, Pre)={0:0}, \at(data, Pre)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3914] 1 data->shared.b = lb + 1 VAL [\at(arg, Pre)={0:0}, \result={0:0}, arg={0:0}, data={5:0}, lb=0, my_dev={5:24}, t1=-1, t2=0] [L3917] 1 return 0; [L3942] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\at(arg, Pre)={0:0}, \at(data, Pre)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3943] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\at(arg, Pre)={0:0}, \at(data, Pre)={5:0}, \result={0:0}, arg={0:0}, data={5:0}, data={5:0}, lb=0, my_dev={5:24}, status={3:0}, t1=-1, t2=0] [L3959] RET 0 my_drv_disconnect(&data) [L3960] EXPR 0 data.shared.a [L3960] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND FALSE 0 !(!expression) [L3960] RET 0 ldv_assert(data.shared.a==1) [L3961] EXPR 0 data.shared.b [L3961] CALL 0 ldv_assert(data.shared.b==2) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, arg={0:0}, data={5:0}, expression=0, lb=0, my_dev={5:24}, t1=-1, t2=0] - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3887]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 3934]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3933]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 36 locations, 43 edges, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 199 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 199 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 0 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 94 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 21:51:07,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...