/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/weaver/popl20-bad-threaded-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:44:12,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:44:12,905 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 22:44:12,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:44:12,910 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:44:12,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:44:12,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:44:12,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:44:12,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:44:12,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:44:12,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:44:12,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:44:12,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:44:12,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:44:12,936 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:44:12,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:44:12,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:44:12,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:44:12,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:44:12,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:44:12,938 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 22:44:13,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:44:13,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:44:13,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:44:13,161 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:44:13,162 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:44:13,162 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 22:44:14,496 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d6422b0/bcbc72eb745040049ffa57676d340db0/FLAG3ad5593c6 [2025-04-13 22:44:14,681 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:44:14,682 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2025-04-13 22:44:14,689 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d6422b0/bcbc72eb745040049ffa57676d340db0/FLAG3ad5593c6 [2025-04-13 22:44:15,546 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0d6422b0/bcbc72eb745040049ffa57676d340db0 [2025-04-13 22:44:15,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:44:15,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:44:15,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:44:15,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:44:15,557 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:44:15,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9637c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15, skipping insertion in model container [2025-04-13 22:44:15,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:44:15,723 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 22:44:15,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:44:15,734 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:44:15,753 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2502,2515] [2025-04-13 22:44:15,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:44:15,764 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:44:15,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15 WrapperNode [2025-04-13 22:44:15,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:44:15,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:44:15,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:44:15,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:44:15,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,787 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2025-04-13 22:44:15,788 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:44:15,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:44:15,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:44:15,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:44:15,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,810 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 22:44:15,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:44:15,825 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:44:15,825 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:44:15,825 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:44:15,826 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (1/1) ... [2025-04-13 22:44:15,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:44:15,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:15,855 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 22:44:15,859 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 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:44:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:44:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:44:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:44:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:44:15,873 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 22:44:15,935 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:44:15,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:44:16,060 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:44:16,061 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:44:16,061 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:44:16,192 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:44:16,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:44:16 BoogieIcfgContainer [2025-04-13 22:44:16,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:44:16,193 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:44:16,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:44:16,199 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:44:16,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:44:15" (1/3) ... [2025-04-13 22:44:16,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c7414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:44:16, skipping insertion in model container [2025-04-13 22:44:16,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:44:15" (2/3) ... [2025-04-13 22:44:16,200 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d2c7414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:44:16, skipping insertion in model container [2025-04-13 22:44:16,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:44:16" (3/3) ... [2025-04-13 22:44:16,201 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2025-04-13 22:44:16,209 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:44:16,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-threaded-sum-2.wvr.c that has 3 procedures, 23 locations, 22 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-13 22:44:16,211 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:44:16,244 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:44:16,266 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 24 transitions, 62 flow [2025-04-13 22:44:16,286 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 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 22:44:16,304 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:44:16,311 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;@2a6f64c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:44:16,311 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:44:16,312 INFO L278 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 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 22:44:16,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:44:16,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:16,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:16,317 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:44:16,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1300027828, now seen corresponding path program 1 times [2025-04-13 22:44:16,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:16,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760057832] [2025-04-13 22:44:16,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:44:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:16,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:44:16,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:44:16,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:16,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:16,690 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 22:44:16,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:16,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760057832] [2025-04-13 22:44:16,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760057832] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:16,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:16,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:44:16,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101585998] [2025-04-13 22:44:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:16,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:44:16,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:16,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:44:16,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:44:16,712 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 2.3773584905660377) internal successors, (252), 106 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 22:44:16,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:16,804 INFO L93 Difference]: Finished difference Result 161 states and 382 transitions. [2025-04-13 22:44:16,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:44:16,806 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2025-04-13 22:44:16,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:16,815 INFO L225 Difference]: With dead ends: 161 [2025-04-13 22:44:16,815 INFO L226 Difference]: Without dead ends: 146 [2025-04-13 22:44:16,817 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:44:16,818 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:16,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:44:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-13 22:44:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2025-04-13 22:44:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.3865546218487395) internal successors, (284), 119 states have internal predecessors, (284), 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 22:44:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 284 transitions. [2025-04-13 22:44:16,856 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 284 transitions. Word has length 14 [2025-04-13 22:44:16,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:16,856 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 284 transitions. [2025-04-13 22:44:16,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 22:44:16,856 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 284 transitions. [2025-04-13 22:44:16,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 22:44:16,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:16,859 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:16,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:44:16,860 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 22:44:16,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:16,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1146357193, now seen corresponding path program 1 times [2025-04-13 22:44:16,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:16,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110635196] [2025-04-13 22:44:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:44:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:16,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 22:44:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 22:44:16,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:16,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:17,562 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 22:44:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:17,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110635196] [2025-04-13 22:44:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110635196] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:17,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:17,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:44:17,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78765842] [2025-04-13 22:44:17,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:17,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:44:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:17,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:44:17,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:44:17,564 INFO L87 Difference]: Start difference. First operand 120 states and 284 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 22:44:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:18,133 INFO L93 Difference]: Finished difference Result 248 states and 593 transitions. [2025-04-13 22:44:18,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:44:18,133 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-04-13 22:44:18,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:18,135 INFO L225 Difference]: With dead ends: 248 [2025-04-13 22:44:18,135 INFO L226 Difference]: Without dead ends: 204 [2025-04-13 22:44:18,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:44:18,136 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 85 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:18,136 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 31 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:44:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-04-13 22:44:18,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2025-04-13 22:44:18,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.409937888198758) internal successors, (388), 161 states have internal predecessors, (388), 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 22:44:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 388 transitions. [2025-04-13 22:44:18,167 INFO L79 Accepts]: Start accepts. Automaton has 162 states and 388 transitions. Word has length 18 [2025-04-13 22:44:18,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:18,167 INFO L485 AbstractCegarLoop]: Abstraction has 162 states and 388 transitions. [2025-04-13 22:44:18,167 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 22:44:18,168 INFO L278 IsEmpty]: Start isEmpty. Operand 162 states and 388 transitions. [2025-04-13 22:44:18,169 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:44:18,169 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:18,169 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:18,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:44:18,169 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 22:44:18,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:18,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1415990413, now seen corresponding path program 1 times [2025-04-13 22:44:18,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:18,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2552471] [2025-04-13 22:44:18,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:44:18,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:18,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:44:18,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:44:18,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:18,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:18,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2552471] [2025-04-13 22:44:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2552471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:44:18,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675943663] [2025-04-13 22:44:18,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:44:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:18,561 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 22:44:18,562 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 22:44:18,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:44:18,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:44:18,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:44:18,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:18,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:44:18,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:44:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:18,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:44:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:19,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675943663] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:44:19,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:44:19,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 22:44:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596593154] [2025-04-13 22:44:19,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:44:19,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:44:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:19,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:44:19,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:44:19,166 INFO L87 Difference]: Start difference. First operand 162 states and 388 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 22:44:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:20,749 INFO L93 Difference]: Finished difference Result 544 states and 1298 transitions. [2025-04-13 22:44:20,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 22:44:20,749 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 22:44:20,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:20,752 INFO L225 Difference]: With dead ends: 544 [2025-04-13 22:44:20,752 INFO L226 Difference]: Without dead ends: 516 [2025-04-13 22:44:20,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=572, Invalid=2850, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:44:20,754 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 350 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:20,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 92 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:44:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-13 22:44:20,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 336. [2025-04-13 22:44:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 335 states have (on average 2.5104477611940297) internal successors, (841), 335 states have internal predecessors, (841), 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 22:44:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 841 transitions. [2025-04-13 22:44:20,817 INFO L79 Accepts]: Start accepts. Automaton has 336 states and 841 transitions. Word has length 21 [2025-04-13 22:44:20,817 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:20,817 INFO L485 AbstractCegarLoop]: Abstraction has 336 states and 841 transitions. [2025-04-13 22:44:20,817 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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 22:44:20,817 INFO L278 IsEmpty]: Start isEmpty. Operand 336 states and 841 transitions. [2025-04-13 22:44:20,819 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:44:20,819 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:20,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:20,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 22:44:21,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:21,020 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 22:44:21,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1037514501, now seen corresponding path program 2 times [2025-04-13 22:44:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:21,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807214575] [2025-04-13 22:44:21,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:21,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:44:21,038 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:44:21,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:44:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:21,457 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 22:44:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:21,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807214575] [2025-04-13 22:44:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807214575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:44:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86438565] [2025-04-13 22:44:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:21,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:44:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:21,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:44:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:44:21,459 INFO L87 Difference]: Start difference. First operand 336 states and 841 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:21,739 INFO L93 Difference]: Finished difference Result 441 states and 1110 transitions. [2025-04-13 22:44:21,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:44:21,740 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:21,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:21,743 INFO L225 Difference]: With dead ends: 441 [2025-04-13 22:44:21,743 INFO L226 Difference]: Without dead ends: 424 [2025-04-13 22:44:21,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:44:21,745 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:21,745 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 37 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:44:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-04-13 22:44:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 346. [2025-04-13 22:44:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 2.5159420289855072) internal successors, (868), 345 states have internal predecessors, (868), 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 22:44:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 868 transitions. [2025-04-13 22:44:21,789 INFO L79 Accepts]: Start accepts. Automaton has 346 states and 868 transitions. Word has length 21 [2025-04-13 22:44:21,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:21,790 INFO L485 AbstractCegarLoop]: Abstraction has 346 states and 868 transitions. [2025-04-13 22:44:21,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:21,790 INFO L278 IsEmpty]: Start isEmpty. Operand 346 states and 868 transitions. [2025-04-13 22:44:21,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 22:44:21,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:21,791 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:21,791 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:44:21,791 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 22:44:21,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:21,791 INFO L85 PathProgramCache]: Analyzing trace with hash -119564311, now seen corresponding path program 3 times [2025-04-13 22:44:21,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:21,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448651295] [2025-04-13 22:44:21,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:44:21,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:21,795 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 1 equivalence classes. [2025-04-13 22:44:21,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 22:44:21,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:44:21,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:22,100 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 22:44:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:22,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448651295] [2025-04-13 22:44:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448651295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:22,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:22,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:44:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855405724] [2025-04-13 22:44:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:22,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:44:22,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:22,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:44:22,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:44:22,102 INFO L87 Difference]: Start difference. First operand 346 states and 868 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:22,374 INFO L93 Difference]: Finished difference Result 497 states and 1258 transitions. [2025-04-13 22:44:22,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:44:22,374 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:22,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:22,376 INFO L225 Difference]: With dead ends: 497 [2025-04-13 22:44:22,376 INFO L226 Difference]: Without dead ends: 480 [2025-04-13 22:44:22,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:44:22,377 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:22,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 41 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:44:22,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-04-13 22:44:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 354. [2025-04-13 22:44:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 2.5269121813031163) internal successors, (892), 353 states have internal predecessors, (892), 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 22:44:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 892 transitions. [2025-04-13 22:44:22,406 INFO L79 Accepts]: Start accepts. Automaton has 354 states and 892 transitions. Word has length 21 [2025-04-13 22:44:22,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:22,406 INFO L485 AbstractCegarLoop]: Abstraction has 354 states and 892 transitions. [2025-04-13 22:44:22,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 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 22:44:22,407 INFO L278 IsEmpty]: Start isEmpty. Operand 354 states and 892 transitions. [2025-04-13 22:44:22,407 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:44:22,407 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:22,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:22,407 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:44:22,407 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 22:44:22,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:22,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1149313338, now seen corresponding path program 2 times [2025-04-13 22:44:22,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:22,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843791193] [2025-04-13 22:44:22,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:22,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:22,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:44:22,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:44:22,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:44:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:22,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:22,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843791193] [2025-04-13 22:44:22,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843791193] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:44:22,917 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080599891] [2025-04-13 22:44:22,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:22,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:22,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:44:22,919 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 22:44:22,920 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 22:44:22,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:44:22,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:44:22,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:44:22,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:22,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 22:44:22,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:44:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:31,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:44:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:44:31,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080599891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:44:31,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:44:31,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-04-13 22:44:31,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242395831] [2025-04-13 22:44:31,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:44:31,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:44:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:31,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:44:31,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=561, Unknown=2, NotChecked=0, Total=702 [2025-04-13 22:44:31,875 INFO L87 Difference]: Start difference. First operand 354 states and 892 transitions. Second operand has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 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 22:44:44,203 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:44:56,344 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:04,533 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 52 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:12,604 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 45 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:22,477 WARN L286 SmtUtils]: Spent 9.40s on a formula simplification. DAG size of input: 67 DAG size of output: 51 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:30,567 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 46 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:38,821 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 59 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:51,611 WARN L286 SmtUtils]: Spent 12.17s on a formula simplification. DAG size of input: 74 DAG size of output: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:45:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:55,266 INFO L93 Difference]: Finished difference Result 1262 states and 3148 transitions. [2025-04-13 22:45:55,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 22:45:55,267 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 22:45:55,267 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:55,271 INFO L225 Difference]: With dead ends: 1262 [2025-04-13 22:45:55,272 INFO L226 Difference]: Without dead ends: 1119 [2025-04-13 22:45:55,275 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 90.1s TimeCoverageRelationStatistics Valid=1761, Invalid=7165, Unknown=4, NotChecked=0, Total=8930 [2025-04-13 22:45:55,276 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 534 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:55,276 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 245 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 22:45:55,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-04-13 22:45:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 480. [2025-04-13 22:45:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 2.5741127348643005) internal successors, (1233), 479 states have internal predecessors, (1233), 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 22:45:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 1233 transitions. [2025-04-13 22:45:55,329 INFO L79 Accepts]: Start accepts. Automaton has 480 states and 1233 transitions. Word has length 22 [2025-04-13 22:45:55,329 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:55,329 INFO L485 AbstractCegarLoop]: Abstraction has 480 states and 1233 transitions. [2025-04-13 22:45:55,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.5384615384615383) internal successors, (66), 26 states have internal predecessors, (66), 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 22:45:55,329 INFO L278 IsEmpty]: Start isEmpty. Operand 480 states and 1233 transitions. [2025-04-13 22:45:55,330 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:45:55,330 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:55,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:55,337 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 22:45:55,535 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,SelfDestructingSolverStorable5 [2025-04-13 22:45:55,535 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 22:45:55,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 99707503, now seen corresponding path program 4 times [2025-04-13 22:45:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:55,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128185587] [2025-04-13 22:45:55,536 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:45:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:55,539 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:45:55,551 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:45:55,551 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:45:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:56,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128185587] [2025-04-13 22:45:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128185587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:56,259 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696704200] [2025-04-13 22:45:56,259 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:45:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:56,261 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 22:45:56,262 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 22:45:56,288 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:45:56,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:45:56,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:45:56,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:56,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 22:45:56,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:45:57,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:46:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:46:06,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696704200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:46:06,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:46:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 33 [2025-04-13 22:46:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467196843] [2025-04-13 22:46:06,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:46:06,261 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:46:06,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:46:06,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:46:06,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:46:06,262 INFO L87 Difference]: Start difference. First operand 480 states and 1233 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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 22:46:12,263 WARN L286 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:46:20,489 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:46:26,029 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:46:30,039 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:46:52,884 WARN L286 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 62 DAG size of output: 59 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:46:56,922 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:47:01,238 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:47:15,281 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:47:19,616 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:47:30,402 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 61 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:47:40,793 WARN L286 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:47:48,082 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:47:57,840 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 61 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:48:17,806 WARN L286 SmtUtils]: Spent 6.52s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:48:36,497 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:48:45,391 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 51 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:49:02,838 WARN L286 SmtUtils]: Spent 9.40s on a formula simplification. DAG size of input: 72 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:49:10,313 WARN L286 SmtUtils]: Spent 7.20s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:49:19,040 WARN L286 SmtUtils]: Spent 7.27s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:49:38,301 WARN L286 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 72 DAG size of output: 45 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:50:21,366 WARN L286 SmtUtils]: Spent 17.05s on a formula simplification. DAG size of input: 67 DAG size of output: 40 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:50:36,647 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 48 DAG size of output: 26 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:50:46,737 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:51:08,786 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 61 DAG size of output: 33 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:51:41,846 WARN L286 SmtUtils]: Spent 24.40s on a formula simplification. DAG size of input: 52 DAG size of output: 30 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:52:18,914 WARN L286 SmtUtils]: Spent 24.62s on a formula simplification. DAG size of input: 59 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:52:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:52:42,553 INFO L93 Difference]: Finished difference Result 1355 states and 3229 transitions. [2025-04-13 22:52:42,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-04-13 22:52:42,553 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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 24 [2025-04-13 22:52:42,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:52:42,558 INFO L225 Difference]: With dead ends: 1355 [2025-04-13 22:52:42,558 INFO L226 Difference]: Without dead ends: 1149 [2025-04-13 22:52:42,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6131 ImplicationChecksByTransitivity, 371.1s TimeCoverageRelationStatistics Valid=2810, Invalid=13682, Unknown=20, NotChecked=0, Total=16512 [2025-04-13 22:52:42,563 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 579 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 86 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 2522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:52:42,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 252 Invalid, 2522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2431 Invalid, 5 Unknown, 0 Unchecked, 26.7s Time] [2025-04-13 22:52:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-04-13 22:52:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 720. [2025-04-13 22:52:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 719 states have (on average 2.5827538247566064) internal successors, (1857), 719 states have internal predecessors, (1857), 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 22:52:42,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1857 transitions. [2025-04-13 22:52:42,692 INFO L79 Accepts]: Start accepts. Automaton has 720 states and 1857 transitions. Word has length 24 [2025-04-13 22:52:42,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:52:42,692 INFO L485 AbstractCegarLoop]: Abstraction has 720 states and 1857 transitions. [2025-04-13 22:52:42,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 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 22:52:42,692 INFO L278 IsEmpty]: Start isEmpty. Operand 720 states and 1857 transitions. [2025-04-13 22:52:42,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:52:42,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:52:42,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:52:42,700 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 22:52:42,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:52:42,894 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 22:52:42,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:52:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1856782713, now seen corresponding path program 5 times [2025-04-13 22:52:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:52:42,895 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595967408] [2025-04-13 22:52:42,895 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:52:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:52:42,898 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:52:42,918 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:52:42,919 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:52:42,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:52:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:52:43,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595967408] [2025-04-13 22:52:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595967408] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:52:43,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987497333] [2025-04-13 22:52:43,648 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:52:43,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:52:43,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:52:43,650 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 22:52:43,651 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 22:52:43,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:52:43,784 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:52:43,785 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:52:43,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:52:43,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:52:43,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:52:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:52:44,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:52:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:52:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987497333] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:52:51,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:52:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2025-04-13 22:52:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986016822] [2025-04-13 22:52:51,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:52:51,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:52:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:52:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:52:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:52:51,394 INFO L87 Difference]: Start difference. First operand 720 states and 1857 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 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 22:52:55,720 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:53:08,304 WARN L286 SmtUtils]: Spent 7.44s on a formula simplification. DAG size of input: 82 DAG size of output: 80 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:53:20,622 WARN L286 SmtUtils]: Spent 11.84s on a formula simplification. DAG size of input: 107 DAG size of output: 89 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:53:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:53:22,241 INFO L93 Difference]: Finished difference Result 1296 states and 3256 transitions. [2025-04-13 22:53:22,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 22:53:22,242 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 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 24 [2025-04-13 22:53:22,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:53:22,247 INFO L225 Difference]: With dead ends: 1296 [2025-04-13 22:53:22,247 INFO L226 Difference]: Without dead ends: 1212 [2025-04-13 22:53:22,248 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=582, Invalid=1968, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:53:22,248 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 290 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:53:22,248 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 123 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 22:53:22,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-04-13 22:53:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 808. [2025-04-13 22:53:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 2.600991325898389) internal successors, (2099), 807 states have internal predecessors, (2099), 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 22:53:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 2099 transitions. [2025-04-13 22:53:22,409 INFO L79 Accepts]: Start accepts. Automaton has 808 states and 2099 transitions. Word has length 24 [2025-04-13 22:53:22,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:53:22,409 INFO L485 AbstractCegarLoop]: Abstraction has 808 states and 2099 transitions. [2025-04-13 22:53:22,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 23 states have internal predecessors, (67), 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 22:53:22,409 INFO L278 IsEmpty]: Start isEmpty. Operand 808 states and 2099 transitions. [2025-04-13 22:53:22,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:53:22,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:53:22,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:53:22,417 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 22:53:22,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:53:22,611 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 22:53:22,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:53:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1520234393, now seen corresponding path program 6 times [2025-04-13 22:53:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:53:22,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120190841] [2025-04-13 22:53:22,612 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:53:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:53:22,615 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:53:22,634 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:53:22,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:53:22,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:53:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:53:23,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120190841] [2025-04-13 22:53:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120190841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:53:23,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859171350] [2025-04-13 22:53:23,484 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:53:23,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:53:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:53:23,485 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 22:53:23,487 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 22:53:23,510 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 2 equivalence classes. [2025-04-13 22:53:23,581 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:53:23,582 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 22:53:23,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:53:23,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 22:53:23,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:53:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:53:32,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:53:34,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:53:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859171350] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:53:34,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:53:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 23 [2025-04-13 22:53:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188015260] [2025-04-13 22:53:34,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:53:34,696 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:53:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:53:34,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:53:34,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=479, Unknown=2, NotChecked=0, Total=600 [2025-04-13 22:53:34,696 INFO L87 Difference]: Start difference. First operand 808 states and 2099 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 22:54:00,199 WARN L286 SmtUtils]: Spent 20.09s on a formula simplification. DAG size of input: 54 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:54:20,470 WARN L286 SmtUtils]: Spent 20.12s on a formula simplification. DAG size of input: 66 DAG size of output: 46 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:54:36,676 WARN L286 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 64 DAG size of output: 39 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:54:49,132 WARN L286 SmtUtils]: Spent 12.14s on a formula simplification. DAG size of input: 76 DAG size of output: 49 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:55:00,710 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:55:05,945 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:55:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:13,124 INFO L93 Difference]: Finished difference Result 1548 states and 3849 transitions. [2025-04-13 22:55:13,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 22:55:13,125 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 24 [2025-04-13 22:55:13,125 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:13,130 INFO L225 Difference]: With dead ends: 1548 [2025-04-13 22:55:13,131 INFO L226 Difference]: Without dead ends: 1431 [2025-04-13 22:55:13,132 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 96.9s TimeCoverageRelationStatistics Valid=987, Invalid=5015, Unknown=4, NotChecked=0, Total=6006 [2025-04-13 22:55:13,134 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 315 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:13,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 178 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1462 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2025-04-13 22:55:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2025-04-13 22:55:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 900. [2025-04-13 22:55:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 899 states have (on average 2.6195773081201335) internal successors, (2355), 899 states have internal predecessors, (2355), 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 22:55:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 2355 transitions. [2025-04-13 22:55:13,349 INFO L79 Accepts]: Start accepts. Automaton has 900 states and 2355 transitions. Word has length 24 [2025-04-13 22:55:13,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:13,349 INFO L485 AbstractCegarLoop]: Abstraction has 900 states and 2355 transitions. [2025-04-13 22:55:13,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 22:55:13,349 INFO L278 IsEmpty]: Start isEmpty. Operand 900 states and 2355 transitions. [2025-04-13 22:55:13,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:55:13,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:13,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:55:13,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:55:13,552 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:13,552 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 22:55:13,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:13,553 INFO L85 PathProgramCache]: Analyzing trace with hash -2036146408, now seen corresponding path program 7 times [2025-04-13 22:55:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:13,553 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034609613] [2025-04-13 22:55:13,553 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:55:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:13,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:55:13,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:55:13,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:55:13,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:13,658 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 22:55:13,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:13,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034609613] [2025-04-13 22:55:13,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034609613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:55:13,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:55:13,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 22:55:13,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082345365] [2025-04-13 22:55:13,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:55:13,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 22:55:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:13,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 22:55:13,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:55:13,660 INFO L87 Difference]: Start difference. First operand 900 states and 2355 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 22:55:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:55:14,180 INFO L93 Difference]: Finished difference Result 1295 states and 3381 transitions. [2025-04-13 22:55:14,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:55:14,181 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2025-04-13 22:55:14,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:55:14,186 INFO L225 Difference]: With dead ends: 1295 [2025-04-13 22:55:14,186 INFO L226 Difference]: Without dead ends: 1267 [2025-04-13 22:55:14,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:55:14,186 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 58 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:55:14,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 14 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:55:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-04-13 22:55:14,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 755. [2025-04-13 22:55:14,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 754 states have (on average 2.603448275862069) internal successors, (1963), 754 states have internal predecessors, (1963), 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 22:55:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1963 transitions. [2025-04-13 22:55:14,377 INFO L79 Accepts]: Start accepts. Automaton has 755 states and 1963 transitions. Word has length 25 [2025-04-13 22:55:14,377 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:55:14,377 INFO L485 AbstractCegarLoop]: Abstraction has 755 states and 1963 transitions. [2025-04-13 22:55:14,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 22:55:14,378 INFO L278 IsEmpty]: Start isEmpty. Operand 755 states and 1963 transitions. [2025-04-13 22:55:14,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:55:14,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:55:14,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:55:14,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 22:55:14,379 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:55:14,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:55:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1197359237, now seen corresponding path program 8 times [2025-04-13 22:55:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:55:14,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992984742] [2025-04-13 22:55:14,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:55:14,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:55:14,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:55:14,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:14,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:27,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:55:27,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992984742] [2025-04-13 22:55:27,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992984742] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:55:27,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956110256] [2025-04-13 22:55:27,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:55:27,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:55:27,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:55:27,874 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 22:55:27,875 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 22:55:27,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:55:27,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:55:27,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:55:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:55:27,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:55:27,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:55:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:33,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:55:36,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:55:36,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956110256] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:55:36,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:55:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2025-04-13 22:55:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613524148] [2025-04-13 22:55:36,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:55:36,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:55:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:55:36,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:55:36,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=606, Unknown=1, NotChecked=0, Total=756 [2025-04-13 22:55:36,475 INFO L87 Difference]: Start difference. First operand 755 states and 1963 transitions. Second operand has 28 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 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 22:55:48,962 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:56:29,028 WARN L286 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 91 DAG size of output: 83 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:56:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:56:30,418 INFO L93 Difference]: Finished difference Result 1609 states and 4004 transitions. [2025-04-13 22:56:30,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 22:56:30,419 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:56:30,419 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:56:30,424 INFO L225 Difference]: With dead ends: 1609 [2025-04-13 22:56:30,424 INFO L226 Difference]: Without dead ends: 1535 [2025-04-13 22:56:30,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=1166, Invalid=5313, Unknown=1, NotChecked=0, Total=6480 [2025-04-13 22:56:30,426 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 322 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:56:30,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 268 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-04-13 22:56:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-04-13 22:56:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 949. [2025-04-13 22:56:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 948 states have (on average 2.619198312236287) internal successors, (2483), 948 states have internal predecessors, (2483), 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 22:56:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2483 transitions. [2025-04-13 22:56:30,666 INFO L79 Accepts]: Start accepts. Automaton has 949 states and 2483 transitions. Word has length 27 [2025-04-13 22:56:30,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:56:30,666 INFO L485 AbstractCegarLoop]: Abstraction has 949 states and 2483 transitions. [2025-04-13 22:56:30,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.0) internal successors, (81), 27 states have internal predecessors, (81), 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 22:56:30,666 INFO L278 IsEmpty]: Start isEmpty. Operand 949 states and 2483 transitions. [2025-04-13 22:56:30,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:56:30,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:56:30,668 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:56:30,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 22:56:30,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:30,868 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:56:30,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:56:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2115309427, now seen corresponding path program 9 times [2025-04-13 22:56:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:56:30,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989065659] [2025-04-13 22:56:30,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:56:30,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:56:30,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:56:30,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:56:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:31,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:56:31,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989065659] [2025-04-13 22:56:31,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989065659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:56:31,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545540497] [2025-04-13 22:56:31,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:56:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:56:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:56:31,475 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 22:56:31,478 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 22:56:31,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-04-13 22:56:31,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:56:31,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:56:31,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:56:31,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:56:31,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:56:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:32,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:56:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:56:39,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545540497] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:56:39,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:56:39,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 25 [2025-04-13 22:56:39,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748399561] [2025-04-13 22:56:39,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:56:39,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:56:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:56:39,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:56:39,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=548, Unknown=1, NotChecked=0, Total=702 [2025-04-13 22:56:39,732 INFO L87 Difference]: Start difference. First operand 949 states and 2483 transitions. Second operand has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 22:56:49,456 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:57:11,135 WARN L286 SmtUtils]: Spent 15.78s on a formula simplification. DAG size of input: 76 DAG size of output: 71 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:57:17,028 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 43 DAG size of output: 38 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:57:22,555 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:57:28,000 WARN L286 SmtUtils]: Spent 5.22s on a formula simplification. DAG size of input: 83 DAG size of output: 78 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:57:36,701 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:58:07,639 WARN L286 SmtUtils]: Spent 30.50s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:58:16,219 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 76 DAG size of output: 73 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-13 22:58:22,840 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:58:27,293 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-04-13 22:58:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:58:36,334 INFO L93 Difference]: Finished difference Result 1899 states and 4749 transitions. [2025-04-13 22:58:36,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 22:58:36,334 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 22:58:36,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:58:36,341 INFO L225 Difference]: With dead ends: 1899 [2025-04-13 22:58:36,341 INFO L226 Difference]: Without dead ends: 1780 [2025-04-13 22:58:36,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 96.7s TimeCoverageRelationStatistics Valid=1425, Invalid=6945, Unknown=2, NotChecked=0, Total=8372 [2025-04-13 22:58:36,343 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 416 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 44 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:36,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 214 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1668 Invalid, 5 Unknown, 0 Unchecked, 26.3s Time] [2025-04-13 22:58:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states. [2025-04-13 22:58:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1097. [2025-04-13 22:58:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1097 states, 1096 states have (on average 2.6386861313868613) internal successors, (2892), 1096 states have internal predecessors, (2892), 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 22:58:36,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 2892 transitions. [2025-04-13 22:58:36,666 INFO L79 Accepts]: Start accepts. Automaton has 1097 states and 2892 transitions. Word has length 27 [2025-04-13 22:58:36,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:58:36,666 INFO L485 AbstractCegarLoop]: Abstraction has 1097 states and 2892 transitions. [2025-04-13 22:58:36,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.923076923076923) internal successors, (76), 26 states have internal predecessors, (76), 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 22:58:36,666 INFO L278 IsEmpty]: Start isEmpty. Operand 1097 states and 2892 transitions. [2025-04-13 22:58:36,668 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:58:36,668 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:58:36,668 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:58:36,674 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 22:58:36,868 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:36,868 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:58:36,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:58:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1539423392, now seen corresponding path program 10 times [2025-04-13 22:58:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:58:36,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308914466] [2025-04-13 22:58:36,869 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:36,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:58:36,872 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:58:36,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:58:36,881 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:36,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:37,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:58:37,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308914466] [2025-04-13 22:58:37,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308914466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:58:37,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56898843] [2025-04-13 22:58:37,315 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:58:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:58:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:58:37,317 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 22:58:37,318 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 22:58:37,342 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:58:37,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:58:37,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:58:37,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:58:37,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 22:58:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:58:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:42,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:58:47,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:58:47,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56898843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:58:47,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:58:47,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2025-04-13 22:58:47,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100633976] [2025-04-13 22:58:47,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:58:47,115 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:58:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:58:47,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:58:47,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=759, Unknown=1, NotChecked=0, Total=930 [2025-04-13 22:58:47,116 INFO L87 Difference]: Start difference. First operand 1097 states and 2892 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 30 states have internal predecessors, (79), 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 22:58:49,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:58:49,883 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=367, Invalid=1702, Unknown=1, NotChecked=0, Total=2070 [2025-04-13 22:58:49,883 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 118 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:58:49,883 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 129 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 22:58:49,886 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:58:49,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 22:58:49,893 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:58:49,926 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 22:58:50,086 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,SelfDestructingSolverStorable12 [2025-04-13 22:58:50,087 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1097states) and FLOYD_HOARE automaton (currently 24 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. [2025-04-13 22:58:50,088 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:58:50,088 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:58:50,090 INFO L422 BasicCegarLoop]: Path program histogram: [10, 2, 1] [2025-04-13 22:58:50,092 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:58:50,092 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:58:50,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:58:50 BasicIcfg [2025-04-13 22:58:50,093 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:58:50,094 INFO L158 Benchmark]: Toolchain (without parser) took 874544.30ms. Allocated memory was 155.2MB in the beginning and 423.6MB in the end (delta: 268.4MB). Free memory was 110.4MB in the beginning and 211.2MB in the end (delta: -100.8MB). Peak memory consumption was 168.1MB. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 95.9MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.04ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 94.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: Boogie Preprocessor took 36.43ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: IcfgBuilder took 366.89ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 65.7MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 22:58:50,094 INFO L158 Benchmark]: TraceAbstraction took 873899.96ms. Allocated memory was 155.2MB in the beginning and 423.6MB in the end (delta: 268.4MB). Free memory was 64.9MB in the beginning and 211.2MB in the end (delta: -146.3MB). Peak memory consumption was 126.2MB. Max. memory is 8.0GB. [2025-04-13 22:58:50,095 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 214.51ms. Allocated memory is still 155.2MB. Free memory was 110.4MB in the beginning and 95.9MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.04ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 94.2MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.43ms. Allocated memory is still 155.2MB. Free memory was 94.2MB in the beginning and 92.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 366.89ms. Allocated memory is still 155.2MB. Free memory was 92.5MB in the beginning and 65.7MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 873899.96ms. Allocated memory was 155.2MB in the beginning and 423.6MB in the end (delta: 268.4MB). Free memory was 64.9MB in the beginning and 211.2MB in the end (delta: -146.3MB). Peak memory consumption was 126.2MB. 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: 95]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (1097states) and FLOYD_HOARE automaton (currently 24 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1097states) and FLOYD_HOARE automaton (currently 24 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1097states) and FLOYD_HOARE automaton (currently 24 states, 31 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 46 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 873.8s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 785.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 3195 SdHoareTripleChecker+Valid, 79.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3195 mSDsluCounter, 1635 SdHoareTripleChecker+Invalid, 78.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1496 mSDsCounter, 396 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12799 IncrementalHoareTripleChecker+Invalid, 13207 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 396 mSolverCounterUnsat, 139 mSDtfsCounter, 12799 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 926 GetRequests, 254 SyntacticMatches, 9 SemanticMatches, 662 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18156 ImplicationChecksByTransitivity, 763.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1097occurred in iteration=12, InterpolantAutomatonStates: 566, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 4236 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 83.8s InterpolantComputationTime, 493 NumberOfCodeBlocks, 493 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 661 ConstructedInterpolants, 0 QuantifiedInterpolants, 21024 SizeOfPredicates, 66 NumberOfNonLiveVariables, 850 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 0/99 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