/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:23:28,290 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:23:28,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 23:23:28,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:23:28,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:23:28,361 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:23:28,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:23:28,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:23:28,362 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:23:28,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:23:28,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:23:28,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:23:28,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:23:28,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:23:28,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:23:28,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:28,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:23:28,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:28,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:23:28,366 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:23:28,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:23:28,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:23:28,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:23:28,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:23:28,582 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:23:28,583 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-13 23:23:29,864 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c6472a/827592236b594efcaf7805088f506641/FLAG21fee34a4 [2025-04-13 23:23:30,044 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:23:30,044 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-13 23:23:30,051 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c6472a/827592236b594efcaf7805088f506641/FLAG21fee34a4 [2025-04-13 23:23:30,914 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b25c6472a/827592236b594efcaf7805088f506641 [2025-04-13 23:23:30,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:23:30,918 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:23:30,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:23:30,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:23:30,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:23:30,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:23:30" (1/1) ... [2025-04-13 23:23:30,923 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a22045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:30, skipping insertion in model container [2025-04-13 23:23:30,923 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:23:30" (1/1) ... [2025-04-13 23:23:30,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:23:31,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-13 23:23:31,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:23:31,064 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:23:31,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c[2032,2045] [2025-04-13 23:23:31,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:23:31,102 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:23:31,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31 WrapperNode [2025-04-13 23:23:31,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:23:31,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:23:31,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:23:31,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:23:31,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,127 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 92 [2025-04-13 23:23:31,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:23:31,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:23:31,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:23:31,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:23:31,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,150 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 23:23:31,150 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,154 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:23:31,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:23:31,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:23:31,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:23:31,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (1/1) ... [2025-04-13 23:23:31,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:23:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:23:31,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 23:23:31,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 23:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:23:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:23:31,209 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:23:31,209 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:23:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:23:31,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:23:31,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:23:31,210 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:23:31,276 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:23:31,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:23:31,433 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:23:31,434 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:23:31,434 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:23:31,553 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:23:31,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:23:31 BoogieIcfgContainer [2025-04-13 23:23:31,554 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:23:31,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:23:31,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:23:31,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:23:31,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:23:30" (1/3) ... [2025-04-13 23:23:31,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef1caab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:23:31, skipping insertion in model container [2025-04-13 23:23:31,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:23:31" (2/3) ... [2025-04-13 23:23:31,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef1caab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:23:31, skipping insertion in model container [2025-04-13 23:23:31,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:23:31" (3/3) ... [2025-04-13 23:23:31,564 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-04-13 23:23:31,573 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:23:31,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy6.wvr.c that has 3 procedures, 32 locations, 29 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 23:23:31,574 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:23:31,603 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:23:31,624 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 31 transitions, 76 flow [2025-04-13 23:23:31,652 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 279 states, 278 states have (on average 2.258992805755396) internal successors, (628), 278 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:31,669 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:23:31,676 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;@2ae3e700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:23:31,676 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 23:23:31,679 INFO L278 IsEmpty]: Start isEmpty. Operand has 279 states, 278 states have (on average 2.258992805755396) internal successors, (628), 278 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:31,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:31,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:31,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:31,691 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 23:23:31,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:31,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1314799830, now seen corresponding path program 1 times [2025-04-13 23:23:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:31,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589371834] [2025-04-13 23:23:31,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:23:31,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:31,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:31,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:31,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:31,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:32,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589371834] [2025-04-13 23:23:32,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589371834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:32,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997703817] [2025-04-13 23:23:32,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:32,172 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:32,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:32,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:32,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:32,189 INFO L87 Difference]: Start difference. First operand has 279 states, 278 states have (on average 2.258992805755396) internal successors, (628), 278 states have internal predecessors, (628), 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 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:32,377 INFO L93 Difference]: Finished difference Result 361 states and 776 transitions. [2025-04-13 23:23:32,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:23:32,379 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:32,379 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:32,387 INFO L225 Difference]: With dead ends: 361 [2025-04-13 23:23:32,387 INFO L226 Difference]: Without dead ends: 290 [2025-04-13 23:23:32,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:32,393 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:32,394 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 13 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-04-13 23:23:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 237. [2025-04-13 23:23:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.2161016949152543) internal successors, (523), 236 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 523 transitions. [2025-04-13 23:23:32,437 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 523 transitions. Word has length 28 [2025-04-13 23:23:32,437 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:32,437 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 523 transitions. [2025-04-13 23:23:32,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,439 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 523 transitions. [2025-04-13 23:23:32,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:32,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:32,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:23:32,440 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 23:23:32,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -943514148, now seen corresponding path program 2 times [2025-04-13 23:23:32,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:32,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365061888] [2025-04-13 23:23:32,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:23:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:32,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:32,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:32,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:32,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:32,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365061888] [2025-04-13 23:23:32,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365061888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:32,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:32,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:23:32,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177548618] [2025-04-13 23:23:32,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:32,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:32,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:32,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:32,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:32,587 INFO L87 Difference]: Start difference. First operand 237 states and 523 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:32,768 INFO L93 Difference]: Finished difference Result 423 states and 920 transitions. [2025-04-13 23:23:32,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:23:32,768 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:32,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:32,771 INFO L225 Difference]: With dead ends: 423 [2025-04-13 23:23:32,771 INFO L226 Difference]: Without dead ends: 364 [2025-04-13 23:23:32,772 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:32,773 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 99 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:32,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 12 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-04-13 23:23:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 267. [2025-04-13 23:23:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.210526315789474) internal successors, (588), 266 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 588 transitions. [2025-04-13 23:23:32,790 INFO L79 Accepts]: Start accepts. Automaton has 267 states and 588 transitions. Word has length 28 [2025-04-13 23:23:32,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:32,790 INFO L485 AbstractCegarLoop]: Abstraction has 267 states and 588 transitions. [2025-04-13 23:23:32,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:32,790 INFO L278 IsEmpty]: Start isEmpty. Operand 267 states and 588 transitions. [2025-04-13 23:23:32,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:32,795 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:32,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:32,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:23:32,796 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 23:23:32,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1822173710, now seen corresponding path program 3 times [2025-04-13 23:23:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:32,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255409895] [2025-04-13 23:23:32,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:23:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:32,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:32,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:32,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:23:32,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:32,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:32,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255409895] [2025-04-13 23:23:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255409895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:32,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 23:23:32,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169363276] [2025-04-13 23:23:32,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:32,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:32,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:32,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:32,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:32,930 INFO L87 Difference]: Start difference. First operand 267 states and 588 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,051 INFO L93 Difference]: Finished difference Result 320 states and 683 transitions. [2025-04-13 23:23:33,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:23:33,051 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:33,051 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,052 INFO L225 Difference]: With dead ends: 320 [2025-04-13 23:23:33,052 INFO L226 Difference]: Without dead ends: 173 [2025-04-13 23:23:33,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:33,053 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 79 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 12 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-04-13 23:23:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2025-04-13 23:23:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.120805369127517) internal successors, (316), 149 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 316 transitions. [2025-04-13 23:23:33,058 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 316 transitions. Word has length 28 [2025-04-13 23:23:33,058 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,058 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 316 transitions. [2025-04-13 23:23:33,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,059 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 316 transitions. [2025-04-13 23:23:33,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:33,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,059 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:23:33,059 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 23:23:33,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1264805582, now seen corresponding path program 4 times [2025-04-13 23:23:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588179167] [2025-04-13 23:23:33,060 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:23:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,065 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:23:33,077 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:33,077 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:23:33,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:33,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588179167] [2025-04-13 23:23:33,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588179167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:33,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:33,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:23:33,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165201067] [2025-04-13 23:23:33,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:23:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:23:33,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:23:33,133 INFO L87 Difference]: Start difference. First operand 150 states and 316 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,178 INFO L93 Difference]: Finished difference Result 210 states and 432 transitions. [2025-04-13 23:23:33,179 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:23:33,179 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:33,179 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,180 INFO L225 Difference]: With dead ends: 210 [2025-04-13 23:23:33,180 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 23:23:33,180 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 23:23:33,180 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,181 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 5 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:23:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 23:23:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-04-13 23:23:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.0805369127516777) internal successors, (310), 149 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 310 transitions. [2025-04-13 23:23:33,185 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 310 transitions. Word has length 28 [2025-04-13 23:23:33,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,185 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 310 transitions. [2025-04-13 23:23:33,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,185 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 310 transitions. [2025-04-13 23:23:33,185 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:33,185 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,185 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:23:33,185 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 23:23:33,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash -756093102, now seen corresponding path program 5 times [2025-04-13 23:23:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812008504] [2025-04-13 23:23:33,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:23:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,190 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:33,194 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:33,194 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:23:33,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:33,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812008504] [2025-04-13 23:23:33,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812008504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:33,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:33,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:23:33,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353742426] [2025-04-13 23:23:33,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,286 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:33,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:33,287 INFO L87 Difference]: Start difference. First operand 150 states and 310 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,428 INFO L93 Difference]: Finished difference Result 294 states and 587 transitions. [2025-04-13 23:23:33,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:23:33,428 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:33,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,429 INFO L225 Difference]: With dead ends: 294 [2025-04-13 23:23:33,429 INFO L226 Difference]: Without dead ends: 226 [2025-04-13 23:23:33,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:23:33,430 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 95 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 9 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-04-13 23:23:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 150. [2025-04-13 23:23:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.0671140939597317) internal successors, (308), 149 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 308 transitions. [2025-04-13 23:23:33,439 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 308 transitions. Word has length 28 [2025-04-13 23:23:33,439 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,439 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 308 transitions. [2025-04-13 23:23:33,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,439 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 308 transitions. [2025-04-13 23:23:33,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:33,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,440 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:23:33,441 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 23:23:33,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1184841748, now seen corresponding path program 6 times [2025-04-13 23:23:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919460949] [2025-04-13 23:23:33,442 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:23:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,449 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:33,453 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:33,453 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:23:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:33,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919460949] [2025-04-13 23:23:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919460949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:33,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:33,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:23:33,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956481321] [2025-04-13 23:23:33,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:33,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:33,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:33,556 INFO L87 Difference]: Start difference. First operand 150 states and 308 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,658 INFO L93 Difference]: Finished difference Result 214 states and 434 transitions. [2025-04-13 23:23:33,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:33,658 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:33,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,659 INFO L225 Difference]: With dead ends: 214 [2025-04-13 23:23:33,659 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 23:23:33,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:33,660 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:23:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 23:23:33,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-04-13 23:23:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.030534351145038) internal successors, (266), 131 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 266 transitions. [2025-04-13 23:23:33,663 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 266 transitions. Word has length 28 [2025-04-13 23:23:33,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,663 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 266 transitions. [2025-04-13 23:23:33,664 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,664 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 266 transitions. [2025-04-13 23:23:33,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:23:33,664 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:23:33,664 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:23:33,664 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:23:33,664 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 23:23:33,665 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:23:33,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1709897442, now seen corresponding path program 7 times [2025-04-13 23:23:33,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:23:33,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061147004] [2025-04-13 23:23:33,665 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:23:33,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:23:33,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:23:33,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:23:33,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:23:33,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:23:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:23:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:23:33,733 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061147004] [2025-04-13 23:23:33,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061147004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:23:33,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:23:33,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:23:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105097498] [2025-04-13 23:23:33,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:23:33,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:23:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:33,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:23:33,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:23:33,734 INFO L87 Difference]: Start difference. First operand 132 states and 266 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:23:33,794 INFO L93 Difference]: Finished difference Result 132 states and 266 transitions. [2025-04-13 23:23:33,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:23:33,794 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-04-13 23:23:33,794 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:23:33,795 INFO L225 Difference]: With dead ends: 132 [2025-04-13 23:23:33,795 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 23:23:33,795 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:23:33,795 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 41 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:23:33,796 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 9 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:23:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 23:23:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 23:23:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 23:23:33,796 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-04-13 23:23:33,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:23:33,796 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 23:23:33,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:23:33,797 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 23:23:33,797 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 23:23:33,798 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 23:23:33,799 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 23:23:33,799 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 23:23:33,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:23:33,801 INFO L422 BasicCegarLoop]: Path program histogram: [7] [2025-04-13 23:23:33,802 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:23:33,802 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:23:33,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:23:33 BasicIcfg [2025-04-13 23:23:33,804 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:23:33,804 INFO L158 Benchmark]: Toolchain (without parser) took 2886.43ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 55.8MB in the end (delta: 44.7MB). Peak memory consumption was 47.6MB. Max. memory is 8.0GB. [2025-04-13 23:23:33,804 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:33,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.62ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 86.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:23:33,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:23:33,805 INFO L158 Benchmark]: Boogie Preprocessor took 33.74ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:23:33,805 INFO L158 Benchmark]: IcfgBuilder took 391.89ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 56.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 23:23:33,805 INFO L158 Benchmark]: TraceAbstraction took 2246.57ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 55.8MB in the end (delta: 204.7kB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. [2025-04-13 23:23:33,806 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.62ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 86.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.53ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.74ms. Allocated memory is still 142.6MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 391.89ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 56.0MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2246.57ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 55.8MB in the end (delta: 204.7kB). Peak memory consumption was 1.5MB. 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 - PositiveResult [Line: 80]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 56 locations, 55 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 444 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 444 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 249 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 189 ConstructedInterpolants, 0 QuantifiedInterpolants, 659 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 23:23:33,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...