/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/fib_unsafe-10.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:20:49,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:20:49,863 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:20:49,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:20:49,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:20:49,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:20:49,891 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:20:49,891 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:20:49,892 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:20:49,892 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:20:49,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:20:49,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:20:49,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:20:49,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:20:49,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:20:49,894 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:20:49,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:20:49,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:20:49,896 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:20:50,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:20:50,119 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:20:50,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:20:50,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:20:50,121 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:20:50,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-10.i [2025-04-13 21:20:51,410 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79fb675b/9716796d010c41e2bf5432f024e83f4c/FLAGcead59a1e [2025-04-13 21:20:51,655 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:20:51,655 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-10.i [2025-04-13 21:20:51,668 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79fb675b/9716796d010c41e2bf5432f024e83f4c/FLAGcead59a1e [2025-04-13 21:20:52,411 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b79fb675b/9716796d010c41e2bf5432f024e83f4c [2025-04-13 21:20:52,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:20:52,414 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:20:52,416 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:20:52,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:20:52,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6283f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52, skipping insertion in model container [2025-04-13 21:20:52,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,441 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:20:52,628 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/fib_unsafe-10.i[30243,30256] [2025-04-13 21:20:52,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,649 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:20:52,687 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/fib_unsafe-10.i[30243,30256] [2025-04-13 21:20:52,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,724 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:20:52,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52 WrapperNode [2025-04-13 21:20:52,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:20:52,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:20:52,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,757 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 21:20:52,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:20:52,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:20:52,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:20:52,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,786 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:20:52,787 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:20:52,787 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:20:52,787 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:52,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:52,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:20:52,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:20:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:20:52,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:20:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:20:52,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:20:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:20:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:20:52,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:20:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:20:52,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:20:52,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:20:52,846 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:20:52,939 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:20:52,941 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:20:53,082 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:20:53,083 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:20:53,083 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:20:53,186 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:53,189 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:53,195 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:20:53,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:53 BoogieIcfgContainer [2025-04-13 21:20:53,196 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:20:53,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:20:53,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:20:53,200 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:20:53,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:20:52" (1/3) ... [2025-04-13 21:20:53,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6260ca55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:53, skipping insertion in model container [2025-04-13 21:20:53,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (2/3) ... [2025-04-13 21:20:53,201 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6260ca55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:53, skipping insertion in model container [2025-04-13 21:20:53,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:53" (3/3) ... [2025-04-13 21:20:53,202 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-10.i [2025-04-13 21:20:53,212 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:20:53,213 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-10.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:20:53,213 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:20:53,249 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:20:53,270 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 21:20:53,285 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:20:53,310 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;@5d52c5f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:20:53,311 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:20:53,312 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:20:53,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,317 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:53,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 21:20:53,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505261732] [2025-04-13 21:20:53,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:20:53,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:20:53,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:53,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505261732] [2025-04-13 21:20:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505261732] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:20:53,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:20:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:20:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283761646] [2025-04-13 21:20:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:20:53,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:20:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:53,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:20:53,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:53,511 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:53,589 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 21:20:53,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:20:53,591 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2025-04-13 21:20:53,591 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:53,596 INFO L225 Difference]: With dead ends: 173 [2025-04-13 21:20:53,596 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 21:20:53,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:53,600 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:53,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 21:20:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 21:20:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 21:20:53,646 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 21:20:53,646 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:53,646 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 21:20:53,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,646 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 21:20:53,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:20:53,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:20:53,647 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:53,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 21:20:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802573110] [2025-04-13 21:20:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,740 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 21:20:53,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802573110] [2025-04-13 21:20:53,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802573110] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:53,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409657867] [2025-04-13 21:20:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:53,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:53,743 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 21:20:53,744 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 21:20:53,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:53,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:53,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:20:53,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:53,825 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 21:20:53,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:53,847 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 21:20:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409657867] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:53,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:20:53,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168624904] [2025-04-13 21:20:53,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:53,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:20:53,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:53,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:20:53,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:53,851 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:53,928 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 21:20:53,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:20:53,929 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:20:53,929 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:53,930 INFO L225 Difference]: With dead ends: 205 [2025-04-13 21:20:53,930 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 21:20:53,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:53,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:53,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 21:20:53,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 21:20:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 21:20:53,947 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 21:20:53,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:53,948 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 21:20:53,948 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,948 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 21:20:53,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:20:53,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,949 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,956 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 21:20:54,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,149 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:54,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 21:20:54,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229768541] [2025-04-13 21:20:54,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:54,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,260 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 21:20:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229768541] [2025-04-13 21:20:54,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229768541] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:54,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108205118] [2025-04-13 21:20:54,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:54,262 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 21:20:54,264 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 21:20:54,301 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,320 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:54,320 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:20:54,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,337 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 21:20:54,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,382 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 21:20:54,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108205118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:20:54,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738470119] [2025-04-13 21:20:54,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:20:54,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:20:54,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:54,384 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,528 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 21:20:54,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:20:54,528 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:20:54,529 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,530 INFO L225 Difference]: With dead ends: 301 [2025-04-13 21:20:54,531 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 21:20:54,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:54,532 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:54,532 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 21:20:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 21:20:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 21:20:54,547 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 21:20:54,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,547 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 21:20:54,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,547 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 21:20:54,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:20:54,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,549 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,555 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 21:20:54,749 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,SelfDestructingSolverStorable2 [2025-04-13 21:20:54,749 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:54,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 21:20:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215160117] [2025-04-13 21:20:54,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:54,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:54,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:54,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,962 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 21:20:54,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215160117] [2025-04-13 21:20:54,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215160117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:54,963 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188294310] [2025-04-13 21:20:54,963 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:54,965 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 21:20:54,966 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 21:20:54,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:55,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:20:55,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:55,050 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 21:20:55,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:55,241 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 21:20:55,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188294310] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:55,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:55,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 21:20:55,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745757995] [2025-04-13 21:20:55,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:55,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:20:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:55,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:20:55,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:55,243 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:55,507 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 21:20:55,508 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:20:55,508 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 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 21 [2025-04-13 21:20:55,508 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:55,511 INFO L225 Difference]: With dead ends: 493 [2025-04-13 21:20:55,511 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 21:20:55,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:55,513 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:55,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:20:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 21:20:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 21:20:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.9662162162162162) internal successors, (1317), 444 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 21:20:55,555 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 21:20:55,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:55,555 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 21:20:55,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,555 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 21:20:55,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 21:20:55,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:55,559 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:55,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:20:55,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:55,759 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:55,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:55,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 21:20:55,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:55,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80621895] [2025-04-13 21:20:55,760 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:55,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:55,767 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:55,794 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:55,794 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:55,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,193 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 21:20:57,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:57,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80621895] [2025-04-13 21:20:57,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80621895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:57,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808017436] [2025-04-13 21:20:57,194 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:57,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:57,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:57,196 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 21:20:57,198 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 21:20:57,233 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:57,259 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:57,259 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-13 21:20:57,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:58,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:59,980 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 21:20:59,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808017436] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:59,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:59,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2025-04-13 21:20:59,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508496889] [2025-04-13 21:20:59,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:59,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-04-13 21:20:59,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:59,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-04-13 21:20:59,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5611, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 21:20:59,983 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:24:00,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:24:00,046 INFO L93 Difference]: Finished difference Result 58704 states and 176341 transitions. [2025-04-13 21:24:00,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1036 states. [2025-04-13 21:24:00,047 INFO L79 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 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 33 [2025-04-13 21:24:00,047 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:24:00,366 INFO L225 Difference]: With dead ends: 58704 [2025-04-13 21:24:00,366 INFO L226 Difference]: Without dead ends: 53911 [2025-04-13 21:24:00,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1101 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1091 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604646 ImplicationChecksByTransitivity, 159.2s TimeCoverageRelationStatistics Valid=229683, Invalid=963873, Unknown=0, NotChecked=0, Total=1193556 [2025-04-13 21:24:00,478 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5809 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15456 mSolverCounterSat, 1229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5809 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1229 IncrementalHoareTripleChecker+Valid, 15456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:24:00,478 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5809 Valid, 0 Invalid, 16685 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1229 Valid, 15456 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2025-04-13 21:24:00,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53911 states. [2025-04-13 21:24:03,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53911 to 19504. [2025-04-13 21:24:03,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19504 states, 19503 states have (on average 3.081013177459878) internal successors, (60089), 19503 states have internal predecessors, (60089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:24:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19504 states to 19504 states and 60089 transitions. [2025-04-13 21:24:03,696 INFO L79 Accepts]: Start accepts. Automaton has 19504 states and 60089 transitions. Word has length 33 [2025-04-13 21:24:03,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:24:03,697 INFO L485 AbstractCegarLoop]: Abstraction has 19504 states and 60089 transitions. [2025-04-13 21:24:03,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:24:03,697 INFO L278 IsEmpty]: Start isEmpty. Operand 19504 states and 60089 transitions. [2025-04-13 21:24:03,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:24:03,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:24:03,715 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:24:03,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:24:03,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:24:03,919 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:24:03,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:24:03,920 INFO L85 PathProgramCache]: Analyzing trace with hash -909753575, now seen corresponding path program 1 times [2025-04-13 21:24:03,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:24:03,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144944176] [2025-04-13 21:24:03,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:24:03,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:24:03,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:24:03,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:24:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:24:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:24:05,429 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:05,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:24:05,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144944176] [2025-04-13 21:24:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144944176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:24:05,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460625205] [2025-04-13 21:24:05,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:24:05,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:24:05,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:24:05,433 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 21:24:05,433 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 21:24:05,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:24:05,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:24:05,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:24:05,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:24:05,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:24:05,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:24:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 210 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:06,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:24:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460625205] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:24:08,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:24:08,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2025-04-13 21:24:08,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29401853] [2025-04-13 21:24:08,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:24:08,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2025-04-13 21:24:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:24:08,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2025-04-13 21:24:08,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=6747, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 21:24:08,090 INFO L87 Difference]: Start difference. First operand 19504 states and 60089 transitions. Second operand has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:27:25,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:27:25,655 INFO L93 Difference]: Finished difference Result 189313 states and 593847 transitions. [2025-04-13 21:27:25,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 732 states. [2025-04-13 21:27:25,656 INFO L79 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 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 37 [2025-04-13 21:27:25,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:27:26,520 INFO L225 Difference]: With dead ends: 189313 [2025-04-13 21:27:26,521 INFO L226 Difference]: Without dead ends: 187027 [2025-04-13 21:27:26,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 811 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311031 ImplicationChecksByTransitivity, 131.5s TimeCoverageRelationStatistics Valid=129325, Invalid=530831, Unknown=0, NotChecked=0, Total=660156 [2025-04-13 21:27:26,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9758 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10891 mSolverCounterSat, 1620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9758 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1620 IncrementalHoareTripleChecker+Valid, 10891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:27:26,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9758 Valid, 0 Invalid, 12511 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1620 Valid, 10891 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-04-13 21:27:26,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187027 states. [2025-04-13 21:28:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187027 to 156377. [2025-04-13 21:28:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156377 states, 156376 states have (on average 3.285600092085742) internal successors, (513789), 156376 states have internal predecessors, (513789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156377 states to 156377 states and 513789 transitions. [2025-04-13 21:28:11,576 INFO L79 Accepts]: Start accepts. Automaton has 156377 states and 513789 transitions. Word has length 37 [2025-04-13 21:28:11,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:28:11,576 INFO L485 AbstractCegarLoop]: Abstraction has 156377 states and 513789 transitions. [2025-04-13 21:28:11,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:11,577 INFO L278 IsEmpty]: Start isEmpty. Operand 156377 states and 513789 transitions. [2025-04-13 21:28:11,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:28:11,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:28:11,661 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:28:11,669 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 21:28:11,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:11,862 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:28:11,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:28:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -915298826, now seen corresponding path program 1 times [2025-04-13 21:28:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:28:11,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959468485] [2025-04-13 21:28:11,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:28:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:28:11,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:28:11,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:28:11,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:28:11,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:12,927 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 21:28:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:28:12,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959468485] [2025-04-13 21:28:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959468485] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:28:12,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100018626] [2025-04-13 21:28:12,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:28:12,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:12,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:28:12,929 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 21:28:12,930 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 21:28:12,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:28:12,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:28:12,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:28:12,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:12,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:28:12,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:28:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:13,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:28:15,783 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 21:28:15,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [100018626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:28:15,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:28:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 21:28:15,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74686969] [2025-04-13 21:28:15,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:28:15,784 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 21:28:15,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:28:15,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 21:28:15,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=6614, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 21:28:15,785 INFO L87 Difference]: Start difference. First operand 156377 states and 513789 transitions. Second operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:29:58,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:29:58,753 INFO L93 Difference]: Finished difference Result 227631 states and 738891 transitions. [2025-04-13 21:29:58,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2025-04-13 21:29:58,753 INFO L79 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 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 37 [2025-04-13 21:29:58,753 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:30:00,267 INFO L225 Difference]: With dead ends: 227631 [2025-04-13 21:30:00,268 INFO L226 Difference]: Without dead ends: 227419 [2025-04-13 21:30:00,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17592 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=10211, Invalid=46671, Unknown=0, NotChecked=0, Total=56882 [2025-04-13 21:30:00,360 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2328 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8756 mSolverCounterSat, 684 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2328 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 684 IncrementalHoareTripleChecker+Valid, 8756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:30:00,360 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2328 Valid, 0 Invalid, 9440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [684 Valid, 8756 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 21:30:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227419 states. [2025-04-13 21:30:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227419 to 182535. [2025-04-13 21:30:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182535 states, 182534 states have (on average 3.3776666264915027) internal successors, (616539), 182534 states have internal predecessors, (616539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:30:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182535 states to 182535 states and 616539 transitions. [2025-04-13 21:30:59,013 INFO L79 Accepts]: Start accepts. Automaton has 182535 states and 616539 transitions. Word has length 37 [2025-04-13 21:30:59,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:30:59,014 INFO L485 AbstractCegarLoop]: Abstraction has 182535 states and 616539 transitions. [2025-04-13 21:30:59,014 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:30:59,014 INFO L278 IsEmpty]: Start isEmpty. Operand 182535 states and 616539 transitions. [2025-04-13 21:30:59,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:30:59,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:30:59,110 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:30:59,116 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 21:30:59,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:30:59,311 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:30:59,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:30:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash -426918626, now seen corresponding path program 2 times [2025-04-13 21:30:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:30:59,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019397594] [2025-04-13 21:30:59,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:30:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:30:59,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 21:30:59,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:30:59,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:30:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:00,296 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 21:31:00,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:31:00,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019397594] [2025-04-13 21:31:00,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019397594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:31:00,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745755343] [2025-04-13 21:31:00,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:31:00,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:31:00,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:31:00,298 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 21:31:00,300 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 21:31:00,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 21:31:00,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:31:00,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:31:00,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:00,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:31:00,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:31:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:01,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:31:02,590 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 21:31:02,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745755343] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:31:02,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:31:02,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 21:31:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792935081] [2025-04-13 21:31:02,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:31:02,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 21:31:02,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:31:02,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 21:31:02,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1237, Invalid=6419, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 21:31:02,593 INFO L87 Difference]: Start difference. First operand 182535 states and 616539 transitions. Second operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 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) Received shutdown request... [2025-04-13 21:34:02,709 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:34:02,711 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:34:02,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 560 states. [2025-04-13 21:34:02,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 623 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169756 ImplicationChecksByTransitivity, 108.2s TimeCoverageRelationStatistics Valid=84564, Invalid=305436, Unknown=0, NotChecked=0, Total=390000 [2025-04-13 21:34:02,755 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3865 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16126 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3865 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 16126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:34:02,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3865 Valid, 0 Invalid, 17144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1018 Valid, 16126 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2025-04-13 21:34:02,757 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:34:02,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 21:34:02,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:34:02,963 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (182535states) and FLOYD_HOARE automaton (currently 560 states, 88 states before enhancement),while ReachableStatesComputation was computing reachable states (109363 states constructed, input type IntersectNwa). [2025-04-13 21:34:02,968 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:34:02,969 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:34:02,979 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2025-04-13 21:34:02,987 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:34:02,987 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:34:02,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:34:02 BasicIcfg [2025-04-13 21:34:02,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:34:02,994 INFO L158 Benchmark]: Toolchain (without parser) took 790579.89ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 107.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 21:34:02,994 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:34:02,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.91ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 85.4MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 21:34:02,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:34:02,995 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:34:02,995 INFO L158 Benchmark]: IcfgBuilder took 409.24ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 55.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:34:02,996 INFO L158 Benchmark]: TraceAbstraction took 789796.36ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 54.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.5GB. Max. memory is 8.0GB. [2025-04-13 21:34:02,997 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.20ms. Allocated memory is still 163.6MB. Free memory is still 91.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.91ms. Allocated memory is still 155.2MB. Free memory was 107.8MB in the beginning and 85.4MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 155.2MB. Free memory was 85.4MB in the beginning and 83.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 409.24ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 55.5MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 789796.36ms. Allocated memory was 155.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 54.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 2.5GB. 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 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (182535states) and FLOYD_HOARE automaton (currently 560 states, 88 states before enhancement),while ReachableStatesComputation was computing reachable states (109363 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (182535states) and FLOYD_HOARE automaton (currently 560 states, 88 states before enhancement),while ReachableStatesComputation was computing reachable states (109363 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (182535states) and FLOYD_HOARE automaton (currently 560 states, 88 states before enhancement),while ReachableStatesComputation was computing reachable states (109363 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 789.7s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 664.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22376 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22376 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4566 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51690 IncrementalHoareTripleChecker+Invalid, 56256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4566 mSolverCounterUnsat, 0 mSDtfsCounter, 51690 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2933 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2802 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103085 ImplicationChecksByTransitivity, 415.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182535occurred in iteration=7, InterpolantAutomatonStates: 1972, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 106.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 109941 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.0s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 7613 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1621 ConjunctsInSsa, 335 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 840/3174 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 could not prove your program: Timeout Completed graceful shutdown