/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-theta/unwind1-100.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:31:23,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:31:23,407 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 23:31:23,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:31:23,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:31:23,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:31:23,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:31:23,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:31:23,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:31:23,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:31:23,435 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:31:23,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:31:23,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:31:23,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:31:23,436 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:31:23,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:31:23,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:31:23,437 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:23,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:31:23,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:23,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:31:23,438 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:31:23,438 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 23:31:23,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:31:23,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:31:23,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:31:23,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:31:23,670 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:31:23,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind1-100.i [2025-04-13 23:31:24,995 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f76a080b/4248bdcae83c494c9e905b261d8640e5/FLAG0124f3767 [2025-04-13 23:31:25,263 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:31:25,263 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind1-100.i [2025-04-13 23:31:25,272 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f76a080b/4248bdcae83c494c9e905b261d8640e5/FLAG0124f3767 [2025-04-13 23:31:26,046 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f76a080b/4248bdcae83c494c9e905b261d8640e5 [2025-04-13 23:31:26,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:31:26,049 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:31:26,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:31:26,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:31:26,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:31:26,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11522e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26, skipping insertion in model container [2025-04-13 23:31:26,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:31:26,368 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-theta/unwind1-100.i[33026,33039] [2025-04-13 23:31:26,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:31:26,387 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:31:26,431 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-theta/unwind1-100.i[33026,33039] [2025-04-13 23:31:26,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:31:26,457 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:31:26,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26 WrapperNode [2025-04-13 23:31:26,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:31:26,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:31:26,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:31:26,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:31:26,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,481 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2025-04-13 23:31:26,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:31:26,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:31:26,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:31:26,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:31:26,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,495 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 23:31:26,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:31:26,502 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:31:26,502 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:31:26,502 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:31:26,502 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (1/1) ... [2025-04-13 23:31:26,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:31:26,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:26,535 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 23:31:26,537 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 23:31:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:31:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-13 23:31:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-13 23:31:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-13 23:31:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-13 23:31:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:31:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:31:26,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:31:26,555 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 23:31:26,647 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:31:26,648 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:31:26,770 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:31:26,771 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:31:26,771 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:31:26,863 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:31:26,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:31:26 BoogieIcfgContainer [2025-04-13 23:31:26,863 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:31:26,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:31:26,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:31:26,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:31:26,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:31:26" (1/3) ... [2025-04-13 23:31:26,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579c915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:31:26, skipping insertion in model container [2025-04-13 23:31:26,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:31:26" (2/3) ... [2025-04-13 23:31:26,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7579c915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:31:26, skipping insertion in model container [2025-04-13 23:31:26,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:31:26" (3/3) ... [2025-04-13 23:31:26,872 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2025-04-13 23:31:26,882 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:31:26,883 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 18 locations, 17 edges, 1 initial locations, 1 loop locations, and 1 error locations. [2025-04-13 23:31:26,883 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:31:26,913 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:31:26,936 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 19 transitions, 52 flow [2025-04-13 23:31:26,947 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 44 states have internal predecessors, (103), 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 23:31:26,964 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:31:26,972 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;@60fc4de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:31:26,972 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:31:26,974 INFO L278 IsEmpty]: Start isEmpty. Operand has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 44 states have internal predecessors, (103), 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 23:31:26,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 23:31:26,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:26,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 23:31:26,978 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:26,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash 641203627, now seen corresponding path program 1 times [2025-04-13 23:31:26,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:26,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623109361] [2025-04-13 23:31:26,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:27,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 23:31:27,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 23:31:27,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:27,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:27,250 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 23:31:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:27,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623109361] [2025-04-13 23:31:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623109361] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:31:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332046181] [2025-04-13 23:31:27,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:27,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:31:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:27,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:31:27,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:27,269 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 2.340909090909091) internal successors, (103), 44 states have internal predecessors, (103), 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, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:31:27,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:27,325 INFO L93 Difference]: Finished difference Result 67 states and 157 transitions. [2025-04-13 23:31:27,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:31:27,326 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-04-13 23:31:27,326 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:27,331 INFO L225 Difference]: With dead ends: 67 [2025-04-13 23:31:27,331 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 23:31:27,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 23:31:27,334 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 18 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:27,335 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 0 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 23:31:27,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-13 23:31:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 2.3636363636363638) internal successors, (130), 55 states have internal predecessors, (130), 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 23:31:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 130 transitions. [2025-04-13 23:31:27,362 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 130 transitions. Word has length 6 [2025-04-13 23:31:27,363 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:27,363 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 130 transitions. [2025-04-13 23:31:27,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:31:27,363 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 130 transitions. [2025-04-13 23:31:27,363 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 23:31:27,363 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:27,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:27,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:31:27,364 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:27,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1597523916, now seen corresponding path program 1 times [2025-04-13 23:31:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:27,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381006187] [2025-04-13 23:31:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:27,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 23:31:27,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 23:31:27,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:27,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:27,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381006187] [2025-04-13 23:31:27,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381006187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:31:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:31:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:31:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967382335] [2025-04-13 23:31:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:31:27,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:31:27,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:27,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:31:27,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:31:27,452 INFO L87 Difference]: Start difference. First operand 56 states and 130 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 23:31:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:27,521 INFO L93 Difference]: Finished difference Result 71 states and 160 transitions. [2025-04-13 23:31:27,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:31:27,521 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-04-13 23:31:27,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:27,522 INFO L225 Difference]: With dead ends: 71 [2025-04-13 23:31:27,522 INFO L226 Difference]: Without dead ends: 38 [2025-04-13 23:31:27,522 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 23:31:27,523 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:27,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-04-13 23:31:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-04-13 23:31:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 states have internal predecessors, (73), 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 23:31:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 73 transitions. [2025-04-13 23:31:27,528 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 73 transitions. Word has length 7 [2025-04-13 23:31:27,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:27,528 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 73 transitions. [2025-04-13 23:31:27,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 23:31:27,528 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 73 transitions. [2025-04-13 23:31:27,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 23:31:27,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:27,528 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:27,528 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:31:27,528 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:27,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:27,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1921892270, now seen corresponding path program 1 times [2025-04-13 23:31:27,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:27,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977001531] [2025-04-13 23:31:27,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:27,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:27,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:27,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:27,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:27,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:27,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:27,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977001531] [2025-04-13 23:31:27,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977001531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:27,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575033363] [2025-04-13 23:31:27,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:27,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:27,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:27,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:27,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 23:31:27,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:31:27,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:31:27,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:27,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:27,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:31:27,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:27,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:27,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575033363] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:27,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:27,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2025-04-13 23:31:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225785051] [2025-04-13 23:31:27,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:27,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:31:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:27,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:31:27,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:31:27,789 INFO L87 Difference]: Start difference. First operand 38 states and 73 transitions. Second operand has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 23:31:27,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:27,918 INFO L93 Difference]: Finished difference Result 58 states and 123 transitions. [2025-04-13 23:31:27,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:31:27,919 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 9 [2025-04-13 23:31:27,919 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:27,919 INFO L225 Difference]: With dead ends: 58 [2025-04-13 23:31:27,919 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 23:31:27,919 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:31:27,920 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:27,920 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 23:31:27,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-04-13 23:31:27,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 52 states have internal predecessors, (103), 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 23:31:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 103 transitions. [2025-04-13 23:31:27,931 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 103 transitions. Word has length 9 [2025-04-13 23:31:27,931 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:27,931 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 103 transitions. [2025-04-13 23:31:27,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 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 23:31:27,931 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 103 transitions. [2025-04-13 23:31:27,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 23:31:27,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:27,932 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:27,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:31:28,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:28,132 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:28,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1116533517, now seen corresponding path program 2 times [2025-04-13 23:31:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:28,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388293665] [2025-04-13 23:31:28,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:28,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:28,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 23:31:28,148 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:31:28,148 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:28,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:28,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:28,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388293665] [2025-04-13 23:31:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388293665] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:28,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334026850] [2025-04-13 23:31:28,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:28,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:28,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:28,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:28,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 23:31:28,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-04-13 23:31:28,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 23:31:28,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:28,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:28,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:31:28,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:28,367 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334026850] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:28,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-04-13 23:31:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247673874] [2025-04-13 23:31:28,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:28,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:31:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:28,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:31:28,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:31:28,446 INFO L87 Difference]: Start difference. First operand 53 states and 103 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 23:31:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:28,583 INFO L93 Difference]: Finished difference Result 88 states and 198 transitions. [2025-04-13 23:31:28,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:31:28,583 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 23:31:28,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:28,584 INFO L225 Difference]: With dead ends: 88 [2025-04-13 23:31:28,584 INFO L226 Difference]: Without dead ends: 83 [2025-04-13 23:31:28,584 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:31:28,584 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:28,585 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-04-13 23:31:28,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-04-13 23:31:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.9878048780487805) internal successors, (163), 82 states have internal predecessors, (163), 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 23:31:28,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 163 transitions. [2025-04-13 23:31:28,592 INFO L79 Accepts]: Start accepts. Automaton has 83 states and 163 transitions. Word has length 12 [2025-04-13 23:31:28,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:28,592 INFO L485 AbstractCegarLoop]: Abstraction has 83 states and 163 transitions. [2025-04-13 23:31:28,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 18 states have internal predecessors, (30), 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 23:31:28,593 INFO L278 IsEmpty]: Start isEmpty. Operand 83 states and 163 transitions. [2025-04-13 23:31:28,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:31:28,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:28,593 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:28,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:31:28,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-13 23:31:28,797 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:28,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:28,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1131183341, now seen corresponding path program 3 times [2025-04-13 23:31:28,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:28,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690262703] [2025-04-13 23:31:28,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:28,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:28,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 23:31:28,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 23:31:28,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:31:28,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:31:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:28,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690262703] [2025-04-13 23:31:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690262703] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:28,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811106212] [2025-04-13 23:31:28,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:28,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:28,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:28,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:28,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 23:31:28,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 6 equivalence classes. [2025-04-13 23:31:28,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 10 of 18 statements. [2025-04-13 23:31:28,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:31:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:28,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:31:28,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:31:28,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:31:28,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811106212] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:28,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:28,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-04-13 23:31:28,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253706327] [2025-04-13 23:31:28,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:28,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:31:28,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:28,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:31:28,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:31:28,969 INFO L87 Difference]: Start difference. First operand 83 states and 163 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 23:31:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:29,026 INFO L93 Difference]: Finished difference Result 152 states and 299 transitions. [2025-04-13 23:31:29,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:31:29,026 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 18 [2025-04-13 23:31:29,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:29,027 INFO L225 Difference]: With dead ends: 152 [2025-04-13 23:31:29,027 INFO L226 Difference]: Without dead ends: 79 [2025-04-13 23:31:29,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 3 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 23:31:29,028 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 16 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:29,028 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:31:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-04-13 23:31:29,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-04-13 23:31:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 78 states have internal predecessors, (152), 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 23:31:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 152 transitions. [2025-04-13 23:31:29,035 INFO L79 Accepts]: Start accepts. Automaton has 79 states and 152 transitions. Word has length 18 [2025-04-13 23:31:29,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:29,035 INFO L485 AbstractCegarLoop]: Abstraction has 79 states and 152 transitions. [2025-04-13 23:31:29,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 23:31:29,035 INFO L278 IsEmpty]: Start isEmpty. Operand 79 states and 152 transitions. [2025-04-13 23:31:29,036 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:31:29,036 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:29,036 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:29,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:31:29,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:29,240 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:29,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:29,240 INFO L85 PathProgramCache]: Analyzing trace with hash 332221709, now seen corresponding path program 1 times [2025-04-13 23:31:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:29,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149674911] [2025-04-13 23:31:29,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:29,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:31:29,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:31:29,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:29,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:29,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149674911] [2025-04-13 23:31:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149674911] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:29,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707664624] [2025-04-13 23:31:29,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:31:29,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:29,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:29,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:29,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:31:29,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:31:29,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:31:29,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:31:29,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:29,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 23:31:29,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:29,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707664624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:29,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:29,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2025-04-13 23:31:29,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895102874] [2025-04-13 23:31:29,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:29,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 23:31:29,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:29,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 23:31:29,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=922, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:31:29,819 INFO L87 Difference]: Start difference. First operand 79 states and 152 transitions. Second operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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 23:31:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:30,284 INFO L93 Difference]: Finished difference Result 144 states and 337 transitions. [2025-04-13 23:31:30,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:31:30,285 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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 18 [2025-04-13 23:31:30,285 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:30,286 INFO L225 Difference]: With dead ends: 144 [2025-04-13 23:31:30,286 INFO L226 Difference]: Without dead ends: 139 [2025-04-13 23:31:30,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1270, Invalid=2512, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:31:30,288 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 296 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:30,288 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:31:30,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-04-13 23:31:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2025-04-13 23:31:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.9710144927536233) internal successors, (272), 138 states have internal predecessors, (272), 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 23:31:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 272 transitions. [2025-04-13 23:31:30,298 INFO L79 Accepts]: Start accepts. Automaton has 139 states and 272 transitions. Word has length 18 [2025-04-13 23:31:30,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:30,298 INFO L485 AbstractCegarLoop]: Abstraction has 139 states and 272 transitions. [2025-04-13 23:31:30,298 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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 23:31:30,298 INFO L278 IsEmpty]: Start isEmpty. Operand 139 states and 272 transitions. [2025-04-13 23:31:30,299 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 23:31:30,299 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:30,299 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:30,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:31:30,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:30,500 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:30,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1639872717, now seen corresponding path program 2 times [2025-04-13 23:31:30,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:30,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364177519] [2025-04-13 23:31:30,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:30,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:31:30,513 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:31:30,513 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:30,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:30,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:30,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364177519] [2025-04-13 23:31:30,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364177519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:30,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994245261] [2025-04-13 23:31:30,908 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:31:30,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:30,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:30,910 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:30,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:31:30,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 23:31:30,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 23:31:30,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:31:30,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:30,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:31:30,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:31,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:32,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994245261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:32,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:32,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 73 [2025-04-13 23:31:32,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951603418] [2025-04-13 23:31:32,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:32,340 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2025-04-13 23:31:32,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:32,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2025-04-13 23:31:32,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1439, Invalid=4111, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:31:32,343 INFO L87 Difference]: Start difference. First operand 139 states and 272 transitions. Second operand has 75 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 74 states have internal predecessors, (85), 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 23:31:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:33,839 INFO L93 Difference]: Finished difference Result 264 states and 637 transitions. [2025-04-13 23:31:33,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:31:33,839 INFO L79 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 74 states have internal predecessors, (85), 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 30 [2025-04-13 23:31:33,839 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:33,840 INFO L225 Difference]: With dead ends: 264 [2025-04-13 23:31:33,840 INFO L226 Difference]: Without dead ends: 259 [2025-04-13 23:31:33,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4159, Invalid=10603, Unknown=0, NotChecked=0, Total=14762 [2025-04-13 23:31:33,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 846 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:33,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 0 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:31:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-13 23:31:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-04-13 23:31:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.9844961240310077) internal successors, (512), 258 states have internal predecessors, (512), 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 23:31:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 512 transitions. [2025-04-13 23:31:33,866 INFO L79 Accepts]: Start accepts. Automaton has 259 states and 512 transitions. Word has length 30 [2025-04-13 23:31:33,867 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:33,867 INFO L485 AbstractCegarLoop]: Abstraction has 259 states and 512 transitions. [2025-04-13 23:31:33,867 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 1.1486486486486487) internal successors, (85), 74 states have internal predecessors, (85), 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 23:31:33,867 INFO L278 IsEmpty]: Start isEmpty. Operand 259 states and 512 transitions. [2025-04-13 23:31:33,868 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-13 23:31:33,868 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:33,868 INFO L218 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:33,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:31:34,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:34,069 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:34,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:34,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1051062349, now seen corresponding path program 3 times [2025-04-13 23:31:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:34,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818200380] [2025-04-13 23:31:34,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:34,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-13 23:31:34,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:34,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-13 23:31:34,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:35,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:35,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818200380] [2025-04-13 23:31:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818200380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:35,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163820442] [2025-04-13 23:31:35,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:31:35,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:35,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:35,101 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:35,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:31:35,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 24 equivalence classes. [2025-04-13 23:31:35,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) and asserted 54 of 54 statements. [2025-04-13 23:31:35,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2025-04-13 23:31:35,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:35,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 23:31:35,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:36,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:36,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163820442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:39,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 49, 49] total 145 [2025-04-13 23:31:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079872283] [2025-04-13 23:31:39,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:39,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 147 states [2025-04-13 23:31:39,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:39,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2025-04-13 23:31:39,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5747, Invalid=15715, Unknown=0, NotChecked=0, Total=21462 [2025-04-13 23:31:39,338 INFO L87 Difference]: Start difference. First operand 259 states and 512 transitions. Second operand has 147 states, 146 states have (on average 1.0753424657534247) internal successors, (157), 146 states have internal predecessors, (157), 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 23:31:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:31:44,482 INFO L93 Difference]: Finished difference Result 504 states and 1237 transitions. [2025-04-13 23:31:44,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-04-13 23:31:44,482 INFO L79 Accepts]: Start accepts. Automaton has has 147 states, 146 states have (on average 1.0753424657534247) internal successors, (157), 146 states have internal predecessors, (157), 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 54 [2025-04-13 23:31:44,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:31:44,484 INFO L225 Difference]: With dead ends: 504 [2025-04-13 23:31:44,484 INFO L226 Difference]: Without dead ends: 499 [2025-04-13 23:31:44,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10336 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=16375, Invalid=41947, Unknown=0, NotChecked=0, Total=58322 [2025-04-13 23:31:44,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1881 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:31:44,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 0 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:31:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-04-13 23:31:44,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2025-04-13 23:31:44,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.9919678714859437) internal successors, (992), 498 states have internal predecessors, (992), 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 23:31:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 992 transitions. [2025-04-13 23:31:44,512 INFO L79 Accepts]: Start accepts. Automaton has 499 states and 992 transitions. Word has length 54 [2025-04-13 23:31:44,512 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:31:44,512 INFO L485 AbstractCegarLoop]: Abstraction has 499 states and 992 transitions. [2025-04-13 23:31:44,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 147 states, 146 states have (on average 1.0753424657534247) internal successors, (157), 146 states have internal predecessors, (157), 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 23:31:44,512 INFO L278 IsEmpty]: Start isEmpty. Operand 499 states and 992 transitions. [2025-04-13 23:31:44,514 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-04-13 23:31:44,514 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:31:44,514 INFO L218 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:31:44,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:31:44,714 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:44,715 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:31:44,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:31:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1328980147, now seen corresponding path program 4 times [2025-04-13 23:31:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:31:44,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973208528] [2025-04-13 23:31:44,715 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:31:44,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-13 23:31:44,764 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-13 23:31:44,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:31:48,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973208528] [2025-04-13 23:31:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973208528] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:31:48,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700130999] [2025-04-13 23:31:48,394 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:31:48,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:31:48,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:31:48,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:31:48,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:31:48,435 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 102 statements into 2 equivalence classes. [2025-04-13 23:31:48,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 102 of 102 statements. [2025-04-13 23:31:48,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:31:48,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:31:48,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-04-13 23:31:48,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:31:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:51,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:31:54,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:31:54,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700130999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:31:54,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:31:54,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 200 [2025-04-13 23:31:54,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739056727] [2025-04-13 23:31:54,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:31:54,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 202 states [2025-04-13 23:31:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:31:54,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2025-04-13 23:31:54,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15048, Invalid=25554, Unknown=0, NotChecked=0, Total=40602 [2025-04-13 23:31:54,992 INFO L87 Difference]: Start difference. First operand 499 states and 992 transitions. Second operand has 202 states, 201 states have (on average 1.054726368159204) internal successors, (212), 201 states have internal predecessors, (212), 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 23:32:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:32:01,200 INFO L93 Difference]: Finished difference Result 539 states and 1102 transitions. [2025-04-13 23:32:01,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-04-13 23:32:01,201 INFO L79 Accepts]: Start accepts. Automaton has has 202 states, 201 states have (on average 1.054726368159204) internal successors, (212), 201 states have internal predecessors, (212), 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 102 [2025-04-13 23:32:01,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:32:01,204 INFO L225 Difference]: With dead ends: 539 [2025-04-13 23:32:01,204 INFO L226 Difference]: Without dead ends: 534 [2025-04-13 23:32:01,207 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 10 SyntacticMatches, 89 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43223 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=30522, Invalid=61590, Unknown=0, NotChecked=0, Total=92112 [2025-04-13 23:32:01,207 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 1907 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:32:01,208 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 0 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:32:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-04-13 23:32:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2025-04-13 23:32:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.9924953095684803) internal successors, (1062), 533 states have internal predecessors, (1062), 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 23:32:01,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 1062 transitions. [2025-04-13 23:32:01,248 INFO L79 Accepts]: Start accepts. Automaton has 534 states and 1062 transitions. Word has length 102 [2025-04-13 23:32:01,248 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:32:01,248 INFO L485 AbstractCegarLoop]: Abstraction has 534 states and 1062 transitions. [2025-04-13 23:32:01,249 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 202 states, 201 states have (on average 1.054726368159204) internal successors, (212), 201 states have internal predecessors, (212), 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 23:32:01,249 INFO L278 IsEmpty]: Start isEmpty. Operand 534 states and 1062 transitions. [2025-04-13 23:32:01,250 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-04-13 23:32:01,250 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:32:01,250 INFO L218 NwaCegarLoop]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:32:01,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:32:01,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:32:01,451 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 23:32:01,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:32:01,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2007002354, now seen corresponding path program 5 times [2025-04-13 23:32:01,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:32:01,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109702850] [2025-04-13 23:32:01,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:32:01,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:32:01,457 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 109 statements into 52 equivalence classes. [2025-04-13 23:32:01,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) and asserted 109 of 109 statements. [2025-04-13 23:32:01,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2025-04-13 23:32:01,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:01,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 23:32:01,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-04-13 23:32:01,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-04-13 23:32:01,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:32:01,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 23:32:01,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 23:32:01,582 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 23:32:01,582 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:32:01,583 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:32:01,583 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:32:01,584 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-13 23:32:01,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:32:01,586 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-04-13 23:32:01,709 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:32:01,709 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:32:01,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:32:01 BasicIcfg [2025-04-13 23:32:01,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:32:01,716 INFO L158 Benchmark]: Toolchain (without parser) took 35666.92ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 98.1MB in the beginning and 322.3MB in the end (delta: -224.3MB). Peak memory consumption was 145.1MB. Max. memory is 8.0GB. [2025-04-13 23:32:01,716 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:32:01,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.26ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 74.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:32:01,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.78ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:32:01,717 INFO L158 Benchmark]: Boogie Preprocessor took 19.18ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 71.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:32:01,717 INFO L158 Benchmark]: IcfgBuilder took 361.75ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 50.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 23:32:01,718 INFO L158 Benchmark]: TraceAbstraction took 34850.95ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 49.4MB in the beginning and 322.3MB in the end (delta: -273.0MB). Peak memory consumption was 94.8MB. Max. memory is 8.0GB. [2025-04-13 23:32:01,718 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.15ms. Allocated memory is still 159.4MB. Free memory is still 88.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.26ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 74.5MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.78ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.18ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 71.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 361.75ms. Allocated memory is still 142.6MB. Free memory was 71.6MB in the beginning and 50.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 34850.95ms. Allocated memory was 142.6MB in the beginning and 511.7MB in the end (delta: 369.1MB). Free memory was 49.4MB in the beginning and 322.3MB in the end (delta: -273.0MB). Peak memory consumption was 94.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 - CounterExampleResult [Line: 753]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\at(arg, Pre)={0:0}, _N=100, limit=0, t1=-1] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\at(arg, Pre)={0:0}, _N=100, limit=0, t1=-1, t2=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\at(arg, Pre)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] 2 reach_error() VAL [\at(arg, Pre)={0:0}, \at(expression, Pre)=0, _N=100, arg={0:0}, expression=0, limit=101] - UnprovableResult [Line: 775]: 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: 776]: 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 5 procedures, 29 locations, 32 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5115 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5115 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2454 IncrementalHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 2454 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 953 GetRequests, 91 SyntacticMatches, 92 SemanticMatches, 770 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57347 ImplicationChecksByTransitivity, 24.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=9, InterpolantAutomatonStates: 314, 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, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 608 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 122 NumberOfCheckSat, 719 ConstructedInterpolants, 0 QuantifiedInterpolants, 3593 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1057 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 136/17761 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 23:32:01,732 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...