/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_safe-12.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:20:49,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:20:49,798 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,803 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:20:49,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:20:49,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:20:49,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:20:49,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:20:49,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:20:49,827 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:20:49,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:20:49,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:20:49,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:20:49,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:20:49,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:20:49,829 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:20:49,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:20:49,830 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,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:20:50,060 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:20:50,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:20:50,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:20:50,063 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:20:50,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-12.i [2025-04-13 21:20:51,363 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a5d3a67/2582249ac6e941c580772d1e425dc792/FLAG8aedda06b [2025-04-13 21:20:51,608 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:20:51,608 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-12.i [2025-04-13 21:20:51,623 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a5d3a67/2582249ac6e941c580772d1e425dc792/FLAG8aedda06b [2025-04-13 21:20:52,564 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a5d3a67/2582249ac6e941c580772d1e425dc792 [2025-04-13 21:20:52,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:20:52,567 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:20:52,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:20:52,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:20:52,573 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,574 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d2534f 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,574 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,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:20:52,813 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_safe-12.i[30241,30254] [2025-04-13 21:20:52,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,840 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:20:52,887 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_safe-12.i[30241,30254] [2025-04-13 21:20:52,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,917 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:20:52,919 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,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:20:52,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:20:52,925 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,942 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,959 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 21:20:52,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:20:52,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:20:52,966 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,966 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,969 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,983 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,983 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,983 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,990 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,991 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,992 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,992 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,998 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:20:52,999 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:20:52,999 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:20:53,002 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:53,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:53,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:53,027 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:53,029 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:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:20:53,047 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:20:53,047 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:20:53,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:20:53,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:20:53,048 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:53,143 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:20:53,145 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:20:53,275 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:20:53,276 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:20:53,276 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:20:53,379 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,384 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,389 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:20:53,390 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,390 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:20:53,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:20:53,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:20:53,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:20:53,396 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,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a57e356 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,397 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,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a57e356 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,397 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,398 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-12.i [2025-04-13 21:20:53,407 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:20:53,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-12.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,409 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:20:53,446 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:20:53,469 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 21:20:53,492 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,510 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:20:53,517 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;@3e474042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:20:53,517 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:20:53,519 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,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:20:53,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,527 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,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 21:20:53,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188462420] [2025-04-13 21:20:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:20:53,611 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,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,699 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,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188462420] [2025-04-13 21:20:53,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188462420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:20:53,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:20:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:20:53,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675184644] [2025-04-13 21:20:53,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:20:53,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:20:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:53,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:20:53,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:53,718 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,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:53,803 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 21:20:53,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:20:53,805 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,805 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:53,812 INFO L225 Difference]: With dead ends: 173 [2025-04-13 21:20:53,812 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 21:20:53,816 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,818 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,818 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,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 21:20:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 21:20:53,858 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,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 21:20:53,866 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 21:20:53,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:53,866 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 21:20:53,867 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,867 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 21:20:53,867 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:20:53,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,870 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,870 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:20:53,870 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,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 21:20:53,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,871 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336045074] [2025-04-13 21:20:53,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:53,901 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,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,983 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,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336045074] [2025-04-13 21:20:53,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336045074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:53,983 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697210141] [2025-04-13 21:20:53,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:53,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:53,988 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,989 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:54,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:54,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:54,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:54,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:20:54,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,078 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:54,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,098 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:54,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697210141] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:20:54,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599701565] [2025-04-13 21:20:54,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:20:54,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:20:54,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:54,100 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:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,172 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 21:20:54,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:20:54,172 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:54,172 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,174 INFO L225 Difference]: With dead ends: 205 [2025-04-13 21:20:54,174 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 21:20:54,174 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:54,174 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:54,175 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:54,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 21:20:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 21:20:54,184 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:54,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 21:20:54,185 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 21:20:54,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,185 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 21:20:54,185 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:54,185 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 21:20:54,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:20:54,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,187 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,195 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,387 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,388 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,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,388 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 21:20:54,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477225357] [2025-04-13 21:20:54,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,415 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,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,490 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,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477225357] [2025-04-13 21:20:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477225357] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:54,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820424406] [2025-04-13 21:20:54,490 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:54,492 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,493 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,528 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,543 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,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:20:54,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,558 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,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,607 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,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820424406] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:20:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321454677] [2025-04-13 21:20:54,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:20:54,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:20:54,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:54,608 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,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,756 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 21:20:54,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:20:54,756 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,756 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,758 INFO L225 Difference]: With dead ends: 301 [2025-04-13 21:20:54,758 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 21:20:54,758 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,759 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,759 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,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 21:20:54,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 21:20:54,782 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,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 21:20:54,784 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 21:20:54,785 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,785 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 21:20:54,785 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,785 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 21:20:54,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:20:54,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,786 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:20:54,986 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,986 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,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 21:20:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055443116] [2025-04-13 21:20:54,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,018 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,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,222 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,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:55,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055443116] [2025-04-13 21:20:55,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055443116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:55,222 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896459967] [2025-04-13 21:20:55,222 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:55,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:55,227 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:55,229 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:55,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,287 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,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:20:55,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:55,321 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,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:55,512 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,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896459967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:55,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:55,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 21:20:55,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859119082] [2025-04-13 21:20:55,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:55,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:20:55,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:55,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:20:55,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:55,514 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,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:55,795 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 21:20:55,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:20:55,796 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,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:55,799 INFO L225 Difference]: With dead ends: 493 [2025-04-13 21:20:55,799 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 21:20:55,799 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,803 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,803 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,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 21:20:55,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 21:20:55,839 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,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 21:20:55,843 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 21:20:55,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:55,843 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 21:20:55,843 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,843 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 21:20:55,845 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 21:20:55,845 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:55,845 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:55,855 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:56,046 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:56,046 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:56,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 21:20:56,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:56,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341060919] [2025-04-13 21:20:56,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:56,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:56,070 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:56,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:56,458 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:56,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:56,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341060919] [2025-04-13 21:20:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341060919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:56,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422112118] [2025-04-13 21:20:56,458 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:56,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:56,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:56,462 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:56,463 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:56,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:56,538 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:56,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:56,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:56,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 21:20:56,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:56,591 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:56,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:56,894 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:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422112118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:56,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 28 [2025-04-13 21:20:56,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820162084] [2025-04-13 21:20:56,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:56,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 21:20:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:56,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 21:20:56,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:20:56,895 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:57,171 INFO L93 Difference]: Finished difference Result 557 states and 1701 transitions. [2025-04-13 21:20:57,171 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 21:20:57,171 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:20:57,171 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:57,174 INFO L225 Difference]: With dead ends: 557 [2025-04-13 21:20:57,174 INFO L226 Difference]: Without dead ends: 509 [2025-04-13 21:20:57,177 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2025-04-13 21:20:57,179 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 540 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:57,179 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 0 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:20:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-04-13 21:20:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-04-13 21:20:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 2.970472440944882) internal successors, (1509), 508 states have internal predecessors, (1509), 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:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 1509 transitions. [2025-04-13 21:20:57,208 INFO L79 Accepts]: Start accepts. Automaton has 509 states and 1509 transitions. Word has length 33 [2025-04-13 21:20:57,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:57,208 INFO L485 AbstractCegarLoop]: Abstraction has 509 states and 1509 transitions. [2025-04-13 21:20:57,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 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:57,208 INFO L278 IsEmpty]: Start isEmpty. Operand 509 states and 1509 transitions. [2025-04-13 21:20:57,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:20:57,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:57,211 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:57,220 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:20:57,412 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:20:57,412 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:20:57,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 404683876, now seen corresponding path program 5 times [2025-04-13 21:20:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:57,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092612375] [2025-04-13 21:20:57,413 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:20:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:57,419 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 21:20:57,499 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:20:57,499 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 21:20:57,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:59,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:59,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092612375] [2025-04-13 21:20:59,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092612375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:59,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136945823] [2025-04-13 21:20:59,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:20:59,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:59,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:59,095 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:20:59,097 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:20:59,135 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 14 equivalence classes. [2025-04-13 21:20:59,176 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:20:59,176 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2025-04-13 21:20:59,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:59,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-13 21:20:59,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:21:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:00,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:21:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136945823] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:21:02,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:21:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2025-04-13 21:21:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91741119] [2025-04-13 21:21:02,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:21:02,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 93 states [2025-04-13 21:21:02,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:21:02,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2025-04-13 21:21:02,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1330, Invalid=7226, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 21:21:02,121 INFO L87 Difference]: Start difference. First operand 509 states and 1509 transitions. Second operand has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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:21:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:21:22,069 INFO L93 Difference]: Finished difference Result 16171 states and 48427 transitions. [2025-04-13 21:21:22,069 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2025-04-13 21:21:22,069 INFO L79 Accepts]: Start accepts. Automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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:21:22,069 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:21:22,149 INFO L225 Difference]: With dead ends: 16171 [2025-04-13 21:21:22,149 INFO L226 Difference]: Without dead ends: 15300 [2025-04-13 21:21:22,162 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17208 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=12172, Invalid=43760, Unknown=0, NotChecked=0, Total=55932 [2025-04-13 21:21:22,163 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3886 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6334 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3886 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 6334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:21:22,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3886 Valid, 0 Invalid, 6885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 6334 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 21:21:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15300 states. [2025-04-13 21:21:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15300 to 13474. [2025-04-13 21:21:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13474 states, 13473 states have (on average 3.0316187931418392) internal successors, (40845), 13473 states have internal predecessors, (40845), 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:21:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13474 states to 13474 states and 40845 transitions. [2025-04-13 21:21:23,220 INFO L79 Accepts]: Start accepts. Automaton has 13474 states and 40845 transitions. Word has length 37 [2025-04-13 21:21:23,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:21:23,221 INFO L485 AbstractCegarLoop]: Abstraction has 13474 states and 40845 transitions. [2025-04-13 21:21:23,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 93 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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:21:23,221 INFO L278 IsEmpty]: Start isEmpty. Operand 13474 states and 40845 transitions. [2025-04-13 21:21:23,239 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:21:23,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:21:23,240 INFO L218 NwaCegarLoop]: trace histogram [26, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:21:23,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 21:21:23,445 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:21:23,445 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:21:23,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:21:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 930276057, now seen corresponding path program 1 times [2025-04-13 21:21:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:21:23,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836158929] [2025-04-13 21:21:23,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:21:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:21:23,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:21:23,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:21:23,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:21:23,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:21:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:24,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:21:24,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836158929] [2025-04-13 21:21:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836158929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:21:24,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616952673] [2025-04-13 21:21:24,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:21:24,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:21:24,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:21:24,901 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:21:24,902 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:21:24,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:21:24,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:21:24,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:21:24,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:21:24,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:21:24,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:21:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 300 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:26,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:21:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:27,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616952673] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:21:27,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:21:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:21:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981749420] [2025-04-13 21:21:27,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:21:27,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:21:27,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:21:27,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:21:27,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=8662, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:21:27,778 INFO L87 Difference]: Start difference. First operand 13474 states and 40845 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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:25:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:25:41,542 INFO L93 Difference]: Finished difference Result 275248 states and 859551 transitions. [2025-04-13 21:25:41,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 974 states. [2025-04-13 21:25:41,543 INFO L79 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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 41 [2025-04-13 21:25:41,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:25:42,995 INFO L225 Difference]: With dead ends: 275248 [2025-04-13 21:25:42,995 INFO L226 Difference]: Without dead ends: 272113 [2025-04-13 21:25:43,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1079 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1065 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572943 ImplicationChecksByTransitivity, 203.7s TimeCoverageRelationStatistics Valid=224462, Invalid=912960, Unknown=0, NotChecked=0, Total=1137422 [2025-04-13 21:25:43,149 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8727 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14632 mSolverCounterSat, 2222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8727 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2222 IncrementalHoareTripleChecker+Valid, 14632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-04-13 21:25:43,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8727 Valid, 0 Invalid, 16854 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2222 Valid, 14632 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-04-13 21:25:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272113 states. [2025-04-13 21:26:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272113 to 226050. [2025-04-13 21:26:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226050 states, 226049 states have (on average 3.2803064822228807) internal successors, (741510), 226049 states have internal predecessors, (741510), 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:26:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226050 states to 226050 states and 741510 transitions. [2025-04-13 21:26:14,622 INFO L79 Accepts]: Start accepts. Automaton has 226050 states and 741510 transitions. Word has length 41 [2025-04-13 21:26:14,623 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:26:14,623 INFO L485 AbstractCegarLoop]: Abstraction has 226050 states and 741510 transitions. [2025-04-13 21:26:14,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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:26:14,623 INFO L278 IsEmpty]: Start isEmpty. Operand 226050 states and 741510 transitions. [2025-04-13 21:26:14,771 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:26:14,771 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:26:14,772 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:26:14,778 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:26:14,972 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:26:14,972 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:26:14,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:26:14,973 INFO L85 PathProgramCache]: Analyzing trace with hash 694844726, now seen corresponding path program 1 times [2025-04-13 21:26:14,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:26:14,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264711462] [2025-04-13 21:26:14,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:26:14,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:26:14,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:26:14,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:26:14,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:26:14,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:26:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:16,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:26:16,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264711462] [2025-04-13 21:26:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264711462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:26:16,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040012941] [2025-04-13 21:26:16,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:26:16,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:26:16,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:26:16,377 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:26:16,379 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:26:16,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 21:26:16,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:26:16,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:26:16,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:26:16,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:26:16,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:26:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:17,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:26:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:26:19,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040012941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:26:19,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:26:19,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2025-04-13 21:26:19,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581324986] [2025-04-13 21:26:19,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:26:19,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2025-04-13 21:26:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:26:19,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2025-04-13 21:26:19,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=8517, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 21:26:19,162 INFO L87 Difference]: Start difference. First operand 226050 states and 741510 transitions. Second operand has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:27:38,362 INFO L93 Difference]: Finished difference Result 321638 states and 1039910 transitions. [2025-04-13 21:27:38,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2025-04-13 21:27:38,363 INFO L79 Accepts]: Start accepts. Automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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 41 [2025-04-13 21:27:38,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:27:40,428 INFO L225 Difference]: With dead ends: 321638 [2025-04-13 21:27:40,428 INFO L226 Difference]: Without dead ends: 321392 [2025-04-13 21:27:40,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23773 ImplicationChecksByTransitivity, 23.2s TimeCoverageRelationStatistics Valid=13819, Invalid=62081, Unknown=0, NotChecked=0, Total=75900 [2025-04-13 21:27:40,544 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3010 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10779 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3010 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 10779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:27:40,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3010 Valid, 0 Invalid, 11750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 10779 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 21:27:40,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321392 states. [2025-04-13 21:28:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321392 to 258607. [2025-04-13 21:28:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258607 states, 258606 states have (on average 3.3615886715698786) internal successors, (869327), 258606 states have internal predecessors, (869327), 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:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258607 states to 258607 states and 869327 transitions. [2025-04-13 21:28:20,339 INFO L79 Accepts]: Start accepts. Automaton has 258607 states and 869327 transitions. Word has length 41 [2025-04-13 21:28:20,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:28:20,340 INFO L485 AbstractCegarLoop]: Abstraction has 258607 states and 869327 transitions. [2025-04-13 21:28:20,340 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 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:20,340 INFO L278 IsEmpty]: Start isEmpty. Operand 258607 states and 869327 transitions. [2025-04-13 21:28:20,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:28:20,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:28:20,513 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:28:20,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 21:28:20,713 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:28:20,714 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:28:20,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:28:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1183224926, now seen corresponding path program 2 times [2025-04-13 21:28:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:28:20,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653937087] [2025-04-13 21:28:20,715 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:28:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:28:20,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 21:28:20,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:28:20,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:28:20,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:28:22,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653937087] [2025-04-13 21:28:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653937087] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:28:22,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [866248442] [2025-04-13 21:28:22,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:28:22,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:22,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:28:22,230 INFO L229 MonitoredProcess]: Starting monitored process 9 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:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 21:28:22,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 21:28:22,342 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:28:22,342 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:28:22,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:22,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:28:22,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:28:24,206 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 300 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:24,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:28:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:25,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [866248442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:28:25,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:28:25,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:28:25,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985001746] [2025-04-13 21:28:25,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:28:25,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:28:25,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:28:25,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:28:25,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=8663, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:28:25,825 INFO L87 Difference]: Start difference. First operand 258607 states and 869327 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:30:25,476 INFO L93 Difference]: Finished difference Result 358341 states and 1168369 transitions. [2025-04-13 21:30:25,480 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2025-04-13 21:30:25,480 INFO L79 Accepts]: Start accepts. Automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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 41 [2025-04-13 21:30:25,480 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:30:28,623 INFO L225 Difference]: With dead ends: 358341 [2025-04-13 21:30:28,624 INFO L226 Difference]: Without dead ends: 358029 [2025-04-13 21:30:28,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29625 ImplicationChecksByTransitivity, 31.2s TimeCoverageRelationStatistics Valid=17076, Invalid=72624, Unknown=0, NotChecked=0, Total=89700 [2025-04-13 21:30:28,777 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10194 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 11263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 10194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:30:28,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3304 Valid, 0 Invalid, 11263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 10194 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 21:30:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358029 states. [2025-04-13 21:31:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358029 to 283761. [2025-04-13 21:31:16,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283761 states, 283760 states have (on average 3.4176557654355793) internal successors, (969794), 283760 states have internal predecessors, (969794), 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:31:18,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283761 states to 283761 states and 969794 transitions. [2025-04-13 21:31:18,879 INFO L79 Accepts]: Start accepts. Automaton has 283761 states and 969794 transitions. Word has length 41 [2025-04-13 21:31:18,879 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:31:18,881 INFO L485 AbstractCegarLoop]: Abstraction has 283761 states and 969794 transitions. [2025-04-13 21:31:18,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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:31:18,881 INFO L278 IsEmpty]: Start isEmpty. Operand 283761 states and 969794 transitions. [2025-04-13 21:31:19,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 21:31:19,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:31:19,656 INFO L218 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:31:19,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 21:31:19,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-13 21:31:19,861 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:31:19,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:31:19,862 INFO L85 PathProgramCache]: Analyzing trace with hash 17209882, now seen corresponding path program 3 times [2025-04-13 21:31:19,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:31:19,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455980049] [2025-04-13 21:31:19,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:31:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:31:19,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 14 equivalence classes. [2025-04-13 21:31:20,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:31:20,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-04-13 21:31:20,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:23,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:31:23,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455980049] [2025-04-13 21:31:23,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455980049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:31:23,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737861415] [2025-04-13 21:31:23,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:31:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:31:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:31:23,030 INFO L229 MonitoredProcess]: Starting monitored process 10 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:23,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 21:31:23,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 14 equivalence classes. [2025-04-13 21:31:23,186 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 21:31:23,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2025-04-13 21:31:23,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:31:23,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-13 21:31:23,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:31:25,788 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 300 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:25,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:31:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 0 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:31:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737861415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:31:28,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:31:28,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2025-04-13 21:31:28,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599810792] [2025-04-13 21:31:28,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:31:28,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-04-13 21:31:28,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:31:28,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-04-13 21:31:28,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1435, Invalid=8665, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 21:31:28,054 INFO L87 Difference]: Start difference. First operand 283761 states and 969794 transitions. Second operand has 101 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 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:33:24,557 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:33:24,560 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:33:24,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2025-04-13 21:33:24,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31908 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=19205, Invalid=77205, Unknown=0, NotChecked=0, Total=96410 [2025-04-13 21:33:24,576 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 3055 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12349 mSolverCounterSat, 1078 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 13427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1078 IncrementalHoareTripleChecker+Valid, 12349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 21:33:24,576 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 0 Invalid, 13427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1078 Valid, 12349 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 21:33:24,578 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:33:24,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 21:33:24,780 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 21:33:24,780 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (283761states) and FLOYD_HOARE automaton (currently 216 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (273051 states constructed, input type IntersectNwa). [2025-04-13 21:33:24,783 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:33:24,784 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:33:24,792 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1] [2025-04-13 21:33:24,801 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:33:24,801 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:33:24,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:33:24 BasicIcfg [2025-04-13 21:33:24,810 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:33:24,814 INFO L158 Benchmark]: Toolchain (without parser) took 752243.72ms. Allocated memory was 155.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 106.9MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2025-04-13 21:33:24,814 INFO L158 Benchmark]: CDTParser took 1.15ms. Allocated memory is still 159.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:24,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.25ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 84.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:33:24,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.41ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:33:24,815 INFO L158 Benchmark]: Boogie Preprocessor took 37.72ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:33:24,815 INFO L158 Benchmark]: IcfgBuilder took 391.00ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 55.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 21:33:24,815 INFO L158 Benchmark]: TraceAbstraction took 751418.83ms. Allocated memory was 155.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 54.2MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-13 21:33:24,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.15ms. Allocated memory is still 159.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 352.25ms. Allocated memory is still 155.2MB. Free memory was 106.9MB in the beginning and 84.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.41ms. Allocated memory is still 155.2MB. Free memory was 84.3MB in the beginning and 82.6MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.72ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 81.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 391.00ms. Allocated memory is still 155.2MB. Free memory was 81.0MB in the beginning and 55.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 751418.83ms. Allocated memory was 155.2MB in the beginning and 5.2GB in the end (delta: 5.0GB). Free memory was 54.2MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 4.2GB. 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 (283761states) and FLOYD_HOARE automaton (currently 216 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (273051 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 (283761states) and FLOYD_HOARE automaton (currently 216 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (273051 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 (283761states) and FLOYD_HOARE automaton (currently 216 states, 101 states before enhancement),while ReachableStatesComputation was computing reachable states (273051 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: 751.3s, OverallIterations: 10, TraceHistogramMax: 26, PathProgramHistogramMax: 5, EmptinessCheckTime: 1.1s, AutomataDifference: 597.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23138 SdHoareTripleChecker+Valid, 22.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23138 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 18.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 5908 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55015 IncrementalHoareTripleChecker+Invalid, 60923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5908 mSolverCounterUnsat, 0 mSDtfsCounter, 55015 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2456 GetRequests, 189 SyntacticMatches, 20 SemanticMatches, 2247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675767 ImplicationChecksByTransitivity, 315.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283761occurred in iteration=9, InterpolantAutomatonStates: 1585, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 121.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 184942 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 27.1s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 9870 SizeOfPredicates, 150 NumberOfNonLiveVariables, 2399 ConjunctsInSsa, 498 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 1500/6075 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