/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/fib_safe-10.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:20:49,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:20:49,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:20:49,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:20:49,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:20:49,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:20:49,846 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:20:49,846 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:20:49,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:20:49,846 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:20:49,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:20:49,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:20:49,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:20:49,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:20:49,848 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:49,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:20:49,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:20:49,849 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 21:20:50,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:20:50,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:20:50,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:20:50,073 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:20:50,075 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:20:50,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_safe-10.i [2025-04-13 21:20:51,411 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7d211dd/31859e08aabd4379b6d048bd7eb090e4/FLAG3ea57d45f [2025-04-13 21:20:51,646 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:20:51,647 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i [2025-04-13 21:20:51,656 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7d211dd/31859e08aabd4379b6d048bd7eb090e4/FLAG3ea57d45f [2025-04-13 21:20:52,462 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7d211dd/31859e08aabd4379b6d048bd7eb090e4 [2025-04-13 21:20:52,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:20:52,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:20:52,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:20:52,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:20:52,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62097261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52, skipping insertion in model container [2025-04-13 21:20:52,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:20:52,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i[30241,30254] [2025-04-13 21:20:52,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,736 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:20:52,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_safe-10.i[30241,30254] [2025-04-13 21:20:52,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:20:52,804 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:20:52,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52 WrapperNode [2025-04-13 21:20:52,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:20:52,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:20:52,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:20:52,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,819 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,835 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 21:20:52,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:20:52,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:20:52,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:20:52,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 21:20:52,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:20:52,876 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 21:20:52,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 21:20:52,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 21:20:52,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (1/1) ... [2025-04-13 21:20:52,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:20:52,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:52,900 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:20:52,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:20:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 21:20:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 21:20:52,921 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 21:20:52,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 21:20:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 21:20:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:20:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:20:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 21:20:52,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:20:52,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:20:52,923 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:20:53,026 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 21:20:53,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:20:53,163 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:20:53,163 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:20:53,163 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 21:20:53,272 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:53,279 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:20:53,284 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:20:53,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:53 BoogieIcfgContainer [2025-04-13 21:20:53,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 21:20:53,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:20:53,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:20:53,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:20:53,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:20:52" (1/3) ... [2025-04-13 21:20:53,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300e1a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:53, skipping insertion in model container [2025-04-13 21:20:53,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:20:52" (2/3) ... [2025-04-13 21:20:53,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300e1a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:20:53, skipping insertion in model container [2025-04-13 21:20:53,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 09:20:53" (3/3) ... [2025-04-13 21:20:53,291 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_safe-10.i [2025-04-13 21:20:53,302 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:20:53,303 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_safe-10.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 21:20:53,303 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:20:53,342 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 21:20:53,365 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 21:20:53,381 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,406 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:20:53,416 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;@6f29b4ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:20:53,416 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:20:53,418 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,423 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 21:20:53,423 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,424 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,424 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:53,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1578653316, now seen corresponding path program 1 times [2025-04-13 21:20:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443401528] [2025-04-13 21:20:53,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 21:20:53,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 21:20:53,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:53,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443401528] [2025-04-13 21:20:53,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443401528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:20:53,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:20:53,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:20:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341814318] [2025-04-13 21:20:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:20:53,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:20:53,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:53,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:20:53,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:53,660 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:53,741 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 21:20:53,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:20:53,744 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-13 21:20:53,745 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:53,750 INFO L225 Difference]: With dead ends: 173 [2025-04-13 21:20:53,750 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 21:20:53,755 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:20:53,757 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:53,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 21:20:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 21:20:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 21:20:53,805 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 21:20:53,805 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:53,805 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 21:20:53,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:53,805 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 21:20:53,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 21:20:53,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:53,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:53,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:20:53,808 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:53,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:53,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1693576751, now seen corresponding path program 1 times [2025-04-13 21:20:53,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:53,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982561840] [2025-04-13 21:20:53,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:53,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:53,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:53,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:53,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:53,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982561840] [2025-04-13 21:20:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982561840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:53,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897054519] [2025-04-13 21:20:53,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:20:53,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:53,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:53,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:53,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 21:20:53,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 21:20:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 21:20:53,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:20:53,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:53,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:20:53,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897054519] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 21:20:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356413927] [2025-04-13 21:20:54,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:20:54,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:20:54,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:54,044 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,146 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 21:20:54,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 21:20:54,147 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-04-13 21:20:54,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,150 INFO L225 Difference]: With dead ends: 205 [2025-04-13 21:20:54,150 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 21:20:54,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:20:54,151 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:54,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:54,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 21:20:54,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 21:20:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 21:20:54,172 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 21:20:54,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,172 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 21:20:54,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,172 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 21:20:54,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 21:20:54,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,173 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 21:20:54,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,379 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:54,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 328624452, now seen corresponding path program 2 times [2025-04-13 21:20:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:54,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861523839] [2025-04-13 21:20:54,380 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:54,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:54,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:54,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861523839] [2025-04-13 21:20:54,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861523839] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:54,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582272077] [2025-04-13 21:20:54,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:20:54,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:54,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:54,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:54,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 21:20:54,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 21:20:54,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 21:20:54,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:20:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:54,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 21:20:54,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:54,571 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:54,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582272077] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:54,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:54,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 21:20:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373923462] [2025-04-13 21:20:54,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:54,628 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 21:20:54,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:54,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 21:20:54,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:54,631 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:54,779 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 21:20:54,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 21:20:54,780 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 21:20:54,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:54,782 INFO L225 Difference]: With dead ends: 301 [2025-04-13 21:20:54,782 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 21:20:54,782 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 21:20:54,783 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:54,783 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 21:20:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 21:20:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 21:20:54,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 21:20:54,799 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 21:20:54,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:54,799 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 21:20:54,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:54,800 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 21:20:54,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 21:20:54,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:54,801 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:54,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:20:55,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-13 21:20:55,002 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:55,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:55,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2090552988, now seen corresponding path program 3 times [2025-04-13 21:20:55,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:55,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720163320] [2025-04-13 21:20:55,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:55,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:55,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,031 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:55,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:55,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720163320] [2025-04-13 21:20:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720163320] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:55,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887641513] [2025-04-13 21:20:55,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:20:55,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:55,227 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:55,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 21:20:55,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 21:20:55,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 21:20:55,286 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 21:20:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:55,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 21:20:55,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,324 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:20:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:55,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887641513] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:20:55,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:20:55,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-13 21:20:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186472094] [2025-04-13 21:20:55,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:20:55,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 21:20:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:20:55,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 21:20:55,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:55,512 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:20:55,780 INFO L93 Difference]: Finished difference Result 493 states and 1637 transitions. [2025-04-13 21:20:55,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 21:20:55,780 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 21:20:55,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:20:55,783 INFO L225 Difference]: With dead ends: 493 [2025-04-13 21:20:55,784 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 21:20:55,784 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-13 21:20:55,785 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 21:20:55,785 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 21:20:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 21:20:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2025-04-13 21:20:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 2.9662162162162162) internal successors, (1317), 444 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1317 transitions. [2025-04-13 21:20:55,828 INFO L79 Accepts]: Start accepts. Automaton has 445 states and 1317 transitions. Word has length 21 [2025-04-13 21:20:55,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:20:55,828 INFO L485 AbstractCegarLoop]: Abstraction has 445 states and 1317 transitions. [2025-04-13 21:20:55,829 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.4) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:20:55,830 INFO L278 IsEmpty]: Start isEmpty. Operand 445 states and 1317 transitions. [2025-04-13 21:20:55,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 21:20:55,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:20:55,832 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:20:55,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 21:20:56,033 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:56,033 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:20:56,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:20:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1826129500, now seen corresponding path program 4 times [2025-04-13 21:20:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:20:56,034 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682823418] [2025-04-13 21:20:56,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:20:56,041 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:56,075 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:56,075 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:56,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:20:57,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682823418] [2025-04-13 21:20:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682823418] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:20:57,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074701329] [2025-04-13 21:20:57,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:20:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:20:57,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:20:57,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:20:57,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 21:20:57,509 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 21:20:57,534 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 21:20:57,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:20:57,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:20:57,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-04-13 21:20:57,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:20:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:20:58,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:21:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:21:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074701329] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:21:00,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:21:00,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2025-04-13 21:21:00,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771844109] [2025-04-13 21:21:00,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:21:00,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-04-13 21:21:00,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:21:00,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-04-13 21:21:00,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1202, Invalid=5604, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 21:21:00,212 INFO L87 Difference]: Start difference. First operand 445 states and 1317 transitions. Second operand has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:23:55,155 INFO L93 Difference]: Finished difference Result 58698 states and 176323 transitions. [2025-04-13 21:23:55,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1038 states. [2025-04-13 21:23:55,155 INFO L79 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 21:23:55,155 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:23:55,450 INFO L225 Difference]: With dead ends: 58698 [2025-04-13 21:23:55,450 INFO L226 Difference]: Without dead ends: 53899 [2025-04-13 21:23:55,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1103 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1093 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607241 ImplicationChecksByTransitivity, 153.9s TimeCoverageRelationStatistics Valid=229840, Invalid=968090, Unknown=0, NotChecked=0, Total=1197930 [2025-04-13 21:23:55,569 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 5400 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15368 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5400 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 16449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 15368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-04-13 21:23:55,570 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5400 Valid, 0 Invalid, 16449 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1081 Valid, 15368 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-04-13 21:23:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53899 states. [2025-04-13 21:23:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53899 to 19490. [2025-04-13 21:23:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19490 states, 19489 states have (on average 3.081173995587254) internal successors, (60049), 19489 states have internal predecessors, (60049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19490 states to 19490 states and 60049 transitions. [2025-04-13 21:23:58,993 INFO L79 Accepts]: Start accepts. Automaton has 19490 states and 60049 transitions. Word has length 33 [2025-04-13 21:23:58,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:23:58,994 INFO L485 AbstractCegarLoop]: Abstraction has 19490 states and 60049 transitions. [2025-04-13 21:23:58,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 1.2073170731707317) internal successors, (99), 82 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:23:58,994 INFO L278 IsEmpty]: Start isEmpty. Operand 19490 states and 60049 transitions. [2025-04-13 21:23:59,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:23:59,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:23:59,016 INFO L218 NwaCegarLoop]: trace histogram [22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:23:59,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 21:23:59,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:23:59,220 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:23:59,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:23:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash -909753575, now seen corresponding path program 1 times [2025-04-13 21:23:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:23:59,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140197330] [2025-04-13 21:23:59,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:23:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:23:59,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:23:59,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:23:59,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:23:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:24:00,533 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:00,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:24:00,533 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140197330] [2025-04-13 21:24:00,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140197330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:24:00,534 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052447341] [2025-04-13 21:24:00,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:24:00,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:24:00,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:24:00,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:24:00,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 21:24:00,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:24:00,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:24:00,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:24:00,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:24:00,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:24:00,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:24:01,784 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 210 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:01,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:24:03,193 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:24:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052447341] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:24:03,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:24:03,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2025-04-13 21:24:03,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932552619] [2025-04-13 21:24:03,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:24:03,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2025-04-13 21:24:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:24:03,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2025-04-13 21:24:03,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1096, Invalid=6736, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 21:24:03,196 INFO L87 Difference]: Start difference. First operand 19490 states and 60049 transitions. Second operand has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:27:19,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:27:19,055 INFO L93 Difference]: Finished difference Result 190104 states and 596010 transitions. [2025-04-13 21:27:19,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 738 states. [2025-04-13 21:27:19,056 INFO L79 Accepts]: Start accepts. Automaton has has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 21:27:19,056 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:27:20,038 INFO L225 Difference]: With dead ends: 190104 [2025-04-13 21:27:20,038 INFO L226 Difference]: Without dead ends: 187789 [2025-04-13 21:27:20,139 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 817 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316054 ImplicationChecksByTransitivity, 130.1s TimeCoverageRelationStatistics Valid=130192, Invalid=539750, Unknown=0, NotChecked=0, Total=669942 [2025-04-13 21:27:20,140 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 9564 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10455 mSolverCounterSat, 1652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9564 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 12107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1652 IncrementalHoareTripleChecker+Valid, 10455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-04-13 21:27:20,140 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9564 Valid, 0 Invalid, 12107 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1652 Valid, 10455 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2025-04-13 21:27:20,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187789 states. [2025-04-13 21:28:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187789 to 156601. [2025-04-13 21:28:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156601 states, 156600 states have (on average 3.2818646232439335) internal successors, (513940), 156600 states have internal predecessors, (513940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:05,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156601 states to 156601 states and 513940 transitions. [2025-04-13 21:28:05,387 INFO L79 Accepts]: Start accepts. Automaton has 156601 states and 513940 transitions. Word has length 37 [2025-04-13 21:28:05,387 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:28:05,387 INFO L485 AbstractCegarLoop]: Abstraction has 156601 states and 513940 transitions. [2025-04-13 21:28:05,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:28:05,388 INFO L278 IsEmpty]: Start isEmpty. Operand 156601 states and 513940 transitions. [2025-04-13 21:28:05,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:28:05,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:28:05,475 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:28:05,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 21:28:05,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:05,676 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:28:05,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:28:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash -915298826, now seen corresponding path program 1 times [2025-04-13 21:28:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:28:05,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111199225] [2025-04-13 21:28:05,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:28:05,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:28:05,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:28:05,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:28:05,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:28:05,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:28:06,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111199225] [2025-04-13 21:28:06,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111199225] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:28:06,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467389499] [2025-04-13 21:28:06,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:28:06,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:28:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:28:06,748 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:28:06,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 21:28:06,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 21:28:06,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:28:06,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:28:06,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:28:06,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:28:06,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:28:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:08,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:28:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:28:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467389499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:28:09,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:28:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 21:28:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961916546] [2025-04-13 21:28:09,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:28:09,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 21:28:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:28:09,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 21:28:09,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1049, Invalid=6607, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 21:28:09,492 INFO L87 Difference]: Start difference. First operand 156601 states and 513940 transitions. Second operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:29:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 21:29:48,901 INFO L93 Difference]: Finished difference Result 224270 states and 727262 transitions. [2025-04-13 21:29:48,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2025-04-13 21:29:48,902 INFO L79 Accepts]: Start accepts. Automaton has has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 21:29:48,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 21:29:50,819 INFO L225 Difference]: With dead ends: 224270 [2025-04-13 21:29:50,819 INFO L226 Difference]: Without dead ends: 224048 [2025-04-13 21:29:50,908 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17765 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=10305, Invalid=47055, Unknown=0, NotChecked=0, Total=57360 [2025-04-13 21:29:50,909 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 2326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8269 mSolverCounterSat, 692 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 8961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 692 IncrementalHoareTripleChecker+Valid, 8269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 21:29:50,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 0 Invalid, 8961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [692 Valid, 8269 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 21:29:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224048 states. [2025-04-13 21:30:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224048 to 180423. [2025-04-13 21:30:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180423 states, 180422 states have (on average 3.364722705656738) internal successors, (607070), 180422 states have internal predecessors, (607070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:30:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180423 states to 180423 states and 607070 transitions. [2025-04-13 21:30:47,730 INFO L79 Accepts]: Start accepts. Automaton has 180423 states and 607070 transitions. Word has length 37 [2025-04-13 21:30:47,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 21:30:47,730 INFO L485 AbstractCegarLoop]: Abstraction has 180423 states and 607070 transitions. [2025-04-13 21:30:47,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:30:47,731 INFO L278 IsEmpty]: Start isEmpty. Operand 180423 states and 607070 transitions. [2025-04-13 21:30:47,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 21:30:47,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 21:30:47,844 INFO L218 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:30:47,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 21:30:48,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:30:48,045 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 21:30:48,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:30:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash -426918626, now seen corresponding path program 2 times [2025-04-13 21:30:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:30:48,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468122558] [2025-04-13 21:30:48,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:30:48,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:30:48,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 21:30:48,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:30:48,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:30:48,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:30:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:30:49,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:30:49,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468122558] [2025-04-13 21:30:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468122558] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:30:49,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373568113] [2025-04-13 21:30:49,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:30:49,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:30:49,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:30:49,273 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 21:30:49,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 21:30:49,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 21:30:49,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 21:30:49,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:30:49,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:30:49,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-13 21:30:49,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:30:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 210 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:30:50,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:30:51,701 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:30:51,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373568113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:30:51,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:30:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2025-04-13 21:30:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123385481] [2025-04-13 21:30:51,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:30:51,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2025-04-13 21:30:51,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:30:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2025-04-13 21:30:51,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1246, Invalid=6410, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 21:30:51,703 INFO L87 Difference]: Start difference. First operand 180423 states and 607070 transitions. Second operand has 88 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 21:34:36,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 663 states. [2025-04-13 21:34:36,730 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 724 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242646 ImplicationChecksByTransitivity, 119.1s TimeCoverageRelationStatistics Valid=109617, Invalid=416733, Unknown=0, NotChecked=0, Total=526350 [2025-04-13 21:34:36,731 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 4425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18042 mSolverCounterSat, 1037 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4425 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 19079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1037 IncrementalHoareTripleChecker+Valid, 18042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2025-04-13 21:34:36,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4425 Valid, 0 Invalid, 19079 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1037 Valid, 18042 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2025-04-13 21:34:36,732 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:34:36,732 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:34:36,734 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 21:34:36,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 21:34:36,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:34:36,935 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (180423states) and FLOYD_HOARE automaton (currently 663 states, 88 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-34-1 term,while SimplifyDDA2 was simplifying 34 xjuncts wrt. a ATOM-1 context. [2025-04-13 21:34:36,936 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:34:36,936 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:34:36,938 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2025-04-13 21:34:36,940 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:34:36,940 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:34:36,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:34:36 BasicIcfg [2025-04-13 21:34:36,942 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:34:36,942 INFO L158 Benchmark]: Toolchain (without parser) took 824477.84ms. Allocated memory was 155.2MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 105.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-13 21:34:36,942 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:34:36,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.96ms. Allocated memory is still 155.2MB. Free memory was 105.7MB in the beginning and 83.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 21:34:36,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.31ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:34:36,943 INFO L158 Benchmark]: Boogie Preprocessor took 40.34ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:34:36,943 INFO L158 Benchmark]: IcfgBuilder took 408.26ms. Allocated memory is still 155.2MB. Free memory was 79.6MB in the beginning and 53.0MB in the end (delta: 26.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 21:34:36,943 INFO L158 Benchmark]: TraceAbstraction took 823655.22ms. Allocated memory was 155.2MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 52.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2025-04-13 21:34:36,946 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 339.96ms. Allocated memory is still 155.2MB. Free memory was 105.7MB in the beginning and 83.7MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.31ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.6MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.34ms. Allocated memory is still 155.2MB. Free memory was 81.6MB in the beginning and 79.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 408.26ms. Allocated memory is still 155.2MB. Free memory was 79.6MB in the beginning and 53.0MB in the end (delta: 26.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 823655.22ms. Allocated memory was 155.2MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 52.3MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (180423states) and FLOYD_HOARE automaton (currently 663 states, 88 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-34-1 term,while SimplifyDDA2 was simplifying 34 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (180423states) and FLOYD_HOARE automaton (currently 663 states, 88 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-34-1 term,while SimplifyDDA2 was simplifying 34 xjuncts wrt. a ATOM-1 context. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (180423states) and FLOYD_HOARE automaton (currently 663 states, 88 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-34-1 term,while SimplifyDDA2 was simplifying 34 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 823.6s, OverallIterations: 8, TraceHistogramMax: 22, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.2s, AutomataDifference: 699.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22331 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22331 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 21.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52595 IncrementalHoareTripleChecker+Invalid, 57072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4477 mSolverCounterUnsat, 0 mSDtfsCounter, 52595 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3044 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 2912 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183766 ImplicationChecksByTransitivity, 420.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180423occurred in iteration=7, InterpolantAutomatonStates: 1981, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 104.8s AutomataMinimizationTime, 7 MinimizatonAttempts, 109222 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 16.1s InterpolantComputationTime, 395 NumberOfCodeBlocks, 395 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 565 ConstructedInterpolants, 0 QuantifiedInterpolants, 7243 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1621 ConjunctsInSsa, 335 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 840/3174 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown