/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -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 18:50:58,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:50:58,244 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 18:50:58,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:50:58,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:50:58,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:50:58,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:50:58,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:50:58,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:50:58,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:50:58,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:50:58,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:50:58,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:50:58,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:50:58,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:50:58,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:50:58,274 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:50:58,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:50:58,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:50:58,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:50:58,275 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:50:58,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:50:58,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:50:58,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:50:58,275 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:50:58,275 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 [2025-04-13 18:50:58,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:50:58,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:50:58,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:50:58,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:50:58,517 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:50:58,518 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 18:51:00,428 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75d6ba5c/dc2257bd91ab42b4a932311b03dad74b/FLAG04c735694 [2025-04-13 18:51:00,615 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:51:00,616 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2025-04-13 18:51:00,621 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75d6ba5c/dc2257bd91ab42b4a932311b03dad74b/FLAG04c735694 [2025-04-13 18:51:01,478 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75d6ba5c/dc2257bd91ab42b4a932311b03dad74b [2025-04-13 18:51:01,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:51:01,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:51:01,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:01,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:51:01,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:51:01,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2d82b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01, skipping insertion in model container [2025-04-13 18:51:01,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:51:01,634 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 18:51:01,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:01,643 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:51:01,662 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 18:51:01,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:51:01,672 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:51:01,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01 WrapperNode [2025-04-13 18:51:01,673 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:51:01,674 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:01,674 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:51:01,674 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:51:01,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,685 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,703 INFO L138 Inliner]: procedures = 18, calls = 13, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 92 [2025-04-13 18:51:01,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:51:01,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:51:01,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:51:01,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:51:01,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,730 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 18:51:01,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:51:01,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:51:01,737 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:51:01,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:51:01,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (1/1) ... [2025-04-13 18:51:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:51:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:51:01,765 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 18:51:01,769 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 18:51:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:51:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:51:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:51:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:51:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:51:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:51:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:51:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:51:01,786 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:51:01,848 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:51:01,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:51:01,996 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:51:01,996 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:51:01,997 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:51:02,128 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:51:02,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:02 BoogieIcfgContainer [2025-04-13 18:51:02,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:51:02,130 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:51:02,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:51:02,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:51:02,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:51:01" (1/3) ... [2025-04-13 18:51:02,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655ab841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:02, skipping insertion in model container [2025-04-13 18:51:02,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:51:01" (2/3) ... [2025-04-13 18:51:02,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655ab841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:51:02, skipping insertion in model container [2025-04-13 18:51:02,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:51:02" (3/3) ... [2025-04-13 18:51:02,134 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2025-04-13 18:51:02,143 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:51:02,144 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 18:51:02,144 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:51:02,183 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 18:51:02,205 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 31 transitions, 76 flow [2025-04-13 18:51:02,236 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 18:51:02,252 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:51:02,261 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;@5093046, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:51:02,261 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 18:51:02,264 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 18:51:02,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:02,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:02,271 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 18:51:02,271 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 18:51:02,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:02,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1594084410, now seen corresponding path program 1 times [2025-04-13 18:51:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:02,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571563190] [2025-04-13 18:51:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:51:02,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:02,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:02,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:02,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:02,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:02,672 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 18:51:02,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:02,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571563190] [2025-04-13 18:51:02,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571563190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:02,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:02,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:51:02,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920527607] [2025-04-13 18:51:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:02,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:02,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:02,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:02,698 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 18:51:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:02,859 INFO L93 Difference]: Finished difference Result 361 states and 776 transitions. [2025-04-13 18:51:02,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:51:02,861 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 18:51:02,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:02,869 INFO L225 Difference]: With dead ends: 361 [2025-04-13 18:51:02,869 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 18:51:02,872 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 18:51:02,873 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 87 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:02,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 90 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 18:51:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 224. [2025-04-13 18:51:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.2286995515695067) internal successors, (497), 223 states have internal predecessors, (497), 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 18:51:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 497 transitions. [2025-04-13 18:51:02,906 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 497 transitions. Word has length 28 [2025-04-13 18:51:02,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:02,907 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 497 transitions. [2025-04-13 18:51:02,907 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 18:51:02,907 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 497 transitions. [2025-04-13 18:51:02,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:02,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:02,908 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 18:51:02,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:51:02,908 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 18:51:02,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash 504688616, now seen corresponding path program 2 times [2025-04-13 18:51:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:02,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257696181] [2025-04-13 18:51:02,909 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:02,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:02,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:02,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:02,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:02,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:03,073 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 18:51:03,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:03,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257696181] [2025-04-13 18:51:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257696181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:03,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076420646] [2025-04-13 18:51:03,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:03,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:03,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:03,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:03,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:03,078 INFO L87 Difference]: Start difference. First operand 224 states and 497 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 18:51:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:03,231 INFO L93 Difference]: Finished difference Result 452 states and 984 transitions. [2025-04-13 18:51:03,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:03,231 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 18:51:03,231 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:03,234 INFO L225 Difference]: With dead ends: 452 [2025-04-13 18:51:03,234 INFO L226 Difference]: Without dead ends: 326 [2025-04-13 18:51:03,236 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:51:03,236 INFO L437 NwaCegarLoop]: 29 mSDtfsCounter, 86 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:03,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 105 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:03,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-04-13 18:51:03,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 192. [2025-04-13 18:51:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.2041884816753927) internal successors, (421), 191 states have internal predecessors, (421), 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 18:51:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 421 transitions. [2025-04-13 18:51:03,251 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 421 transitions. Word has length 28 [2025-04-13 18:51:03,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:03,251 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 421 transitions. [2025-04-13 18:51:03,251 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 18:51:03,252 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 421 transitions. [2025-04-13 18:51:03,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:03,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:03,252 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 18:51:03,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:51:03,253 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 18:51:03,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash -43692056, now seen corresponding path program 3 times [2025-04-13 18:51:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:03,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077320659] [2025-04-13 18:51:03,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:03,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:03,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:03,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:03,334 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 18:51:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:03,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077320659] [2025-04-13 18:51:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077320659] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:03,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:51:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636055607] [2025-04-13 18:51:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:03,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:51:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:03,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:51:03,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:03,335 INFO L87 Difference]: Start difference. First operand 192 states and 421 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 18:51:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:03,355 INFO L93 Difference]: Finished difference Result 246 states and 528 transitions. [2025-04-13 18:51:03,355 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:51:03,355 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 18:51:03,356 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:03,357 INFO L225 Difference]: With dead ends: 246 [2025-04-13 18:51:03,357 INFO L226 Difference]: Without dead ends: 184 [2025-04-13 18:51:03,358 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 18:51:03,358 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:03,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 31 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:03,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-04-13 18:51:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-04-13 18:51:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 2.191256830601093) internal successors, (401), 183 states have internal predecessors, (401), 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 18:51:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 401 transitions. [2025-04-13 18:51:03,368 INFO L79 Accepts]: Start accepts. Automaton has 184 states and 401 transitions. Word has length 28 [2025-04-13 18:51:03,368 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:03,368 INFO L485 AbstractCegarLoop]: Abstraction has 184 states and 401 transitions. [2025-04-13 18:51:03,368 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 18:51:03,369 INFO L278 IsEmpty]: Start isEmpty. Operand 184 states and 401 transitions. [2025-04-13 18:51:03,372 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:03,372 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:03,372 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 18:51:03,372 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:51:03,372 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 18:51:03,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash 207430346, now seen corresponding path program 4 times [2025-04-13 18:51:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:03,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917125641] [2025-04-13 18:51:03,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:03,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:03,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:51:03,387 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 18:51:03,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:03,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:03,589 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 18:51:03,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:03,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917125641] [2025-04-13 18:51:03,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917125641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:03,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:03,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 18:51:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597060343] [2025-04-13 18:51:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:03,590 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 18:51:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:03,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 18:51:03,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 18:51:03,591 INFO L87 Difference]: Start difference. First operand 184 states and 401 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 18:51:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:03,726 INFO L93 Difference]: Finished difference Result 272 states and 578 transitions. [2025-04-13 18:51:03,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:03,726 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 18:51:03,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:03,727 INFO L225 Difference]: With dead ends: 272 [2025-04-13 18:51:03,727 INFO L226 Difference]: Without dead ends: 201 [2025-04-13 18:51:03,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:51:03,728 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 119 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:03,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 88 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:03,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-04-13 18:51:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 142. [2025-04-13 18:51:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.099290780141844) internal successors, (296), 141 states have internal predecessors, (296), 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 18:51:03,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 296 transitions. [2025-04-13 18:51:03,733 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 296 transitions. Word has length 28 [2025-04-13 18:51:03,733 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:03,733 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 296 transitions. [2025-04-13 18:51:03,733 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 8 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 18:51:03,733 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 296 transitions. [2025-04-13 18:51:03,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:03,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:03,734 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 18:51:03,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:51:03,734 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 18:51:03,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:03,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1808457704, now seen corresponding path program 5 times [2025-04-13 18:51:03,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:03,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432472736] [2025-04-13 18:51:03,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 18:51:03,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:03,743 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:03,748 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:03,748 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:03,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:03,841 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 18:51:03,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:03,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432472736] [2025-04-13 18:51:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432472736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326302347] [2025-04-13 18:51:03,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:03,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:03,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:03,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:03,843 INFO L87 Difference]: Start difference. First operand 142 states and 296 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 18:51:03,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:03,991 INFO L93 Difference]: Finished difference Result 334 states and 686 transitions. [2025-04-13 18:51:03,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:51:03,992 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 18:51:03,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:03,994 INFO L225 Difference]: With dead ends: 334 [2025-04-13 18:51:03,994 INFO L226 Difference]: Without dead ends: 266 [2025-04-13 18:51:03,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-13 18:51:03,995 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 104 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:03,998 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 76 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:03,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-04-13 18:51:04,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 144. [2025-04-13 18:51:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 2.090909090909091) internal successors, (299), 143 states have internal predecessors, (299), 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 18:51:04,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 299 transitions. [2025-04-13 18:51:04,008 INFO L79 Accepts]: Start accepts. Automaton has 144 states and 299 transitions. Word has length 28 [2025-04-13 18:51:04,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,008 INFO L485 AbstractCegarLoop]: Abstraction has 144 states and 299 transitions. [2025-04-13 18:51:04,009 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 18:51:04,009 INFO L278 IsEmpty]: Start isEmpty. Operand 144 states and 299 transitions. [2025-04-13 18:51:04,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:04,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,009 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 18:51:04,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:51:04,011 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 18:51:04,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2010844726, now seen corresponding path program 6 times [2025-04-13 18:51:04,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953988714] [2025-04-13 18:51:04,014 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 18:51:04,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:04,032 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:04,032 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 18:51:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:04,120 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 18:51:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:04,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953988714] [2025-04-13 18:51:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953988714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003545421] [2025-04-13 18:51:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:04,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:04,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:04,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:04,121 INFO L87 Difference]: Start difference. First operand 144 states and 299 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 18:51:04,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:04,261 INFO L93 Difference]: Finished difference Result 318 states and 650 transitions. [2025-04-13 18:51:04,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 18:51:04,261 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 18:51:04,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,263 INFO L225 Difference]: With dead ends: 318 [2025-04-13 18:51:04,263 INFO L226 Difference]: Without dead ends: 254 [2025-04-13 18:51:04,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 18:51:04,264 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 78 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:04,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-04-13 18:51:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 148. [2025-04-13 18:51:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.074829931972789) internal successors, (305), 147 states have internal predecessors, (305), 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 18:51:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 305 transitions. [2025-04-13 18:51:04,272 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 305 transitions. Word has length 28 [2025-04-13 18:51:04,272 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,272 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 305 transitions. [2025-04-13 18:51:04,272 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 18:51:04,272 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 305 transitions. [2025-04-13 18:51:04,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:04,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,273 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 18:51:04,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:51:04,273 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 18:51:04,273 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1327140840, now seen corresponding path program 7 times [2025-04-13 18:51:04,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095308086] [2025-04-13 18:51:04,273 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 18:51:04,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:04,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:04,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:51:04,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:04,326 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 18:51:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:04,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095308086] [2025-04-13 18:51:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095308086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:04,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:51:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175314968] [2025-04-13 18:51:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:04,327 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:51:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:51:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:51:04,327 INFO L87 Difference]: Start difference. First operand 148 states and 305 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 18:51:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:04,350 INFO L93 Difference]: Finished difference Result 208 states and 421 transitions. [2025-04-13 18:51:04,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:51:04,350 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 18:51:04,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,351 INFO L225 Difference]: With dead ends: 208 [2025-04-13 18:51:04,351 INFO L226 Difference]: Without dead ends: 134 [2025-04-13 18:51:04,351 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 18:51:04,352 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:04,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-13 18:51:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-04-13 18:51:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 2.037593984962406) internal successors, (271), 133 states have internal predecessors, (271), 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 18:51:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 271 transitions. [2025-04-13 18:51:04,356 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 271 transitions. Word has length 28 [2025-04-13 18:51:04,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,356 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 271 transitions. [2025-04-13 18:51:04,356 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 18:51:04,356 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 271 transitions. [2025-04-13 18:51:04,356 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:04,356 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,357 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 18:51:04,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:51:04,357 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 18:51:04,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,357 INFO L85 PathProgramCache]: Analyzing trace with hash 499679310, now seen corresponding path program 8 times [2025-04-13 18:51:04,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133627031] [2025-04-13 18:51:04,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:51:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,363 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:04,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:04,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:51:04,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:04,445 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 18:51:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:04,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133627031] [2025-04-13 18:51:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133627031] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788072736] [2025-04-13 18:51:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:04,445 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:04,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:04,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:04,446 INFO L87 Difference]: Start difference. First operand 134 states and 271 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 18:51:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:04,587 INFO L93 Difference]: Finished difference Result 258 states and 511 transitions. [2025-04-13 18:51:04,587 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 18:51:04,587 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 18:51:04,587 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,588 INFO L225 Difference]: With dead ends: 258 [2025-04-13 18:51:04,588 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 18:51:04,589 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-04-13 18:51:04,589 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,589 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 80 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:51:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 18:51:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 130. [2025-04-13 18:51:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 2.0232558139534884) internal successors, (261), 129 states have internal predecessors, (261), 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 18:51:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 261 transitions. [2025-04-13 18:51:04,594 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 261 transitions. Word has length 28 [2025-04-13 18:51:04,594 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,594 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 261 transitions. [2025-04-13 18:51:04,594 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 18:51:04,594 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 261 transitions. [2025-04-13 18:51:04,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:04,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,595 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 18:51:04,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:51:04,595 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:04,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash 975344176, now seen corresponding path program 9 times [2025-04-13 18:51:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509540597] [2025-04-13 18:51:04,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:51:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:51:04,608 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:51:04,608 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 18:51:04,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:04,692 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 18:51:04,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:04,693 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509540597] [2025-04-13 18:51:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509540597] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:04,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:04,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:04,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813586713] [2025-04-13 18:51:04,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:04,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:04,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:04,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:04,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:04,694 INFO L87 Difference]: Start difference. First operand 130 states and 261 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 18:51:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:04,777 INFO L93 Difference]: Finished difference Result 194 states and 385 transitions. [2025-04-13 18:51:04,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:51:04,777 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 18:51:04,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,778 INFO L225 Difference]: With dead ends: 194 [2025-04-13 18:51:04,778 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 18:51:04,779 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 18:51:04,779 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 67 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 18:51:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-04-13 18:51:04,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.015748031496063) internal successors, (256), 127 states have internal predecessors, (256), 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 18:51:04,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 256 transitions. [2025-04-13 18:51:04,783 INFO L79 Accepts]: Start accepts. Automaton has 128 states and 256 transitions. Word has length 28 [2025-04-13 18:51:04,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,783 INFO L485 AbstractCegarLoop]: Abstraction has 128 states and 256 transitions. [2025-04-13 18:51:04,783 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 18:51:04,783 INFO L278 IsEmpty]: Start isEmpty. Operand 128 states and 256 transitions. [2025-04-13 18:51:04,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:51:04,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:51:04,784 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 18:51:04,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:51:04,785 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 18:51:04,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:51:04,785 INFO L85 PathProgramCache]: Analyzing trace with hash 890945402, now seen corresponding path program 10 times [2025-04-13 18:51:04,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:51:04,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186056598] [2025-04-13 18:51:04,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:51:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:51:04,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 18:51:04,797 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 18:51:04,797 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:51:04,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:51:04,860 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 18:51:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:51:04,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186056598] [2025-04-13 18:51:04,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186056598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:51:04,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:51:04,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 18:51:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027607124] [2025-04-13 18:51:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:51:04,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:51:04,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:51:04,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:51:04,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:51:04,861 INFO L87 Difference]: Start difference. First operand 128 states and 256 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 18:51:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:51:04,902 INFO L93 Difference]: Finished difference Result 128 states and 256 transitions. [2025-04-13 18:51:04,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:51:04,903 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 18:51:04,903 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:51:04,903 INFO L225 Difference]: With dead ends: 128 [2025-04-13 18:51:04,903 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 18:51:04,904 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 18:51:04,904 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:51:04,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:51:04,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 18:51:04,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 18:51:04,904 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 18:51:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 18:51:04,905 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2025-04-13 18:51:04,905 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:51:04,905 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 18:51:04,905 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 18:51:04,905 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 18:51:04,905 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 18:51:04,907 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 18:51:04,908 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 18:51:04,908 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 18:51:04,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:51:04,910 INFO L422 BasicCegarLoop]: Path program histogram: [10] [2025-04-13 18:51:04,912 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:51:04,912 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:51:04,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:51:04 BasicIcfg [2025-04-13 18:51:04,914 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:51:04,915 INFO L158 Benchmark]: Toolchain (without parser) took 3433.63ms. Allocated memory is still 142.6MB. Free memory was 102.0MB in the beginning and 59.6MB in the end (delta: 42.4MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2025-04-13 18:51:04,915 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:51:04,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.59ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 87.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 18:51:04,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.14ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:51:04,915 INFO L158 Benchmark]: Boogie Preprocessor took 31.91ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:51:04,916 INFO L158 Benchmark]: RCFGBuilder took 391.03ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 58.6MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-13 18:51:04,916 INFO L158 Benchmark]: TraceAbstraction took 2784.69ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 59.6MB in the end (delta: -1.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2025-04-13 18:51:04,916 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.13ms. Allocated memory is still 155.2MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.59ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 87.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.14ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.91ms. Allocated memory is still 142.6MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 391.03ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 58.6MB in the end (delta: 25.7MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2784.69ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 59.6MB in the end (delta: -1.5MB). Peak memory consumption was 3.1MB. 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.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 673 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 673 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 486 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 935 IncrementalHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 193 mSDtfsCounter, 935 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=279occurred in iteration=0, InterpolantAutomatonStates: 72, 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, 10 MinimizatonAttempts, 537 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 18:51:04,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...