/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-wmm/safe012_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:48:46,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:48:46,650 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:48:46,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:48:46,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:48:46,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:48:46,674 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:48:46,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:48:46,674 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:48:46,674 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:48:46,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:48:46,675 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:48:46,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:48:46,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:48:46,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:48:46,676 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:48:46,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:48:46,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:48:46,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:48:46,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:48:46,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:48:46,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:48:46,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:48:46,677 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:48:46,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:48:46,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:48:46,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:48:46,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:48:46,930 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:48:46,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2025-04-13 21:48:48,249 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121069a1c/fda39bde97a846f29994ccf57b393473/FLAGcfdb147fc [2025-04-13 21:48:48,451 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:48:48,452 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_tso.i [2025-04-13 21:48:48,461 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121069a1c/fda39bde97a846f29994ccf57b393473/FLAGcfdb147fc [2025-04-13 21:48:49,450 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/121069a1c/fda39bde97a846f29994ccf57b393473 [2025-04-13 21:48:49,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:48:49,453 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:48:49,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:48:49,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:48:49,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:48:49,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d0ee1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49, skipping insertion in model container [2025-04-13 21:48:49,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:48:49,653 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-wmm/safe012_tso.i[945,958] [2025-04-13 21:48:49,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:48:49,840 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:48:49,858 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-wmm/safe012_tso.i[945,958] [2025-04-13 21:48:49,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:48:49,909 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:48:49,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49 WrapperNode [2025-04-13 21:48:49,910 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:48:49,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:48:49,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:48:49,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:48:49,915 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:48:49" (1/1) ... [2025-04-13 21:48:49,923 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:48:49" (1/1) ... [2025-04-13 21:48:49,936 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-04-13 21:48:49,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:48:49,937 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:48:49,937 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:48:49,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:48:49,941 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,951 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:48:49,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,954 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:48:49,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:48:49,963 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:48:49,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:48:49,964 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (1/1) ... [2025-04-13 21:48:49,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:48:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:48:49,987 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:48:49,989 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:48:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:48:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:48:50,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 21:48:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 21:48:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 21:48:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 21:48:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 21:48:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 21:48:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:48:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:48:50,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:48:50,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:48:50,007 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:48:50,113 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:48:50,114 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:48:50,250 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:48:50,251 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:48:50,251 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:48:50,344 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:48:50,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:48:50 BoogieIcfgContainer [2025-04-13 21:48:50,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:48:50,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:48:50,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:48:50,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:48:50,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:48:49" (1/3) ... [2025-04-13 21:48:50,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc57e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:48:50, skipping insertion in model container [2025-04-13 21:48:50,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:48:49" (2/3) ... [2025-04-13 21:48:50,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc57e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:48:50, skipping insertion in model container [2025-04-13 21:48:50,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:48:50" (3/3) ... [2025-04-13 21:48:50,351 INFO L128 eAbstractionObserver]: Analyzing ICFG safe012_tso.i [2025-04-13 21:48:50,361 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:48:50,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe012_tso.i that has 4 procedures, 35 locations, 31 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 21:48:50,362 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:48:50,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:48:50,428 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 34 transitions, 80 flow [2025-04-13 21:48:50,582 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 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:48:50,602 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:48:50,612 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;@55472cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:48:50,613 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 21:48:50,620 INFO L278 IsEmpty]: Start isEmpty. Operand has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 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:48:50,631 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:48:50,631 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:50,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:50,632 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:50,636 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:50,637 INFO L85 PathProgramCache]: Analyzing trace with hash -731830853, now seen corresponding path program 1 times [2025-04-13 21:48:50,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:50,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570740650] [2025-04-13 21:48:50,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:48:50,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:50,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:48:50,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:48:50,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:48:50,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:50,941 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:48:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:50,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570740650] [2025-04-13 21:48:50,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570740650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:50,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:50,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:48:50,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958182178] [2025-04-13 21:48:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:50,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:48:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:50,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:48:50,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 21:48:50,969 INFO L87 Difference]: Start difference. First operand has 2515 states, 2514 states have (on average 3.3914081145584727) internal successors, (8526), 2514 states have internal predecessors, (8526), 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 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:48:51,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:51,146 INFO L93 Difference]: Finished difference Result 3605 states and 11933 transitions. [2025-04-13 21:48:51,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:48:51,148 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-04-13 21:48:51,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:51,169 INFO L225 Difference]: With dead ends: 3605 [2025-04-13 21:48:51,169 INFO L226 Difference]: Without dead ends: 1890 [2025-04-13 21:48:51,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:48:51,180 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 57 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:51,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 9 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:48:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2025-04-13 21:48:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2025-04-13 21:48:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1889 states have (on average 3.1900476442562202) internal successors, (6026), 1889 states have internal predecessors, (6026), 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:48:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 6026 transitions. [2025-04-13 21:48:51,324 INFO L79 Accepts]: Start accepts. Automaton has 1890 states and 6026 transitions. Word has length 12 [2025-04-13 21:48:51,325 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:51,325 INFO L485 AbstractCegarLoop]: Abstraction has 1890 states and 6026 transitions. [2025-04-13 21:48:51,326 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:48:51,326 INFO L278 IsEmpty]: Start isEmpty. Operand 1890 states and 6026 transitions. [2025-04-13 21:48:51,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 21:48:51,333 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:51,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:51,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:48:51,334 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:51,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:51,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1720886005, now seen corresponding path program 1 times [2025-04-13 21:48:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:51,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911510027] [2025-04-13 21:48:51,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:48:51,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 21:48:51,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 21:48:51,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:48:51,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:51,467 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:48:51,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:51,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911510027] [2025-04-13 21:48:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911510027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:51,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:51,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:48:51,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924277481] [2025-04-13 21:48:51,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:51,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:48:51,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:51,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:48:51,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:48:51,469 INFO L87 Difference]: Start difference. First operand 1890 states and 6026 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:48:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:51,608 INFO L93 Difference]: Finished difference Result 2230 states and 6958 transitions. [2025-04-13 21:48:51,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:48:51,609 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-04-13 21:48:51,609 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:51,617 INFO L225 Difference]: With dead ends: 2230 [2025-04-13 21:48:51,617 INFO L226 Difference]: Without dead ends: 1140 [2025-04-13 21:48:51,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:48:51,620 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 94 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:51,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 12 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:48:51,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-04-13 21:48:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1140. [2025-04-13 21:48:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 1139 states have (on average 2.9859525899912205) internal successors, (3401), 1139 states have internal predecessors, (3401), 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:48:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 3401 transitions. [2025-04-13 21:48:51,671 INFO L79 Accepts]: Start accepts. Automaton has 1140 states and 3401 transitions. Word has length 17 [2025-04-13 21:48:51,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:51,671 INFO L485 AbstractCegarLoop]: Abstraction has 1140 states and 3401 transitions. [2025-04-13 21:48:51,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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:48:51,672 INFO L278 IsEmpty]: Start isEmpty. Operand 1140 states and 3401 transitions. [2025-04-13 21:48:51,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 21:48:51,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:51,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:51,674 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:48:51,674 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:51,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:51,675 INFO L85 PathProgramCache]: Analyzing trace with hash 551064221, now seen corresponding path program 1 times [2025-04-13 21:48:51,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:51,675 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224077554] [2025-04-13 21:48:51,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:48:51,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:51,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 21:48:51,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 21:48:51,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:48:51,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:51,839 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:48:51,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:51,839 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224077554] [2025-04-13 21:48:51,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224077554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:51,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:51,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 21:48:51,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168455787] [2025-04-13 21:48:51,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:51,839 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 21:48:51,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:51,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 21:48:51,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 21:48:51,840 INFO L87 Difference]: Start difference. First operand 1140 states and 3401 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:48:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:51,950 INFO L93 Difference]: Finished difference Result 1180 states and 3493 transitions. [2025-04-13 21:48:51,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:48:51,951 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2025-04-13 21:48:51,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:51,957 INFO L225 Difference]: With dead ends: 1180 [2025-04-13 21:48:51,957 INFO L226 Difference]: Without dead ends: 840 [2025-04-13 21:48:51,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-04-13 21:48:51,959 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 129 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:51,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 9 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:48:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2025-04-13 21:48:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2025-04-13 21:48:51,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 839 states have (on average 2.9809296781883194) internal successors, (2501), 839 states have internal predecessors, (2501), 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:48:51,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2501 transitions. [2025-04-13 21:48:51,979 INFO L79 Accepts]: Start accepts. Automaton has 840 states and 2501 transitions. Word has length 22 [2025-04-13 21:48:51,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:51,980 INFO L485 AbstractCegarLoop]: Abstraction has 840 states and 2501 transitions. [2025-04-13 21:48:51,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:48:51,980 INFO L278 IsEmpty]: Start isEmpty. Operand 840 states and 2501 transitions. [2025-04-13 21:48:51,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 21:48:51,982 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:51,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:51,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:48:51,982 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:51,982 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:51,982 INFO L85 PathProgramCache]: Analyzing trace with hash -158447243, now seen corresponding path program 1 times [2025-04-13 21:48:51,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:51,982 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087235023] [2025-04-13 21:48:51,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:48:51,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:51,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 21:48:51,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:48:51,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:48:51,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:52,119 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:48:52,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:52,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087235023] [2025-04-13 21:48:52,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087235023] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:52,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:52,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:48:52,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135183747] [2025-04-13 21:48:52,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:52,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:48:52,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:52,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:48:52,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:48:52,120 INFO L87 Difference]: Start difference. First operand 840 states and 2501 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:52,216 INFO L93 Difference]: Finished difference Result 1160 states and 3415 transitions. [2025-04-13 21:48:52,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:48:52,216 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 21:48:52,216 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:52,220 INFO L225 Difference]: With dead ends: 1160 [2025-04-13 21:48:52,220 INFO L226 Difference]: Without dead ends: 550 [2025-04-13 21:48:52,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:48:52,222 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:52,222 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 9 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:48:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-04-13 21:48:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-04-13 21:48:52,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 2.8706739526411655) internal successors, (1576), 549 states have internal predecessors, (1576), 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:48:52,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1576 transitions. [2025-04-13 21:48:52,233 INFO L79 Accepts]: Start accepts. Automaton has 550 states and 1576 transitions. Word has length 27 [2025-04-13 21:48:52,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:52,233 INFO L485 AbstractCegarLoop]: Abstraction has 550 states and 1576 transitions. [2025-04-13 21:48:52,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,233 INFO L278 IsEmpty]: Start isEmpty. Operand 550 states and 1576 transitions. [2025-04-13 21:48:52,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 21:48:52,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:52,234 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:52,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:48:52,234 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:52,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -635948049, now seen corresponding path program 2 times [2025-04-13 21:48:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:52,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909029208] [2025-04-13 21:48:52,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:48:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:52,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-13 21:48:52,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:48:52,245 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:48:52,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:52,361 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:48:52,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:52,361 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909029208] [2025-04-13 21:48:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909029208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:52,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:52,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 21:48:52,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433023467] [2025-04-13 21:48:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:52,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:48:52,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:52,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:48:52,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:48:52,362 INFO L87 Difference]: Start difference. First operand 550 states and 1576 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:52,467 INFO L93 Difference]: Finished difference Result 750 states and 2124 transitions. [2025-04-13 21:48:52,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:48:52,467 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 21:48:52,467 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:52,470 INFO L225 Difference]: With dead ends: 750 [2025-04-13 21:48:52,470 INFO L226 Difference]: Without dead ends: 350 [2025-04-13 21:48:52,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:48:52,471 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 43 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:52,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 16 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:48:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-13 21:48:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-04-13 21:48:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 2.7392550143266474) internal successors, (956), 349 states have internal predecessors, (956), 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:48:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 956 transitions. [2025-04-13 21:48:52,479 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 956 transitions. Word has length 27 [2025-04-13 21:48:52,480 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:52,480 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 956 transitions. [2025-04-13 21:48:52,480 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,480 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 956 transitions. [2025-04-13 21:48:52,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 21:48:52,481 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:48:52,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:48:52,481 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 21:48:52,481 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 21:48:52,481 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:48:52,481 INFO L85 PathProgramCache]: Analyzing trace with hash -902888337, now seen corresponding path program 3 times [2025-04-13 21:48:52,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:48:52,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384099244] [2025-04-13 21:48:52,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:48:52,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:48:52,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-04-13 21:48:52,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 21:48:52,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 21:48:52,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:48:52,570 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:48:52,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:48:52,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384099244] [2025-04-13 21:48:52,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384099244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:48:52,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:48:52,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:48:52,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637207870] [2025-04-13 21:48:52,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:48:52,570 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:48:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:48:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:48:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:48:52,571 INFO L87 Difference]: Start difference. First operand 350 states and 956 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:48:52,622 INFO L93 Difference]: Finished difference Result 350 states and 956 transitions. [2025-04-13 21:48:52,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:48:52,622 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 21:48:52,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:48:52,624 INFO L225 Difference]: With dead ends: 350 [2025-04-13 21:48:52,624 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 21:48:52,625 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:48:52,625 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 30 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:48:52,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 21:48:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 21:48:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 21:48:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:48:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 21:48:52,627 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2025-04-13 21:48:52,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:48:52,627 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 21:48:52,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:48:52,627 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 21:48:52,627 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 21:48:52,629 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 21:48:52,630 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 21:48:52,630 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 21:48:52,630 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 21:48:52,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 21:48:52,632 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-13 21:48:52,633 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:48:52,633 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:48:52,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:48:52 BasicIcfg [2025-04-13 21:48:52,635 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:48:52,635 INFO L158 Benchmark]: Toolchain (without parser) took 3182.37ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 44.8MB in the end (delta: 63.9MB). Peak memory consumption was 63.1MB. Max. memory is 8.0GB. [2025-04-13 21:48:52,635 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:48:52,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.17ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 85.6MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:48:52,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:48:52,636 INFO L158 Benchmark]: Boogie Preprocessor took 26.11ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:48:52,636 INFO L158 Benchmark]: IcfgBuilder took 381.14ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 58.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:48:52,636 INFO L158 Benchmark]: TraceAbstraction took 2289.17ms. Allocated memory is still 155.2MB. Free memory was 57.7MB in the beginning and 44.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2025-04-13 21:48:52,637 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.25ms. Allocated memory is still 159.4MB. Free memory is still 85.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 456.17ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 85.6MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.11ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 381.14ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 58.2MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2289.17ms. Allocated memory is still 155.2MB. Free memory was 57.7MB in the beginning and 44.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.8MB. 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 - PositiveResult [Line: 18]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 59 locations, 55 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 383 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 383 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 562 IncrementalHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 20 mSDtfsCounter, 562 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2515occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 432 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 21:48:52,649 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...