./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:01,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:01,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:38:01,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:01,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:01,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:01,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:01,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:01,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:01,311 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:01,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:01,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:01,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:01,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:01,314 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:01,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:01,315 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:01,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:01,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:01,316 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f [2025-02-05 10:38:01,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:01,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:01,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:01,572 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:01,573 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:01,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:02,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3dcd9bd9/53ff2195eb984bb9b8c5fd465c3fda33/FLAG86475a259 [2025-02-05 10:38:03,012 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:03,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:03,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3dcd9bd9/53ff2195eb984bb9b8c5fd465c3fda33/FLAG86475a259 [2025-02-05 10:38:03,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c3dcd9bd9/53ff2195eb984bb9b8c5fd465c3fda33 [2025-02-05 10:38:03,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:03,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:03,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:03,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:03,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:03,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,072 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b185fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03, skipping insertion in model container [2025-02-05 10:38:03,072 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,094 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:03,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-02-05 10:38:03,249 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:03,256 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:03,296 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-02-05 10:38:03,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:03,312 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:03,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03 WrapperNode [2025-02-05 10:38:03,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:03,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:03,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:03,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:03,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,339 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 515 [2025-02-05 10:38:03,340 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:03,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:03,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:03,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:03,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,355 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-02-05 10:38:03,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:03,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:03,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:03,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:03,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (1/1) ... [2025-02-05 10:38:03,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:03,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:38:03,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:38:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:38:03,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:03,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:03,455 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:03,456 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:03,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume false; [2025-02-05 10:38:03,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume !false; [2025-02-05 10:38:03,760 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:03,760 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:03,771 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:03,772 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:38:03,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:03 BoogieIcfgContainer [2025-02-05 10:38:03,772 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:03,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:03,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:03,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:03,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:03" (1/3) ... [2025-02-05 10:38:03,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65845762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:03, skipping insertion in model container [2025-02-05 10:38:03,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:03" (2/3) ... [2025-02-05 10:38:03,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65845762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:03, skipping insertion in model container [2025-02-05 10:38:03,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:03" (3/3) ... [2025-02-05 10:38:03,778 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:03,787 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:03,788 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_2.BV.c.cil-1a.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:38:03,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:03,823 INFO L333 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=PETRI_NET, 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;@4e6c66ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:03,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:03,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.71875) internal successors, (220), 129 states have internal predecessors, (220), 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-02-05 10:38:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:38:03,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:03,833 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] [2025-02-05 10:38:03,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:03,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:03,837 INFO L85 PathProgramCache]: Analyzing trace with hash -408809601, now seen corresponding path program 1 times [2025-02-05 10:38:03,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:03,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058781809] [2025-02-05 10:38:03,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:03,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:03,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:38:03,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:38:03,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:03,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:04,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058781809] [2025-02-05 10:38:04,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058781809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:04,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271132080] [2025-02-05 10:38:04,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:04,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:04,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:04,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:04,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:04,044 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.71875) internal successors, (220), 129 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-05 10:38:04,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:04,149 INFO L93 Difference]: Finished difference Result 256 states and 434 transitions. [2025-02-05 10:38:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:04,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:38:04,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:04,155 INFO L225 Difference]: With dead ends: 256 [2025-02-05 10:38:04,155 INFO L226 Difference]: Without dead ends: 117 [2025-02-05 10:38:04,157 INFO L434 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-02-05 10:38:04,159 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:04,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 333 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-05 10:38:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-05 10:38:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.5258620689655173) internal successors, (177), 116 states have internal predecessors, (177), 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-02-05 10:38:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2025-02-05 10:38:04,180 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 24 [2025-02-05 10:38:04,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:04,181 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2025-02-05 10:38:04,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-05 10:38:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2025-02-05 10:38:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:38:04,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:04,182 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-02-05 10:38:04,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:38:04,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:04,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:04,183 INFO L85 PathProgramCache]: Analyzing trace with hash -324310053, now seen corresponding path program 1 times [2025-02-05 10:38:04,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:04,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749192556] [2025-02-05 10:38:04,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:04,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:04,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:38:04,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:38:04,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:04,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:04,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749192556] [2025-02-05 10:38:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749192556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048790084] [2025-02-05 10:38:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:04,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:04,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:04,247 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-05 10:38:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:04,338 INFO L93 Difference]: Finished difference Result 239 states and 366 transitions. [2025-02-05 10:38:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2025-02-05 10:38:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:04,339 INFO L225 Difference]: With dead ends: 239 [2025-02-05 10:38:04,339 INFO L226 Difference]: Without dead ends: 132 [2025-02-05 10:38:04,340 INFO L434 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-02-05 10:38:04,340 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:04,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 253 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-05 10:38:04,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-05 10:38:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 131 states have internal predecessors, (197), 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-02-05 10:38:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2025-02-05 10:38:04,346 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 36 [2025-02-05 10:38:04,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:04,346 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2025-02-05 10:38:04,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-05 10:38:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2025-02-05 10:38:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:04,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:04,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 10:38:04,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:38:04,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:04,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2058047386, now seen corresponding path program 1 times [2025-02-05 10:38:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:04,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459230338] [2025-02-05 10:38:04,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:04,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:04,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:04,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:04,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:38:04,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459230338] [2025-02-05 10:38:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459230338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:04,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476286261] [2025-02-05 10:38:04,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:04,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:04,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:04,398 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 10:38:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:04,488 INFO L93 Difference]: Finished difference Result 271 states and 410 transitions. [2025-02-05 10:38:04,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:04,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2025-02-05 10:38:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:04,489 INFO L225 Difference]: With dead ends: 271 [2025-02-05 10:38:04,489 INFO L226 Difference]: Without dead ends: 149 [2025-02-05 10:38:04,490 INFO L434 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-02-05 10:38:04,490 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:04,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 266 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-05 10:38:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-02-05 10:38:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.4797297297297298) internal successors, (219), 148 states have internal predecessors, (219), 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-02-05 10:38:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2025-02-05 10:38:04,496 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 50 [2025-02-05 10:38:04,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:04,496 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2025-02-05 10:38:04,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 10:38:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2025-02-05 10:38:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:38:04,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:04,497 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:04,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:38:04,498 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:04,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:04,498 INFO L85 PathProgramCache]: Analyzing trace with hash -311532744, now seen corresponding path program 1 times [2025-02-05 10:38:04,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:04,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252934561] [2025-02-05 10:38:04,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:04,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:04,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 10:38:04,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:38:04,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:04,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:04,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252934561] [2025-02-05 10:38:04,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252934561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:04,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632187664] [2025-02-05 10:38:04,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:04,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:04,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:04,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:04,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:04,592 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:04,714 INFO L93 Difference]: Finished difference Result 330 states and 502 transitions. [2025-02-05 10:38:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:04,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2025-02-05 10:38:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:04,715 INFO L225 Difference]: With dead ends: 330 [2025-02-05 10:38:04,715 INFO L226 Difference]: Without dead ends: 190 [2025-02-05 10:38:04,715 INFO L434 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-02-05 10:38:04,716 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 36 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:04,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:04,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-05 10:38:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2025-02-05 10:38:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.4232804232804233) internal successors, (269), 189 states have internal predecessors, (269), 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-02-05 10:38:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 269 transitions. [2025-02-05 10:38:04,753 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 269 transitions. Word has length 67 [2025-02-05 10:38:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:04,753 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 269 transitions. [2025-02-05 10:38:04,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:04,753 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 269 transitions. [2025-02-05 10:38:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:38:04,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:04,755 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:04,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:38:04,755 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:04,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash 933231737, now seen corresponding path program 1 times [2025-02-05 10:38:04,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:04,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639606911] [2025-02-05 10:38:04,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:04,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 10:38:04,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:38:04,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:04,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:04,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639606911] [2025-02-05 10:38:04,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639606911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197448355] [2025-02-05 10:38:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:04,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:04,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:04,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:04,822 INFO L87 Difference]: Start difference. First operand 190 states and 269 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:04,931 INFO L93 Difference]: Finished difference Result 389 states and 558 transitions. [2025-02-05 10:38:04,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:04,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2025-02-05 10:38:04,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:04,933 INFO L225 Difference]: With dead ends: 389 [2025-02-05 10:38:04,933 INFO L226 Difference]: Without dead ends: 209 [2025-02-05 10:38:04,933 INFO L434 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-02-05 10:38:04,933 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:04,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 271 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-05 10:38:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2025-02-05 10:38:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.4086538461538463) internal successors, (293), 208 states have internal predecessors, (293), 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-02-05 10:38:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 293 transitions. [2025-02-05 10:38:04,944 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 293 transitions. Word has length 67 [2025-02-05 10:38:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:04,944 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 293 transitions. [2025-02-05 10:38:04,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 293 transitions. [2025-02-05 10:38:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 10:38:04,946 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:04,946 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:04,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:38:04,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1105709357, now seen corresponding path program 1 times [2025-02-05 10:38:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868324207] [2025-02-05 10:38:04,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:04,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 10:38:04,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 10:38:04,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:04,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 10:38:04,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:04,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868324207] [2025-02-05 10:38:04,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868324207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:04,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:04,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562793809] [2025-02-05 10:38:05,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,001 INFO L87 Difference]: Start difference. First operand 209 states and 293 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-05 10:38:05,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,100 INFO L93 Difference]: Finished difference Result 429 states and 610 transitions. [2025-02-05 10:38:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 83 [2025-02-05 10:38:05,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,102 INFO L225 Difference]: With dead ends: 429 [2025-02-05 10:38:05,102 INFO L226 Difference]: Without dead ends: 230 [2025-02-05 10:38:05,102 INFO L434 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-02-05 10:38:05,103 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 9 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 270 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:05,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-05 10:38:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2025-02-05 10:38:05,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.3930131004366813) internal successors, (319), 229 states have internal predecessors, (319), 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-02-05 10:38:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 319 transitions. [2025-02-05 10:38:05,109 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 319 transitions. Word has length 83 [2025-02-05 10:38:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,109 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 319 transitions. [2025-02-05 10:38:05,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-05 10:38:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 319 transitions. [2025-02-05 10:38:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 10:38:05,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,110 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:05,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:38:05,110 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,111 INFO L85 PathProgramCache]: Analyzing trace with hash -619337067, now seen corresponding path program 1 times [2025-02-05 10:38:05,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035629086] [2025-02-05 10:38:05,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:05,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 10:38:05,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 10:38:05,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:38:05,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035629086] [2025-02-05 10:38:05,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035629086] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:05,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:05,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900716982] [2025-02-05 10:38:05,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,180 INFO L87 Difference]: Start difference. First operand 230 states and 319 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,229 INFO L93 Difference]: Finished difference Result 667 states and 927 transitions. [2025-02-05 10:38:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 10:38:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,231 INFO L225 Difference]: With dead ends: 667 [2025-02-05 10:38:05,231 INFO L226 Difference]: Without dead ends: 447 [2025-02-05 10:38:05,231 INFO L434 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-02-05 10:38:05,231 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 131 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 370 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-02-05 10:38:05,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-02-05 10:38:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.3811659192825112) internal successors, (616), 446 states have internal predecessors, (616), 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-02-05 10:38:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 616 transitions. [2025-02-05 10:38:05,250 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 616 transitions. Word has length 103 [2025-02-05 10:38:05,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 616 transitions. [2025-02-05 10:38:05,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:05,251 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 616 transitions. [2025-02-05 10:38:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 10:38:05,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,252 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:38:05,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1786033386, now seen corresponding path program 1 times [2025-02-05 10:38:05,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456382372] [2025-02-05 10:38:05,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 10:38:05,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 10:38:05,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:05,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 10:38:05,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456382372] [2025-02-05 10:38:05,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456382372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455127369] [2025-02-05 10:38:05,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,306 INFO L87 Difference]: Start difference. First operand 447 states and 616 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 10:38:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,324 INFO L93 Difference]: Finished difference Result 905 states and 1246 transitions. [2025-02-05 10:38:05,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2025-02-05 10:38:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,326 INFO L225 Difference]: With dead ends: 905 [2025-02-05 10:38:05,326 INFO L226 Difference]: Without dead ends: 468 [2025-02-05 10:38:05,327 INFO L434 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-02-05 10:38:05,327 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 351 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-02-05 10:38:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-02-05 10:38:05,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 467 states have (on average 1.3768736616702355) internal successors, (643), 467 states have internal predecessors, (643), 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-02-05 10:38:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 643 transitions. [2025-02-05 10:38:05,335 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 643 transitions. Word has length 103 [2025-02-05 10:38:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 643 transitions. [2025-02-05 10:38:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 10:38:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 643 transitions. [2025-02-05 10:38:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 10:38:05,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,337 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:05,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:38:05,337 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1600194878, now seen corresponding path program 1 times [2025-02-05 10:38:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703041242] [2025-02-05 10:38:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 10:38:05,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 10:38:05,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:05,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 10:38:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703041242] [2025-02-05 10:38:05,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703041242] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:05,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413408692] [2025-02-05 10:38:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,379 INFO L87 Difference]: Start difference. First operand 468 states and 643 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:38:05,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,396 INFO L93 Difference]: Finished difference Result 952 states and 1306 transitions. [2025-02-05 10:38:05,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 104 [2025-02-05 10:38:05,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,397 INFO L225 Difference]: With dead ends: 952 [2025-02-05 10:38:05,397 INFO L226 Difference]: Without dead ends: 494 [2025-02-05 10:38:05,398 INFO L434 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-02-05 10:38:05,398 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 20 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 323 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:05,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-02-05 10:38:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2025-02-05 10:38:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 1.3711967545638946) internal successors, (676), 493 states have internal predecessors, (676), 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-02-05 10:38:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 676 transitions. [2025-02-05 10:38:05,407 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 676 transitions. Word has length 104 [2025-02-05 10:38:05,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,407 INFO L471 AbstractCegarLoop]: Abstraction has 494 states and 676 transitions. [2025-02-05 10:38:05,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:38:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 676 transitions. [2025-02-05 10:38:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 10:38:05,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,411 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:05,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:38:05,412 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2024812102, now seen corresponding path program 1 times [2025-02-05 10:38:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125365340] [2025-02-05 10:38:05,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 10:38:05,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 10:38:05,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:05,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,464 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-05 10:38:05,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125365340] [2025-02-05 10:38:05,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125365340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:05,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:05,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570511894] [2025-02-05 10:38:05,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,465 INFO L87 Difference]: Start difference. First operand 494 states and 676 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-02-05 10:38:05,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,493 INFO L93 Difference]: Finished difference Result 714 states and 981 transitions. [2025-02-05 10:38:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 105 [2025-02-05 10:38:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,496 INFO L225 Difference]: With dead ends: 714 [2025-02-05 10:38:05,496 INFO L226 Difference]: Without dead ends: 712 [2025-02-05 10:38:05,496 INFO L434 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-02-05 10:38:05,496 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 144 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 313 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-02-05 10:38:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2025-02-05 10:38:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 1.3769338959212376) internal successors, (979), 711 states have internal predecessors, (979), 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-02-05 10:38:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 979 transitions. [2025-02-05 10:38:05,508 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 979 transitions. Word has length 105 [2025-02-05 10:38:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,508 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 979 transitions. [2025-02-05 10:38:05,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-02-05 10:38:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 979 transitions. [2025-02-05 10:38:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 10:38:05,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,510 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 10:38:05,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:38:05,510 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1202749052, now seen corresponding path program 1 times [2025-02-05 10:38:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860268259] [2025-02-05 10:38:05,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 10:38:05,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 10:38:05,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:05,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-05 10:38:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860268259] [2025-02-05 10:38:05,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860268259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:05,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:05,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:05,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279598096] [2025-02-05 10:38:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:05,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:05,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:05,622 INFO L87 Difference]: Start difference. First operand 712 states and 979 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:05,742 INFO L93 Difference]: Finished difference Result 1514 states and 2145 transitions. [2025-02-05 10:38:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2025-02-05 10:38:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:05,746 INFO L225 Difference]: With dead ends: 1514 [2025-02-05 10:38:05,746 INFO L226 Difference]: Without dead ends: 835 [2025-02-05 10:38:05,747 INFO L434 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-02-05 10:38:05,750 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:05,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 208 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:05,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2025-02-05 10:38:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 829. [2025-02-05 10:38:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 1.4106280193236715) internal successors, (1168), 828 states have internal predecessors, (1168), 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-02-05 10:38:05,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1168 transitions. [2025-02-05 10:38:05,766 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1168 transitions. Word has length 173 [2025-02-05 10:38:05,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:05,766 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1168 transitions. [2025-02-05 10:38:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1168 transitions. [2025-02-05 10:38:05,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-02-05 10:38:05,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:05,768 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:05,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:38:05,768 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:05,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:05,769 INFO L85 PathProgramCache]: Analyzing trace with hash -936170408, now seen corresponding path program 2 times [2025-02-05 10:38:05,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:05,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14881440] [2025-02-05 10:38:05,769 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:05,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:05,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-02-05 10:38:05,798 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 10:38:05,798 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:05,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 32 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-02-05 10:38:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14881440] [2025-02-05 10:38:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14881440] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818687651] [2025-02-05 10:38:05,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:05,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:05,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:05,896 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:05,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:38:05,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 185 statements into 2 equivalence classes. [2025-02-05 10:38:05,989 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 185 of 185 statements. [2025-02-05 10:38:05,989 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:05,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:05,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-05 10:38:06,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818687651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:06,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:38:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928906772] [2025-02-05 10:38:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:06,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:06,026 INFO L87 Difference]: Start difference. First operand 829 states and 1168 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-05 10:38:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:06,151 INFO L93 Difference]: Finished difference Result 1865 states and 2715 transitions. [2025-02-05 10:38:06,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 185 [2025-02-05 10:38:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:06,155 INFO L225 Difference]: With dead ends: 1865 [2025-02-05 10:38:06,155 INFO L226 Difference]: Without dead ends: 1021 [2025-02-05 10:38:06,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:06,156 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 48 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:06,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 234 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-02-05 10:38:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1018. [2025-02-05 10:38:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1017 states have (on average 1.3962635201573255) internal successors, (1420), 1017 states have internal predecessors, (1420), 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-02-05 10:38:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1420 transitions. [2025-02-05 10:38:06,177 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1420 transitions. Word has length 185 [2025-02-05 10:38:06,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:06,177 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1420 transitions. [2025-02-05 10:38:06,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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-02-05 10:38:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1420 transitions. [2025-02-05 10:38:06,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 10:38:06,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:06,180 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 10:38:06,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:38:06,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 10:38:06,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:06,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash -52718731, now seen corresponding path program 1 times [2025-02-05 10:38:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:06,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209937067] [2025-02-05 10:38:06,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:06,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:06,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 10:38:06,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 10:38:06,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:06,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-02-05 10:38:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209937067] [2025-02-05 10:38:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209937067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:06,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012002853] [2025-02-05 10:38:06,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:06,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:06,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:06,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:06,461 INFO L87 Difference]: Start difference. First operand 1018 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-05 10:38:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:06,490 INFO L93 Difference]: Finished difference Result 2342 states and 3267 transitions. [2025-02-05 10:38:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:06,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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 196 [2025-02-05 10:38:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:06,494 INFO L225 Difference]: With dead ends: 2342 [2025-02-05 10:38:06,494 INFO L226 Difference]: Without dead ends: 1360 [2025-02-05 10:38:06,495 INFO L434 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-02-05 10:38:06,496 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:06,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 476 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2025-02-05 10:38:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1287. [2025-02-05 10:38:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1286 states have (on average 1.4004665629860031) internal successors, (1801), 1286 states have internal predecessors, (1801), 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-02-05 10:38:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1801 transitions. [2025-02-05 10:38:06,521 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1801 transitions. Word has length 196 [2025-02-05 10:38:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:06,522 INFO L471 AbstractCegarLoop]: Abstraction has 1287 states and 1801 transitions. [2025-02-05 10:38:06,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-02-05 10:38:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1801 transitions. [2025-02-05 10:38:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 10:38:06,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:06,524 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-02-05 10:38:06,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:38:06,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:06,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash -149417025, now seen corresponding path program 1 times [2025-02-05 10:38:06,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:06,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178992919] [2025-02-05 10:38:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:06,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:06,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 10:38:06,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 10:38:06,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:06,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:06,597 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-05 10:38:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178992919] [2025-02-05 10:38:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178992919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:06,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:06,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734325962] [2025-02-05 10:38:06,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:06,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:06,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:06,599 INFO L87 Difference]: Start difference. First operand 1287 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-02-05 10:38:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:06,628 INFO L93 Difference]: Finished difference Result 2569 states and 3590 transitions. [2025-02-05 10:38:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:06,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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 197 [2025-02-05 10:38:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:06,634 INFO L225 Difference]: With dead ends: 2569 [2025-02-05 10:38:06,634 INFO L226 Difference]: Without dead ends: 1587 [2025-02-05 10:38:06,635 INFO L434 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-02-05 10:38:06,636 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:06,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 473 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:06,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-02-05 10:38:06,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1562. [2025-02-05 10:38:06,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 1.4003843689942346) internal successors, (2186), 1561 states have internal predecessors, (2186), 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-02-05 10:38:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2186 transitions. [2025-02-05 10:38:06,668 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2186 transitions. Word has length 197 [2025-02-05 10:38:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:06,668 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2186 transitions. [2025-02-05 10:38:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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-02-05 10:38:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2186 transitions. [2025-02-05 10:38:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 10:38:06,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:06,671 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2025-02-05 10:38:06,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:38:06,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:06,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 206112440, now seen corresponding path program 1 times [2025-02-05 10:38:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535602900] [2025-02-05 10:38:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:06,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 10:38:06,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 10:38:06,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:06,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 16 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 10:38:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535602900] [2025-02-05 10:38:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535602900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703996804] [2025-02-05 10:38:06,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:06,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:06,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:38:06,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 10:38:06,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 10:38:06,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:06,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:06,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:06,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 10:38:07,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703996804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:07,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:07,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-05 10:38:07,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620920746] [2025-02-05 10:38:07,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:07,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:38:07,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:07,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:38:07,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:07,059 INFO L87 Difference]: Start difference. First operand 1562 states and 2186 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02-05 10:38:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:07,106 INFO L93 Difference]: Finished difference Result 3691 states and 5166 transitions. [2025-02-05 10:38:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:38:07,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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 198 [2025-02-05 10:38:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:07,113 INFO L225 Difference]: With dead ends: 3691 [2025-02-05 10:38:07,113 INFO L226 Difference]: Without dead ends: 2434 [2025-02-05 10:38:07,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:07,115 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 270 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:07,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 919 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2434 states. [2025-02-05 10:38:07,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2434 to 2333. [2025-02-05 10:38:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 2332 states have (on average 1.4078044596912522) internal successors, (3283), 2332 states have internal predecessors, (3283), 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-02-05 10:38:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3283 transitions. [2025-02-05 10:38:07,152 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3283 transitions. Word has length 198 [2025-02-05 10:38:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:07,153 INFO L471 AbstractCegarLoop]: Abstraction has 2333 states and 3283 transitions. [2025-02-05 10:38:07,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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-02-05 10:38:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3283 transitions. [2025-02-05 10:38:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 10:38:07,156 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:07,157 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-05 10:38:07,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:38:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 10:38:07,361 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:07,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1895668618, now seen corresponding path program 1 times [2025-02-05 10:38:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950661627] [2025-02-05 10:38:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:07,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 10:38:07,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 10:38:07,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:07,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-02-05 10:38:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:07,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950661627] [2025-02-05 10:38:07,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950661627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:07,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:07,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260775400] [2025-02-05 10:38:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:07,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:07,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:07,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:07,466 INFO L87 Difference]: Start difference. First operand 2333 states and 3283 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 10:38:07,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:07,499 INFO L93 Difference]: Finished difference Result 3611 states and 5060 transitions. [2025-02-05 10:38:07,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:07,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 199 [2025-02-05 10:38:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:07,506 INFO L225 Difference]: With dead ends: 3611 [2025-02-05 10:38:07,506 INFO L226 Difference]: Without dead ends: 2629 [2025-02-05 10:38:07,507 INFO L434 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-02-05 10:38:07,507 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 111 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:07,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 484 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:07,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2025-02-05 10:38:07,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2629. [2025-02-05 10:38:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 1.4052511415525115) internal successors, (3693), 2628 states have internal predecessors, (3693), 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-02-05 10:38:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3693 transitions. [2025-02-05 10:38:07,575 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3693 transitions. Word has length 199 [2025-02-05 10:38:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:07,575 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 3693 transitions. [2025-02-05 10:38:07,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 10:38:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3693 transitions. [2025-02-05 10:38:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 10:38:07,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:07,579 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1] [2025-02-05 10:38:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 10:38:07,579 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:07,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:07,579 INFO L85 PathProgramCache]: Analyzing trace with hash -471880419, now seen corresponding path program 1 times [2025-02-05 10:38:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166187739] [2025-02-05 10:38:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:07,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 10:38:07,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 10:38:07,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:07,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 10:38:07,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166187739] [2025-02-05 10:38:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166187739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501106450] [2025-02-05 10:38:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:07,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:07,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:07,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:07,634 INFO L87 Difference]: Start difference. First operand 2629 states and 3693 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-02-05 10:38:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:07,688 INFO L93 Difference]: Finished difference Result 7315 states and 10372 transitions. [2025-02-05 10:38:07,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:07,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 201 [2025-02-05 10:38:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:07,702 INFO L225 Difference]: With dead ends: 7315 [2025-02-05 10:38:07,702 INFO L226 Difference]: Without dead ends: 4743 [2025-02-05 10:38:07,705 INFO L434 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-02-05 10:38:07,705 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 108 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:07,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 457 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:07,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2025-02-05 10:38:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 4491. [2025-02-05 10:38:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4491 states, 4490 states have (on average 1.4276169265033407) internal successors, (6410), 4490 states have internal predecessors, (6410), 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-02-05 10:38:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4491 states to 4491 states and 6410 transitions. [2025-02-05 10:38:07,789 INFO L78 Accepts]: Start accepts. Automaton has 4491 states and 6410 transitions. Word has length 201 [2025-02-05 10:38:07,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:07,790 INFO L471 AbstractCegarLoop]: Abstraction has 4491 states and 6410 transitions. [2025-02-05 10:38:07,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-02-05 10:38:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4491 states and 6410 transitions. [2025-02-05 10:38:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 10:38:07,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:07,795 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2025-02-05 10:38:07,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:38:07,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:07,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1310350, now seen corresponding path program 1 times [2025-02-05 10:38:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075234645] [2025-02-05 10:38:07,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:07,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 10:38:07,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 10:38:07,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:07,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:38:07,823 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 10:38:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 10:38:07,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 10:38:07,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:07,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:38:07,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 10:38:07,923 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 10:38:07,924 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:38:07,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:38:07,926 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:08,048 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:38:08,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:38:08 BoogieIcfgContainer [2025-02-05 10:38:08,054 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:38:08,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:38:08,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:38:08,055 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:38:08,056 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:03" (3/4) ... [2025-02-05 10:38:08,057 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 10:38:08,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:38:08,061 INFO L158 Benchmark]: Toolchain (without parser) took 4996.11ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.6MB in the beginning and 99.8MB in the end (delta: 6.8MB). Peak memory consumption was 162.7MB. Max. memory is 16.1GB. [2025-02-05 10:38:08,061 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.81ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: Boogie Preprocessor took 22.41ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: IcfgBuilder took 409.12ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 51.9MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: TraceAbstraction took 4280.82ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 51.2MB in the beginning and 99.9MB in the end (delta: -48.7MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2025-02-05 10:38:08,062 INFO L158 Benchmark]: Witness Printer took 6.00ms. Allocated memory is still 302.0MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:08,067 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.27ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.81ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 91.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.10ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.41ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 86.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 409.12ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 51.9MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4280.82ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 51.2MB in the beginning and 99.9MB in the end (delta: -48.7MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. * Witness Printer took 6.00ms. Allocated memory is still 302.0MB. Free memory was 99.9MB in the beginning and 99.8MB in the end (delta: 57.1kB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 618]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 366. Possible FailurePath: [L627] int __retres1 ; [L631] CALL ssl3_connect() [L19] int s__info_callback = __VERIFIER_nondet_int(); [L20] unsigned int s__in_handshake = __VERIFIER_nondet_uint(); [L21] int s__state ; [L22] int s__new_session ; [L23] int s__server ; [L24] unsigned int s__version = __VERIFIER_nondet_uint(); [L25] int s__type ; [L26] int s__init_num ; [L27] int s__bbio = __VERIFIER_nondet_int(); [L28] int s__wbio = __VERIFIER_nondet_int(); [L29] int s__hit = __VERIFIER_nondet_int(); [L30] int s__rwstate ; [L31] int s__init_buf___0 = __VERIFIER_nondet_int(); [L32] int s__debug = __VERIFIER_nondet_int(); [L33] int s__shutdown ; [L34] int s__ctx__info_callback = __VERIFIER_nondet_int(); [L35] unsigned int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_uint(); [L36] unsigned int s__ctx__stats__sess_connect = __VERIFIER_nondet_uint(); [L37] unsigned int s__ctx__stats__sess_hit = __VERIFIER_nondet_uint(); [L38] unsigned int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_uint(); [L39] int s__s3__change_cipher_spec ; [L40] int s__s3__flags = __VERIFIER_nondet_int(); [L41] int s__s3__delay_buf_pop_ret ; [L42] int s__s3__tmp__cert_req = __VERIFIER_nondet_int(); [L43] int s__s3__tmp__new_compression = __VERIFIER_nondet_int(); [L44] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int(); [L45] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int(); [L46] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int(); [L47] int s__s3__tmp__next_state___0 ; [L48] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int(); [L49] int s__session__cipher ; [L50] int s__session__compress_meth ; [L51] int buf ; [L52] unsigned long tmp ; [L53] unsigned long l ; [L54] int num1 = __VERIFIER_nondet_int(); [L55] int cb ; [L56] int ret ; [L57] int new_state ; [L58] int state ; [L59] int skip ; [L60] int tmp___0 ; [L61] unsigned int tmp___1 = __VERIFIER_nondet_uint(); [L62] unsigned int tmp___2 = __VERIFIER_nondet_uint(); [L63] int tmp___3 = __VERIFIER_nondet_int(); [L64] int tmp___4 = __VERIFIER_nondet_int(); [L65] int tmp___5 = __VERIFIER_nondet_int(); [L66] int tmp___6 = __VERIFIER_nondet_int(); [L67] int tmp___7 = __VERIFIER_nondet_int(); [L68] int tmp___8 = __VERIFIER_nondet_int(); [L69] int tmp___9 = __VERIFIER_nondet_int(); [L70] int blastFlag ; [L71] int ag_X ; [L72] int ag_Y ; [L73] int __retres59 ; [L76] s__state = 12292 [L77] blastFlag = 0 [L78] tmp = __VERIFIER_nondet_int() [L79] cb = 0 [L80] ret = -1 [L81] skip = 0 [L82] tmp___0 = 0 VAL [blastFlag=0, cb=0, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__info_callback=1, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L83] COND TRUE s__info_callback != 0 [L84] cb = s__info_callback VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L92] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L93] COND FALSE !(tmp___1 - 12288) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND TRUE s__state == 12292 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L209] s__new_session = 1 [L210] s__state = 4096 [L211] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L216] s__server = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L217] COND TRUE cb != 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L222] COND FALSE !(s__version - 65280 != 768) [L228] s__type = 4096 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L229] COND FALSE !(s__init_buf___0 == 0) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L247] COND FALSE !(! tmp___4) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L253] COND FALSE !(! tmp___5) [L259] s__state = 4368 [L260] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L261] s__init_num = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND TRUE s__state == 4368 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND TRUE blastFlag == 0 [L268] blastFlag = 1 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L276] COND FALSE !(ret <= 0) [L281] s__state = 4384 [L282] s__init_num = 0 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L283] COND TRUE s__bbio != s__wbio VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4384 VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L291] ret = __VERIFIER_nondet_int() VAL [blastFlag=1, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L292] COND TRUE blastFlag == 1 [L293] blastFlag = 2 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L297] COND FALSE !(ret <= 0) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L302] COND FALSE !(\read(s__hit)) [L305] s__state = 4400 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L307] s__init_num = 0 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4400 VAL [blastFlag=2, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L311] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND TRUE blastFlag == 2 [L316] blastFlag = 3 VAL [blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L320] COND FALSE !(ret <= 0) VAL [blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L326] ag_Y = 61087 [L327] s__state = 4416 [L328] s__init_num = 0 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND TRUE s__state == 4416 VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L332] ret = __VERIFIER_nondet_int() VAL [ag_Y=61087, blastFlag=3, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L333] COND TRUE blastFlag == 3 [L334] blastFlag = 4 VAL [ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L338] COND FALSE !(ret <= 0) [L343] s__state = 4432 [L344] ag_X = (unsigned short)65535 [L345] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L346] COND FALSE !(! tmp___6) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4416) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4417) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND TRUE s__state == 4432 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L355] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L356] COND FALSE !(blastFlag == 5) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L361] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L366] EXPR ag_X ^ ag_Y VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L366] s__state = ag_X ^ ag_Y [L367] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND TRUE s__state == 4368 VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L265] s__shutdown = 0 [L266] ret = __VERIFIER_nondet_int() [L267] COND FALSE !(blastFlag == 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=4, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L270] COND TRUE blastFlag == 4 [L271] blastFlag = 5 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L276] COND FALSE !(ret <= 0) [L281] s__state = 4384 [L282] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L283] COND TRUE s__bbio != s__wbio VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4384 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L291] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L292] COND FALSE !(blastFlag == 1) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L297] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L302] COND FALSE !(\read(s__hit)) [L305] s__state = 4400 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L307] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4400, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4400 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L311] COND FALSE !((unsigned long )s__s3__tmp__new_cipher__algorithms - 256UL) [L314] ret = __VERIFIER_nondet_int() [L315] COND FALSE !(blastFlag == 2) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L320] COND FALSE !(ret <= 0) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L326] ag_Y = 61087 [L327] s__state = 4416 [L328] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4400, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4416, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND TRUE s__state == 4416 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L332] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L333] COND FALSE !(blastFlag == 3) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L338] COND FALSE !(ret <= 0) [L343] s__state = 4432 [L344] ag_X = (unsigned short)65535 [L345] s__init_num = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L346] COND FALSE !(! tmp___6) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L576] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L605] skip = 0 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE 1 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4416, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L105] state = s__state VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L106] COND FALSE !(s__state == 12292) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND FALSE !(s__state == 16384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 4096) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 20480) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4099) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 4368) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4369) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4384) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4385) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4400) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4401) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4416) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4417) VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND TRUE s__state == 4432 VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=1, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L355] ret = __VERIFIER_nondet_int() VAL [ag_X=65535, ag_Y=61087, blastFlag=5, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L356] COND TRUE blastFlag == 5 VAL [ag_X=65535, ag_Y=61087, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] [L618] reach_error() VAL [ag_X=65535, ag_Y=61087, cb=1, num1=0, ret=0, s__bbio=1, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=0, s__in_handshake=0, s__init_buf___0=1, s__s3__flags=0, s__s3__tmp__cert_req=0, s__s3__tmp__new_cipher=0, s__s3__tmp__new_cipher__algorithms=256, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-4294901248, s__wbio=0, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=1, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 18, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1246 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1246 mSDsluCounter, 6232 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2429 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1015 IncrementalHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 3803 mSDtfsCounter, 1015 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 435 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4491occurred in iteration=17, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 460 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2675 NumberOfCodeBlocks, 2675 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2455 ConstructedInterpolants, 0 QuantifiedInterpolants, 4124 SizeOfPredicates, 2 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 19 InterpolantComputations, 17 PerfectInterpolantSequences, 5656/5704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 10:38:08,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:09,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:10,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 10:38:10,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:10,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:10,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:10,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:10,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:10,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:10,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:10,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:10,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:10,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:10,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:10,073 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:10,073 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:10,073 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:10,073 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:10,074 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:10,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:10,074 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:10,075 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a3c981e6120ddd541107cacdc467669ae2974b6d56edeb7c5e992510648be0f [2025-02-05 10:38:10,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:10,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:10,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:10,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:10,320 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:10,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:11,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/103e0e54e/4b5de98816d54e02a2c922f62d0bfee0/FLAGd69efb404 [2025-02-05 10:38:11,702 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:11,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:11,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/103e0e54e/4b5de98816d54e02a2c922f62d0bfee0/FLAGd69efb404 [2025-02-05 10:38:11,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/103e0e54e/4b5de98816d54e02a2c922f62d0bfee0 [2025-02-05 10:38:11,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:11,736 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:11,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:11,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:11,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:11,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:11,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3693ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11, skipping insertion in model container [2025-02-05 10:38:11,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:11,762 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:11,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-02-05 10:38:11,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:11,934 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:11,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_2.BV.c.cil-1a.c[37676,37689] [2025-02-05 10:38:11,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:11,994 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:11,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11 WrapperNode [2025-02-05 10:38:11,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:11,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:11,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:11,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:12,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,028 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 467 [2025-02-05 10:38:12,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:12,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:12,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:12,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:12,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,053 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-02-05 10:38:12,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,060 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,065 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,066 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:12,070 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:12,070 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:12,070 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:12,071 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (1/1) ... [2025-02-05 10:38:12,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:12,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:12,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:38:12,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:38:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 10:38:12,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:12,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:12,210 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:12,212 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:12,594 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume false; [2025-02-05 10:38:12,594 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L207: assume !false; [2025-02-05 10:38:12,619 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:12,619 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:12,626 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:12,626 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:38:12,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:12 BoogieIcfgContainer [2025-02-05 10:38:12,627 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:12,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:12,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:12,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:12,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:11" (1/3) ... [2025-02-05 10:38:12,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3347f89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:12, skipping insertion in model container [2025-02-05 10:38:12,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:11" (2/3) ... [2025-02-05 10:38:12,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3347f89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:12, skipping insertion in model container [2025-02-05 10:38:12,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:12" (3/3) ... [2025-02-05 10:38:12,634 INFO L128 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.BV.c.cil-1a.c [2025-02-05 10:38:12,644 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:12,645 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s3_clnt_2.BV.c.cil-1a.c that has 1 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:38:12,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:12,680 INFO L333 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=PETRI_NET, 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;@7fc785e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:12,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 123 states have (on average 1.7235772357723578) internal successors, (212), 124 states have internal predecessors, (212), 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-02-05 10:38:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-05 10:38:12,686 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:12,686 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] [2025-02-05 10:38:12,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:12,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:12,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1069452026, now seen corresponding path program 1 times [2025-02-05 10:38:12,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:12,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1338764243] [2025-02-05 10:38:12,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:12,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:12,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:12,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:12,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:38:12,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-05 10:38:12,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-05 10:38:12,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:12,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:12,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:12,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:12,785 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:12,785 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1338764243] [2025-02-05 10:38:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1338764243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:12,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:12,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857051190] [2025-02-05 10:38:12,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:12,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:12,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:12,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:12,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:12,800 INFO L87 Difference]: Start difference. First operand has 125 states, 123 states have (on average 1.7235772357723578) internal successors, (212), 124 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-05 10:38:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:12,924 INFO L93 Difference]: Finished difference Result 246 states and 418 transitions. [2025-02-05 10:38:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:12,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-05 10:38:12,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:12,930 INFO L225 Difference]: With dead ends: 246 [2025-02-05 10:38:12,930 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 10:38:12,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-02-05 10:38:12,933 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 6 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:12,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:12,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 10:38:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-02-05 10:38:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 111 states have internal predecessors, (169), 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-02-05 10:38:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 169 transitions. [2025-02-05 10:38:12,954 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 169 transitions. Word has length 24 [2025-02-05 10:38:12,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:12,955 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 169 transitions. [2025-02-05 10:38:12,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-05 10:38:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 169 transitions. [2025-02-05 10:38:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-05 10:38:12,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:12,956 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1] [2025-02-05 10:38:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:38:13,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:13,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:13,158 INFO L85 PathProgramCache]: Analyzing trace with hash 363915074, now seen corresponding path program 1 times [2025-02-05 10:38:13,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:13,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314719377] [2025-02-05 10:38:13,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:13,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:13,160 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:38:13,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-05 10:38:13,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-05 10:38:13,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:13,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:13,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:13,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:38:13,245 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:13,245 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314719377] [2025-02-05 10:38:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314719377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:13,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:13,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783157601] [2025-02-05 10:38:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:13,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:13,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:13,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:13,246 INFO L87 Difference]: Start difference. First operand 112 states and 169 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-05 10:38:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:13,345 INFO L93 Difference]: Finished difference Result 229 states and 350 transitions. [2025-02-05 10:38:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:13,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2025-02-05 10:38:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:13,346 INFO L225 Difference]: With dead ends: 229 [2025-02-05 10:38:13,346 INFO L226 Difference]: Without dead ends: 127 [2025-02-05 10:38:13,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-02-05 10:38:13,347 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:13,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 239 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:13,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-05 10:38:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-05 10:38:13,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.5) internal successors, (189), 126 states have internal predecessors, (189), 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-02-05 10:38:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 189 transitions. [2025-02-05 10:38:13,352 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 189 transitions. Word has length 36 [2025-02-05 10:38:13,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:13,353 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 189 transitions. [2025-02-05 10:38:13,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-02-05 10:38:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 189 transitions. [2025-02-05 10:38:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:38:13,354 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:13,354 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 10:38:13,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:38:13,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:13,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1234040831, now seen corresponding path program 1 times [2025-02-05 10:38:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665439981] [2025-02-05 10:38:13,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:13,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:13,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:13,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:38:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:38:13,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:38:13,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:13,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:13,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:13,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:38:13,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:13,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:13,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665439981] [2025-02-05 10:38:13,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665439981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:13,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:13,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:13,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707636051] [2025-02-05 10:38:13,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:13,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:13,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:13,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:13,669 INFO L87 Difference]: Start difference. First operand 127 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 10:38:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:13,764 INFO L93 Difference]: Finished difference Result 261 states and 394 transitions. [2025-02-05 10:38:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 50 [2025-02-05 10:38:13,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:13,766 INFO L225 Difference]: With dead ends: 261 [2025-02-05 10:38:13,766 INFO L226 Difference]: Without dead ends: 144 [2025-02-05 10:38:13,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-02-05 10:38:13,767 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 10 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:13,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 252 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:13,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-05 10:38:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2025-02-05 10:38:13,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.4755244755244756) internal successors, (211), 143 states have internal predecessors, (211), 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-02-05 10:38:13,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-02-05 10:38:13,772 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 50 [2025-02-05 10:38:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:13,772 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-02-05 10:38:13,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 10:38:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-02-05 10:38:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:38:13,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:13,774 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:13,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:13,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:13,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1412305144, now seen corresponding path program 1 times [2025-02-05 10:38:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:13,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [437408432] [2025-02-05 10:38:13,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:13,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:13,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:38:14,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 10:38:14,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:38:14,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:14,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:14,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:14,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:14,059 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:14,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437408432] [2025-02-05 10:38:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437408432] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:14,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:14,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:14,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983767813] [2025-02-05 10:38:14,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:14,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:14,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:14,060 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:14,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:14,179 INFO L93 Difference]: Finished difference Result 318 states and 483 transitions. [2025-02-05 10:38:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2025-02-05 10:38:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:14,180 INFO L225 Difference]: With dead ends: 318 [2025-02-05 10:38:14,180 INFO L226 Difference]: Without dead ends: 184 [2025-02-05 10:38:14,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-02-05 10:38:14,181 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 25 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:14,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 234 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-05 10:38:14,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2025-02-05 10:38:14,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 183 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-02-05 10:38:14,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 256 transitions. [2025-02-05 10:38:14,191 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 256 transitions. Word has length 67 [2025-02-05 10:38:14,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:14,191 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 256 transitions. [2025-02-05 10:38:14,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:14,191 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 256 transitions. [2025-02-05 10:38:14,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 10:38:14,192 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:14,192 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:14,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:14,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:14,401 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:14,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1637897671, now seen corresponding path program 1 times [2025-02-05 10:38:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697602884] [2025-02-05 10:38:14,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:14,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:14,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:38:14,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 10:38:14,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 10:38:14,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:14,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:14,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:14,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:14,515 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:14,516 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:14,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697602884] [2025-02-05 10:38:14,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697602884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:14,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:14,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:14,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445516261] [2025-02-05 10:38:14,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:14,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:14,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:14,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:14,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:14,517 INFO L87 Difference]: Start difference. First operand 184 states and 256 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:14,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:14,642 INFO L93 Difference]: Finished difference Result 377 states and 532 transitions. [2025-02-05 10:38:14,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 67 [2025-02-05 10:38:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:14,643 INFO L225 Difference]: With dead ends: 377 [2025-02-05 10:38:14,643 INFO L226 Difference]: Without dead ends: 203 [2025-02-05 10:38:14,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-02-05 10:38:14,644 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:14,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 257 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-05 10:38:14,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-05 10:38:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.386138613861386) internal successors, (280), 202 states have internal predecessors, (280), 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-02-05 10:38:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 280 transitions. [2025-02-05 10:38:14,649 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 280 transitions. Word has length 67 [2025-02-05 10:38:14,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:14,650 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 280 transitions. [2025-02-05 10:38:14,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-02-05 10:38:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 280 transitions. [2025-02-05 10:38:14,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 10:38:14,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:14,651 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:14,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:38:14,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:14,855 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:14,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash -573636941, now seen corresponding path program 1 times [2025-02-05 10:38:14,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:14,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229401669] [2025-02-05 10:38:14,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:14,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:14,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:14,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:14,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:38:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 10:38:14,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 10:38:14,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:14,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:14,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:14,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 10:38:14,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:14,936 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229401669] [2025-02-05 10:38:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229401669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:14,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:14,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:14,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163299820] [2025-02-05 10:38:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:14,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:14,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:14,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:14,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:14,937 INFO L87 Difference]: Start difference. First operand 203 states and 280 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-05 10:38:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:15,020 INFO L93 Difference]: Finished difference Result 417 states and 584 transitions. [2025-02-05 10:38:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 83 [2025-02-05 10:38:15,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:15,021 INFO L225 Difference]: With dead ends: 417 [2025-02-05 10:38:15,021 INFO L226 Difference]: Without dead ends: 224 [2025-02-05 10:38:15,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 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-02-05 10:38:15,022 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 9 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:15,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 256 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:15,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-02-05 10:38:15,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-02-05 10:38:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.3721973094170403) internal successors, (306), 223 states have internal predecessors, (306), 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-02-05 10:38:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 306 transitions. [2025-02-05 10:38:15,028 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 306 transitions. Word has length 83 [2025-02-05 10:38:15,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:15,028 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 306 transitions. [2025-02-05 10:38:15,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-02-05 10:38:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 306 transitions. [2025-02-05 10:38:15,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 10:38:15,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:15,030 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:15,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:38:15,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,230 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:15,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash 264433237, now seen corresponding path program 1 times [2025-02-05 10:38:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:15,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150450686] [2025-02-05 10:38:15,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:15,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:15,233 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:15,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:38:15,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 10:38:15,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 10:38:15,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:15,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:15,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:15,356 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 10:38:15,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:15,357 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:15,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150450686] [2025-02-05 10:38:15,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150450686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:15,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:15,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:15,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049649695] [2025-02-05 10:38:15,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:15,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:15,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:15,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:15,358 INFO L87 Difference]: Start difference. First operand 224 states and 306 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:15,384 INFO L93 Difference]: Finished difference Result 649 states and 888 transitions. [2025-02-05 10:38:15,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:15,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2025-02-05 10:38:15,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:15,386 INFO L225 Difference]: With dead ends: 649 [2025-02-05 10:38:15,386 INFO L226 Difference]: Without dead ends: 435 [2025-02-05 10:38:15,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-02-05 10:38:15,387 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:15,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-02-05 10:38:15,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-02-05 10:38:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.359447004608295) internal successors, (590), 434 states have internal predecessors, (590), 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-02-05 10:38:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2025-02-05 10:38:15,395 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 103 [2025-02-05 10:38:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:15,396 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2025-02-05 10:38:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:38:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2025-02-05 10:38:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-05 10:38:15,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:15,397 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:15,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 10:38:15,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:15,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -902263082, now seen corresponding path program 1 times [2025-02-05 10:38:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326515255] [2025-02-05 10:38:15,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:15,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:15,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:15,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:38:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-05 10:38:15,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-05 10:38:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:15,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:15,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 10:38:15,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:15,683 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:15,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326515255] [2025-02-05 10:38:15,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326515255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:15,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:15,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:15,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565876179] [2025-02-05 10:38:15,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:15,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:15,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:15,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:15,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:15,687 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 10:38:15,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:15,718 INFO L93 Difference]: Finished difference Result 881 states and 1194 transitions. [2025-02-05 10:38:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:15,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 103 [2025-02-05 10:38:15,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:15,720 INFO L225 Difference]: With dead ends: 881 [2025-02-05 10:38:15,720 INFO L226 Difference]: Without dead ends: 456 [2025-02-05 10:38:15,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-02-05 10:38:15,722 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:15,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 337 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:15,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-02-05 10:38:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2025-02-05 10:38:15,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 455 states have internal predecessors, (617), 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-02-05 10:38:15,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 617 transitions. [2025-02-05 10:38:15,735 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 617 transitions. Word has length 103 [2025-02-05 10:38:15,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:15,735 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 617 transitions. [2025-02-05 10:38:15,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-02-05 10:38:15,735 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 617 transitions. [2025-02-05 10:38:15,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-05 10:38:15,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:15,739 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:15,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:38:15,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,940 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:15,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -876680923, now seen corresponding path program 1 times [2025-02-05 10:38:15,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:15,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1756374714] [2025-02-05 10:38:15,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:15,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:15,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:38:15,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-05 10:38:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-05 10:38:16,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:16,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:16,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:16,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-02-05 10:38:16,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:16,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:16,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756374714] [2025-02-05 10:38:16,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756374714] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:16,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:16,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:16,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246517150] [2025-02-05 10:38:16,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:16,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:16,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:16,116 INFO L87 Difference]: Start difference. First operand 456 states and 617 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:38:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:16,132 INFO L93 Difference]: Finished difference Result 928 states and 1254 transitions. [2025-02-05 10:38:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:16,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 104 [2025-02-05 10:38:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:16,133 INFO L225 Difference]: With dead ends: 928 [2025-02-05 10:38:16,133 INFO L226 Difference]: Without dead ends: 482 [2025-02-05 10:38:16,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 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-02-05 10:38:16,134 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 20 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:16,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 309 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:16,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-02-05 10:38:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2025-02-05 10:38:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 481 states have (on average 1.3513513513513513) internal successors, (650), 481 states have internal predecessors, (650), 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-02-05 10:38:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 650 transitions. [2025-02-05 10:38:16,141 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 650 transitions. Word has length 104 [2025-02-05 10:38:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:16,141 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 650 transitions. [2025-02-05 10:38:16,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-02-05 10:38:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 650 transitions. [2025-02-05 10:38:16,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 10:38:16,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:16,142 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:16,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 10:38:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:16,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -550310, now seen corresponding path program 1 times [2025-02-05 10:38:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916033747] [2025-02-05 10:38:16,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:16,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:16,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:16,351 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:16,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:38:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 10:38:16,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 10:38:16,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:16,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:16,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:16,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:16,462 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-05 10:38:16,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:16,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916033747] [2025-02-05 10:38:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916033747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:16,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687738375] [2025-02-05 10:38:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:16,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:16,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:16,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:16,463 INFO L87 Difference]: Start difference. First operand 482 states and 650 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-02-05 10:38:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:16,491 INFO L93 Difference]: Finished difference Result 1121 states and 1519 transitions. [2025-02-05 10:38:16,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:16,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 105 [2025-02-05 10:38:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:16,493 INFO L225 Difference]: With dead ends: 1121 [2025-02-05 10:38:16,493 INFO L226 Difference]: Without dead ends: 675 [2025-02-05 10:38:16,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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-02-05 10:38:16,494 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 123 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:16,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 456 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:16,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2025-02-05 10:38:16,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 675. [2025-02-05 10:38:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 674 states have (on average 1.3501483679525224) internal successors, (910), 674 states have internal predecessors, (910), 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-02-05 10:38:16,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 910 transitions. [2025-02-05 10:38:16,504 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 910 transitions. Word has length 105 [2025-02-05 10:38:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:16,504 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 910 transitions. [2025-02-05 10:38:16,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-02-05 10:38:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 910 transitions. [2025-02-05 10:38:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-05 10:38:16,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:16,505 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:16,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:16,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:16,709 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:16,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash -67557063, now seen corresponding path program 1 times [2025-02-05 10:38:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457909389] [2025-02-05 10:38:16,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:16,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:16,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:16,713 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:16,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:38:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-05 10:38:16,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-05 10:38:16,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:16,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:16,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 10:38:16,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:16,828 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:16,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457909389] [2025-02-05 10:38:16,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457909389] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:16,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:16,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:16,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331606556] [2025-02-05 10:38:16,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:16,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:16,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:16,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:16,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:16,829 INFO L87 Difference]: Start difference. First operand 675 states and 910 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-02-05 10:38:16,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:16,845 INFO L93 Difference]: Finished difference Result 1339 states and 1804 transitions. [2025-02-05 10:38:16,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:16,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 105 [2025-02-05 10:38:16,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:16,848 INFO L225 Difference]: With dead ends: 1339 [2025-02-05 10:38:16,848 INFO L226 Difference]: Without dead ends: 700 [2025-02-05 10:38:16,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 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-02-05 10:38:16,848 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 10 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:16,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2025-02-05 10:38:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2025-02-05 10:38:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 699 states have (on average 1.3447782546494993) internal successors, (940), 699 states have internal predecessors, (940), 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-02-05 10:38:16,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 940 transitions. [2025-02-05 10:38:16,874 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 940 transitions. Word has length 105 [2025-02-05 10:38:16,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:16,874 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 940 transitions. [2025-02-05 10:38:16,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-02-05 10:38:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 940 transitions. [2025-02-05 10:38:16,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 10:38:16,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:16,876 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-05 10:38:16,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-05 10:38:17,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:17,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:17,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1778180324, now seen corresponding path program 1 times [2025-02-05 10:38:17,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:17,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846671376] [2025-02-05 10:38:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:17,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:17,083 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:17,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:38:17,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 10:38:17,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 10:38:17,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:17,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:17,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:17,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2025-02-05 10:38:17,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:17,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846671376] [2025-02-05 10:38:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846671376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115575248] [2025-02-05 10:38:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:17,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:17,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:17,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:17,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:17,231 INFO L87 Difference]: Start difference. First operand 700 states and 940 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-02-05 10:38:17,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:17,246 INFO L93 Difference]: Finished difference Result 1573 states and 2116 transitions. [2025-02-05 10:38:17,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:17,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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 173 [2025-02-05 10:38:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:17,249 INFO L225 Difference]: With dead ends: 1573 [2025-02-05 10:38:17,249 INFO L226 Difference]: Without dead ends: 909 [2025-02-05 10:38:17,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 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-02-05 10:38:17,251 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 117 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:17,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 466 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:17,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-02-05 10:38:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2025-02-05 10:38:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.3436123348017621) internal successors, (1220), 908 states have internal predecessors, (1220), 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-02-05 10:38:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1220 transitions. [2025-02-05 10:38:17,267 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1220 transitions. Word has length 173 [2025-02-05 10:38:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1220 transitions. [2025-02-05 10:38:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 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-02-05 10:38:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1220 transitions. [2025-02-05 10:38:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 10:38:17,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:17,272 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-02-05 10:38:17,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 10:38:17,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1812163537, now seen corresponding path program 1 times [2025-02-05 10:38:17,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475591696] [2025-02-05 10:38:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:17,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:17,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:17,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:38:17,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 10:38:17,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 10:38:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:17,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:17,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 10:38:17,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:17,633 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:17,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475591696] [2025-02-05 10:38:17,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475591696] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:17,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846866651] [2025-02-05 10:38:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:17,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:17,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:17,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:17,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:17,634 INFO L87 Difference]: Start difference. First operand 909 states and 1220 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 10:38:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:17,658 INFO L93 Difference]: Finished difference Result 2369 states and 3224 transitions. [2025-02-05 10:38:17,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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 175 [2025-02-05 10:38:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:17,662 INFO L225 Difference]: With dead ends: 2369 [2025-02-05 10:38:17,662 INFO L226 Difference]: Without dead ends: 1517 [2025-02-05 10:38:17,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-02-05 10:38:17,663 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 112 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:17,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 394 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2025-02-05 10:38:17,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1515. [2025-02-05 10:38:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 1.3639365918097754) internal successors, (2065), 1514 states have internal predecessors, (2065), 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-02-05 10:38:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2065 transitions. [2025-02-05 10:38:17,687 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2065 transitions. Word has length 175 [2025-02-05 10:38:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:17,687 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2065 transitions. [2025-02-05 10:38:17,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 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-02-05 10:38:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2065 transitions. [2025-02-05 10:38:17,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 10:38:17,689 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:17,689 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 10:38:17,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:17,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1274848640, now seen corresponding path program 1 times [2025-02-05 10:38:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1934264656] [2025-02-05 10:38:17,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:17,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:17,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:17,895 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:17,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-05 10:38:17,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 10:38:17,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 10:38:17,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:17,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:17,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:17,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2025-02-05 10:38:17,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:17,976 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934264656] [2025-02-05 10:38:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934264656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853812417] [2025-02-05 10:38:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:17,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:17,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:17,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:17,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:17,977 INFO L87 Difference]: Start difference. First operand 1515 states and 2065 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-02-05 10:38:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:18,079 INFO L93 Difference]: Finished difference Result 3157 states and 4392 transitions. [2025-02-05 10:38:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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 175 [2025-02-05 10:38:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:18,083 INFO L225 Difference]: With dead ends: 3157 [2025-02-05 10:38:18,083 INFO L226 Difference]: Without dead ends: 1699 [2025-02-05 10:38:18,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 173 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-02-05 10:38:18,084 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 17 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:18,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 255 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:18,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2025-02-05 10:38:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1699. [2025-02-05 10:38:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.3480565371024735) internal successors, (2289), 1698 states have internal predecessors, (2289), 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-02-05 10:38:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2289 transitions. [2025-02-05 10:38:18,124 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2289 transitions. Word has length 175 [2025-02-05 10:38:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:18,124 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2289 transitions. [2025-02-05 10:38:18,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 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-02-05 10:38:18,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2289 transitions. [2025-02-05 10:38:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 10:38:18,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:18,126 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 10:38:18,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:18,326 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash -913768033, now seen corresponding path program 1 times [2025-02-05 10:38:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1259355038] [2025-02-05 10:38:18,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:18,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:18,331 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:18,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-05 10:38:18,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 10:38:18,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 10:38:18,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:18,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:18,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:38:18,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 458 proven. 20 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 10:38:18,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 442 proven. 36 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2025-02-05 10:38:18,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:18,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259355038] [2025-02-05 10:38:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259355038] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:18,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-02-05 10:38:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453843278] [2025-02-05 10:38:18,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:18,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:18,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:18,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:18,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:18,618 INFO L87 Difference]: Start difference. First operand 1699 states and 2289 transitions. Second operand has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 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-02-05 10:38:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:19,053 INFO L93 Difference]: Finished difference Result 4156 states and 5749 transitions. [2025-02-05 10:38:19,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:19,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 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 196 [2025-02-05 10:38:19,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:19,060 INFO L225 Difference]: With dead ends: 4156 [2025-02-05 10:38:19,060 INFO L226 Difference]: Without dead ends: 2514 [2025-02-05 10:38:19,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:19,062 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 376 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:19,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 845 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:38:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2514 states. [2025-02-05 10:38:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2514 to 2338. [2025-02-05 10:38:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2337 states have (on average 1.3607188703465982) internal successors, (3180), 2337 states have internal predecessors, (3180), 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-02-05 10:38:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3180 transitions. [2025-02-05 10:38:19,102 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3180 transitions. Word has length 196 [2025-02-05 10:38:19,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:19,102 INFO L471 AbstractCegarLoop]: Abstraction has 2338 states and 3180 transitions. [2025-02-05 10:38:19,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 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-02-05 10:38:19,102 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3180 transitions. [2025-02-05 10:38:19,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 10:38:19,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:19,105 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:19,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-05 10:38:19,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:19,305 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:19,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash -421181296, now seen corresponding path program 1 times [2025-02-05 10:38:19,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:19,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416514033] [2025-02-05 10:38:19,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:19,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:19,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:19,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:19,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-05 10:38:19,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 10:38:19,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 10:38:19,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:19,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:19,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:19,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 10:38:19,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:19,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416514033] [2025-02-05 10:38:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416514033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:19,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:19,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:19,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539953188] [2025-02-05 10:38:19,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:19,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:19,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:19,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:19,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:19,417 INFO L87 Difference]: Start difference. First operand 2338 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-05 10:38:19,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:19,519 INFO L93 Difference]: Finished difference Result 4899 states and 6786 transitions. [2025-02-05 10:38:19,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:19,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 221 [2025-02-05 10:38:19,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:19,526 INFO L225 Difference]: With dead ends: 4899 [2025-02-05 10:38:19,526 INFO L226 Difference]: Without dead ends: 2618 [2025-02-05 10:38:19,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 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-02-05 10:38:19,528 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:19,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2025-02-05 10:38:19,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2618. [2025-02-05 10:38:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2617 states have (on average 1.3412304165074513) internal successors, (3510), 2617 states have internal predecessors, (3510), 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-02-05 10:38:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 3510 transitions. [2025-02-05 10:38:19,568 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 3510 transitions. Word has length 221 [2025-02-05 10:38:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 3510 transitions. [2025-02-05 10:38:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-05 10:38:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 3510 transitions. [2025-02-05 10:38:19,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 10:38:19,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:19,572 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:19,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-05 10:38:19,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:19,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:19,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:19,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1230668753, now seen corresponding path program 1 times [2025-02-05 10:38:19,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:19,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136164177] [2025-02-05 10:38:19,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:19,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:19,776 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:19,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-05 10:38:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 10:38:19,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 10:38:19,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:19,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:19,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:19,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:19,890 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 463 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-02-05 10:38:19,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:19,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:19,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136164177] [2025-02-05 10:38:19,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136164177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:19,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:19,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:19,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318194952] [2025-02-05 10:38:19,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:19,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:19,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:19,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:19,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:19,891 INFO L87 Difference]: Start difference. First operand 2618 states and 3510 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-05 10:38:20,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:20,014 INFO L93 Difference]: Finished difference Result 5489 states and 7516 transitions. [2025-02-05 10:38:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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 221 [2025-02-05 10:38:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:20,022 INFO L225 Difference]: With dead ends: 5489 [2025-02-05 10:38:20,022 INFO L226 Difference]: Without dead ends: 2928 [2025-02-05 10:38:20,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 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-02-05 10:38:20,024 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 24 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:20,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 258 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-02-05 10:38:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2928. [2025-02-05 10:38:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2928 states, 2927 states have (on average 1.3221728732490605) internal successors, (3870), 2927 states have internal predecessors, (3870), 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-02-05 10:38:20,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 3870 transitions. [2025-02-05 10:38:20,072 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 3870 transitions. Word has length 221 [2025-02-05 10:38:20,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:20,073 INFO L471 AbstractCegarLoop]: Abstraction has 2928 states and 3870 transitions. [2025-02-05 10:38:20,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-02-05 10:38:20,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 3870 transitions. [2025-02-05 10:38:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 10:38:20,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:20,076 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:20,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:20,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:20,277 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:20,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash 849380872, now seen corresponding path program 1 times [2025-02-05 10:38:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [408162506] [2025-02-05 10:38:20,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:20,284 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:20,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-05 10:38:20,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 10:38:20,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 10:38:20,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:20,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:20,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:20,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-02-05 10:38:20,450 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:20,450 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408162506] [2025-02-05 10:38:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408162506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:20,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891720677] [2025-02-05 10:38:20,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:20,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:20,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:20,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:20,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:20,453 INFO L87 Difference]: Start difference. First operand 2928 states and 3870 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-02-05 10:38:20,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:20,499 INFO L93 Difference]: Finished difference Result 8380 states and 11122 transitions. [2025-02-05 10:38:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:20,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 251 [2025-02-05 10:38:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:20,511 INFO L225 Difference]: With dead ends: 8380 [2025-02-05 10:38:20,512 INFO L226 Difference]: Without dead ends: 5509 [2025-02-05 10:38:20,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 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-02-05 10:38:20,515 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 123 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:20,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 474 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:20,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2025-02-05 10:38:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5507. [2025-02-05 10:38:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5507 states, 5506 states have (on average 1.326734471485652) internal successors, (7305), 5506 states have internal predecessors, (7305), 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-02-05 10:38:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5507 states to 5507 states and 7305 transitions. [2025-02-05 10:38:20,641 INFO L78 Accepts]: Start accepts. Automaton has 5507 states and 7305 transitions. Word has length 251 [2025-02-05 10:38:20,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:20,641 INFO L471 AbstractCegarLoop]: Abstraction has 5507 states and 7305 transitions. [2025-02-05 10:38:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-02-05 10:38:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 5507 states and 7305 transitions. [2025-02-05 10:38:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-02-05 10:38:20,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:20,649 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:20,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:20,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:20,850 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:20,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:20,850 INFO L85 PathProgramCache]: Analyzing trace with hash 39893415, now seen corresponding path program 1 times [2025-02-05 10:38:20,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:20,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725982121] [2025-02-05 10:38:20,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:20,853 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:20,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-05 10:38:20,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-02-05 10:38:20,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-02-05 10:38:20,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:20,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:20,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:20,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-05 10:38:20,989 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:20,989 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:20,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725982121] [2025-02-05 10:38:20,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725982121] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:20,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:20,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:20,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316839877] [2025-02-05 10:38:20,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:20,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:20,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:20,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:20,990 INFO L87 Difference]: Start difference. First operand 5507 states and 7305 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-02-05 10:38:21,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:21,152 INFO L93 Difference]: Finished difference Result 11667 states and 15846 transitions. [2025-02-05 10:38:21,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:21,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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 251 [2025-02-05 10:38:21,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:21,165 INFO L225 Difference]: With dead ends: 11667 [2025-02-05 10:38:21,165 INFO L226 Difference]: Without dead ends: 6217 [2025-02-05 10:38:21,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 249 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-02-05 10:38:21,169 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:21,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 257 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:21,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6217 states. [2025-02-05 10:38:21,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6217 to 6217. [2025-02-05 10:38:21,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6217 states, 6216 states have (on average 1.3055019305019304) internal successors, (8115), 6216 states have internal predecessors, (8115), 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-02-05 10:38:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6217 states to 6217 states and 8115 transitions. [2025-02-05 10:38:21,247 INFO L78 Accepts]: Start accepts. Automaton has 6217 states and 8115 transitions. Word has length 251 [2025-02-05 10:38:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:21,247 INFO L471 AbstractCegarLoop]: Abstraction has 6217 states and 8115 transitions. [2025-02-05 10:38:21,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 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-02-05 10:38:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6217 states and 8115 transitions. [2025-02-05 10:38:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-02-05 10:38:21,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:21,253 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:21,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:21,454 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1868721223, now seen corresponding path program 1 times [2025-02-05 10:38:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399553325] [2025-02-05 10:38:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:21,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:21,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:21,457 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:21,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-05 10:38:21,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-02-05 10:38:21,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-02-05 10:38:21,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:21,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:21,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:21,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1101 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-02-05 10:38:21,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:21,583 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399553325] [2025-02-05 10:38:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399553325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:21,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313822650] [2025-02-05 10:38:21,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:21,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:21,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:21,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:21,585 INFO L87 Difference]: Start difference. First operand 6217 states and 8115 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-02-05 10:38:21,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:21,718 INFO L93 Difference]: Finished difference Result 12707 states and 16766 transitions. [2025-02-05 10:38:21,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:21,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 275 [2025-02-05 10:38:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:21,735 INFO L225 Difference]: With dead ends: 12707 [2025-02-05 10:38:21,735 INFO L226 Difference]: Without dead ends: 6547 [2025-02-05 10:38:21,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 273 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-02-05 10:38:21,742 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:21,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 257 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6547 states. [2025-02-05 10:38:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6547 to 6547. [2025-02-05 10:38:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6547 states, 6546 states have (on average 1.297739077299114) internal successors, (8495), 6546 states have internal predecessors, (8495), 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-02-05 10:38:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 8495 transitions. [2025-02-05 10:38:21,861 INFO L78 Accepts]: Start accepts. Automaton has 6547 states and 8495 transitions. Word has length 275 [2025-02-05 10:38:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 6547 states and 8495 transitions. [2025-02-05 10:38:21,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-02-05 10:38:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6547 states and 8495 transitions. [2025-02-05 10:38:21,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-02-05 10:38:21,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:21,872 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:21,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:22,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:22,072 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:22,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1214237098, now seen corresponding path program 1 times [2025-02-05 10:38:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:22,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359635948] [2025-02-05 10:38:22,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:22,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:22,077 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:22,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-05 10:38:22,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-05 10:38:22,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-05 10:38:22,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:22,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:22,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:22,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 605 proven. 0 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2025-02-05 10:38:22,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:22,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:22,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359635948] [2025-02-05 10:38:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359635948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:22,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:22,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:22,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773104034] [2025-02-05 10:38:22,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:22,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:22,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:22,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:22,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:22,184 INFO L87 Difference]: Start difference. First operand 6547 states and 8495 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-02-05 10:38:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:22,366 INFO L93 Difference]: Finished difference Result 13777 states and 18296 transitions. [2025-02-05 10:38:22,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:22,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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 286 [2025-02-05 10:38:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:22,377 INFO L225 Difference]: With dead ends: 13777 [2025-02-05 10:38:22,377 INFO L226 Difference]: Without dead ends: 7287 [2025-02-05 10:38:22,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 284 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-02-05 10:38:22,381 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 31 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:22,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2025-02-05 10:38:22,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 7287. [2025-02-05 10:38:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7287 states, 7286 states have (on average 1.28122426571507) internal successors, (9335), 7286 states have internal predecessors, (9335), 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-02-05 10:38:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7287 states to 7287 states and 9335 transitions. [2025-02-05 10:38:22,517 INFO L78 Accepts]: Start accepts. Automaton has 7287 states and 9335 transitions. Word has length 286 [2025-02-05 10:38:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:22,518 INFO L471 AbstractCegarLoop]: Abstraction has 7287 states and 9335 transitions. [2025-02-05 10:38:22,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 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-02-05 10:38:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 7287 states and 9335 transitions. [2025-02-05 10:38:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-02-05 10:38:22,524 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:22,524 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:22,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-05 10:38:22,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:22,725 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:22,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1441505786, now seen corresponding path program 1 times [2025-02-05 10:38:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:22,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [436431799] [2025-02-05 10:38:22,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:22,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:22,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:22,728 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:22,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-05 10:38:22,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-02-05 10:38:22,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-02-05 10:38:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:22,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:22,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1325 backedges. 676 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-05 10:38:22,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:22,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436431799] [2025-02-05 10:38:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436431799] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:22,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:22,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901887620] [2025-02-05 10:38:22,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:22,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:22,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:22,855 INFO L87 Difference]: Start difference. First operand 7287 states and 9335 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-02-05 10:38:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:23,050 INFO L93 Difference]: Finished difference Result 15347 states and 20126 transitions. [2025-02-05 10:38:23,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:23,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 322 [2025-02-05 10:38:23,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:23,062 INFO L225 Difference]: With dead ends: 15347 [2025-02-05 10:38:23,062 INFO L226 Difference]: Without dead ends: 8117 [2025-02-05 10:38:23,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 320 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-02-05 10:38:23,067 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:23,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 254 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:23,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8117 states. [2025-02-05 10:38:23,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 8097. [2025-02-05 10:38:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8097 states, 8096 states have (on average 1.2654397233201582) internal successors, (10245), 8096 states have internal predecessors, (10245), 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-02-05 10:38:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 10245 transitions. [2025-02-05 10:38:23,145 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 10245 transitions. Word has length 322 [2025-02-05 10:38:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:23,146 INFO L471 AbstractCegarLoop]: Abstraction has 8097 states and 10245 transitions. [2025-02-05 10:38:23,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-02-05 10:38:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 10245 transitions. [2025-02-05 10:38:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-02-05 10:38:23,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:23,151 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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-02-05 10:38:23,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:23,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:23,352 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1262691968, now seen corresponding path program 1 times [2025-02-05 10:38:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093724714] [2025-02-05 10:38:23,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:23,355 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:23,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-05 10:38:23,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-05 10:38:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-05 10:38:23,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:23,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:23,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:23,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-05 10:38:23,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:23,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 905 proven. 10 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-02-05 10:38:23,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:23,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093724714] [2025-02-05 10:38:23,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093724714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:23,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:23,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-05 10:38:23,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65900306] [2025-02-05 10:38:23,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:23,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:23,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:23,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:23,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:23,559 INFO L87 Difference]: Start difference. First operand 8097 states and 10245 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-02-05 10:38:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,123 INFO L93 Difference]: Finished difference Result 21244 states and 27058 transitions. [2025-02-05 10:38:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:38:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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 359 [2025-02-05 10:38:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,138 INFO L225 Difference]: With dead ends: 21244 [2025-02-05 10:38:24,138 INFO L226 Difference]: Without dead ends: 13204 [2025-02-05 10:38:24,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 724 GetRequests, 716 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:38:24,145 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 352 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 976 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:38:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13204 states. [2025-02-05 10:38:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13204 to 8955. [2025-02-05 10:38:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8955 states, 8954 states have (on average 1.2763010944829127) internal successors, (11428), 8954 states have internal predecessors, (11428), 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-02-05 10:38:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8955 states to 8955 states and 11428 transitions. [2025-02-05 10:38:24,276 INFO L78 Accepts]: Start accepts. Automaton has 8955 states and 11428 transitions. Word has length 359 [2025-02-05 10:38:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,276 INFO L471 AbstractCegarLoop]: Abstraction has 8955 states and 11428 transitions. [2025-02-05 10:38:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 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-02-05 10:38:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8955 states and 11428 transitions. [2025-02-05 10:38:24,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2025-02-05 10:38:24,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,283 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1] [2025-02-05 10:38:24,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-02-05 10:38:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:24,483 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash -751879520, now seen corresponding path program 1 times [2025-02-05 10:38:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [326776881] [2025-02-05 10:38:24,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:24,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:24,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:24,486 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:24,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-02-05 10:38:24,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes. [2025-02-05 10:38:24,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements. [2025-02-05 10:38:24,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:24,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:24,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:24,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2025-02-05 10:38:24,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:24,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:24,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326776881] [2025-02-05 10:38:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326776881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:24,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455628035] [2025-02-05 10:38:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:24,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:24,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:24,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:24,597 INFO L87 Difference]: Start difference. First operand 8955 states and 11428 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-02-05 10:38:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:24,743 INFO L93 Difference]: Finished difference Result 16797 states and 21760 transitions. [2025-02-05 10:38:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:24,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 398 [2025-02-05 10:38:24,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:24,748 INFO L225 Difference]: With dead ends: 16797 [2025-02-05 10:38:24,748 INFO L226 Difference]: Without dead ends: 4321 [2025-02-05 10:38:24,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 396 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-02-05 10:38:24,756 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:24,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 257 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4321 states. [2025-02-05 10:38:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4321 to 4202. [2025-02-05 10:38:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4202 states, 4201 states have (on average 1.2404189478695549) internal successors, (5211), 4201 states have internal predecessors, (5211), 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-02-05 10:38:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4202 states to 4202 states and 5211 transitions. [2025-02-05 10:38:24,793 INFO L78 Accepts]: Start accepts. Automaton has 4202 states and 5211 transitions. Word has length 398 [2025-02-05 10:38:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:24,793 INFO L471 AbstractCegarLoop]: Abstraction has 4202 states and 5211 transitions. [2025-02-05 10:38:24,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-02-05 10:38:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4202 states and 5211 transitions. [2025-02-05 10:38:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2025-02-05 10:38:24,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:24,797 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 18, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:24,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-02-05 10:38:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:25,001 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1082292853, now seen corresponding path program 1 times [2025-02-05 10:38:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846726957] [2025-02-05 10:38:25,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:25,008 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:25,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-02-05 10:38:25,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 509 statements into 1 equivalence classes. [2025-02-05 10:38:25,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 509 of 509 statements. [2025-02-05 10:38:25,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:25,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2915 backedges. 1080 proven. 0 refuted. 0 times theorem prover too weak. 1835 trivial. 0 not checked. [2025-02-05 10:38:25,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:25,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846726957] [2025-02-05 10:38:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846726957] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:25,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:25,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:38:25,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294022214] [2025-02-05 10:38:25,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:25,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:25,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:25,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:25,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:25,567 INFO L87 Difference]: Start difference. First operand 4202 states and 5211 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-02-05 10:38:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:25,608 INFO L93 Difference]: Finished difference Result 4206 states and 5214 transitions. [2025-02-05 10:38:25,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:25,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 509 [2025-02-05 10:38:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:25,613 INFO L225 Difference]: With dead ends: 4206 [2025-02-05 10:38:25,613 INFO L226 Difference]: Without dead ends: 4130 [2025-02-05 10:38:25,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 507 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-02-05 10:38:25,614 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:25,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 256 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:25,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4130 states. [2025-02-05 10:38:25,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4130 to 4128. [2025-02-05 10:38:25,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4128 states, 4127 states have (on average 1.2406106130361036) internal successors, (5120), 4127 states have internal predecessors, (5120), 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-02-05 10:38:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 5120 transitions. [2025-02-05 10:38:25,676 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 5120 transitions. Word has length 509 [2025-02-05 10:38:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:25,677 INFO L471 AbstractCegarLoop]: Abstraction has 4128 states and 5120 transitions. [2025-02-05 10:38:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-02-05 10:38:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 5120 transitions. [2025-02-05 10:38:25,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2025-02-05 10:38:25,682 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:25,683 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 20, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:25,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:25,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:25,883 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:25,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1454611290, now seen corresponding path program 1 times [2025-02-05 10:38:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:38:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1769582714] [2025-02-05 10:38:25,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:25,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:25,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:25,887 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:25,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-02-05 10:38:25,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes. [2025-02-05 10:38:25,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements. [2025-02-05 10:38:25,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:25,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:25,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 687 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:38:26,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2025-02-05 10:38:26,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:26,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4151 backedges. 2135 proven. 14 refuted. 0 times theorem prover too weak. 2002 trivial. 0 not checked. [2025-02-05 10:38:26,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:38:26,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769582714] [2025-02-05 10:38:26,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769582714] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:26,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:38:26,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2025-02-05 10:38:26,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427783423] [2025-02-05 10:38:26,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:26,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:26,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:38:26,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:26,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:26,128 INFO L87 Difference]: Start difference. First operand 4128 states and 5120 transitions. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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-02-05 10:38:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:26,293 INFO L93 Difference]: Finished difference Result 4341 states and 5390 transitions. [2025-02-05 10:38:26,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:26,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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 619 [2025-02-05 10:38:26,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:26,295 INFO L225 Difference]: With dead ends: 4341 [2025-02-05 10:38:26,295 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:38:26,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1240 GetRequests, 1234 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:38:26,297 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 95 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:26,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 256 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:26,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:38:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:38:26,298 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-02-05 10:38:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:38:26,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 619 [2025-02-05 10:38:26,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:26,298 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:38:26,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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-02-05 10:38:26,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:38:26,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:38:26,301 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:38:26,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-02-05 10:38:26,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:26,504 INFO L422 BasicCegarLoop]: Path program 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] [2025-02-05 10:38:26,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:38:28,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:38:28,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:38:28 BoogieIcfgContainer [2025-02-05 10:38:28,958 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:38:28,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:38:28,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:38:28,959 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:38:28,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:12" (3/4) ... [2025-02-05 10:38:28,965 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:38:28,974 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-02-05 10:38:28,974 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:38:28,974 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:38:28,975 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:38:29,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:38:29,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:38:29,051 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:38:29,052 INFO L158 Benchmark]: Toolchain (without parser) took 17315.86ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 116.7MB in the beginning and 215.7MB in the end (delta: -99.0MB). Peak memory consumption was 331.3MB. Max. memory is 16.1GB. [2025-02-05 10:38:29,052 INFO L158 Benchmark]: CDTParser took 2.30ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:29,052 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.72ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 101.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:38:29,053 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.20ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:29,053 INFO L158 Benchmark]: Boogie Preprocessor took 39.90ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:38:29,053 INFO L158 Benchmark]: IcfgBuilder took 556.86ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 62.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 10:38:29,053 INFO L158 Benchmark]: TraceAbstraction took 16329.96ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 61.6MB in the beginning and 224.0MB in the end (delta: -162.4MB). Peak memory consumption was 350.3MB. Max. memory is 16.1GB. [2025-02-05 10:38:29,053 INFO L158 Benchmark]: Witness Printer took 92.57ms. Allocated memory is still 578.8MB. Free memory was 224.0MB in the beginning and 215.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:38:29,055 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.30ms. Allocated memory is still 117.4MB. Free memory is still 82.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.72ms. Allocated memory is still 142.6MB. Free memory was 116.5MB in the beginning and 101.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.20ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 98.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.90ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 96.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 556.86ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 62.2MB in the end (delta: 34.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16329.96ms. Allocated memory was 142.6MB in the beginning and 578.8MB in the end (delta: 436.2MB). Free memory was 61.6MB in the beginning and 224.0MB in the end (delta: -162.4MB). Peak memory consumption was 350.3MB. Max. memory is 16.1GB. * Witness Printer took 92.57ms. Allocated memory is still 578.8MB. Free memory was 224.0MB in the beginning and 215.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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: 618]: 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 CFG has 1 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 26, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1808 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1808 mSDsluCounter, 9076 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3912 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3332 IncrementalHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 5164 mSDtfsCounter, 3332 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6441 GetRequests, 6395 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8955occurred in iteration=23, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 4570 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 5278 NumberOfCodeBlocks, 5278 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6423 ConstructedInterpolants, 0 QuantifiedInterpolants, 9509 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6381 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 29 InterpolantComputations, 23 PerfectInterpolantSequences, 26326/26430 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 - InvariantResult [Line: 103]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4400 == s__state)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4368 != s__s3__tmp__next_state___0)) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (4560 == s__state)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit))) || ((((61087 == ag_Y) && (65535 == ag_X)) && (4512 == s__state)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || ((((((4432 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag))) || ((((61087 == ag_Y) && (65535 == ag_X)) && (4528 == s__state)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || (((2 == blastFlag) && (0 == s__hit)) && (3 == s__state))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4464 == s__state))) || (((4512 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4480 == s__state))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4480 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4480 == s__state))) || (((4560 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4560 == s__s3__tmp__next_state___0)) && (0 == s__hit)) && (4352 == s__state))) || ((((2 == blastFlag) && (0 != s__hit)) && (4352 == s__state)) && (3 == s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag)) && (4496 == s__state))) || (((2 == blastFlag) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0)) && (4496 == s__state))) || (((((4448 == s__state) && (61087 == ag_Y)) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit))) || (((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (0 == s__hit)) && (3 == blastFlag)) && (4416 == s__state))) || (((4400 == s__state) && (2 == blastFlag)) && (0 == s__hit))) || ((4384 == s__state) && (1 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (4 == blastFlag))) || (((((61087 == ag_Y) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit)) && (4496 == s__state))) || ((((((4448 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4464 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((0 == blastFlag) && (12292 == s__state))) || (((4560 == s__state) && (4560 == s__s3__tmp__next_state___0)) && (2 == blastFlag))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4512 == s__state)) && (0 == s__hit)) && (4 == blastFlag))) || (((((4432 == s__state) && (61087 == ag_Y)) && (65535 == ag_X)) && (2 == blastFlag)) && (0 == s__hit))) || (((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4416 == s__state)) && (4 == blastFlag)) && (4368 != s__s3__tmp__next_state___0))) || ((((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (4528 == s__state)) && (0 == s__hit)) && (4 == blastFlag))) || (((4528 == s__state) && (2 == blastFlag)) && (0 != s__hit))) || (((((61087 == ag_Y) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (3 == s__state)) && (4368 != s__s3__tmp__next_state___0))) || ((((61087 == ag_Y) && (2 == blastFlag)) && (0 == s__hit)) && (4416 == s__state))) || ((4368 == s__state) && (0 == blastFlag))) || ((((4560 == s__s3__tmp__next_state___0) && (2 == blastFlag)) && (0 == s__hit)) && (4352 == s__state))) || ((((((4448 == s__state) && (61087 == ag_Y)) && (256 == s__s3__tmp__new_cipher__algorithms)) && (65535 == ag_X)) && (0 == s__hit)) && (4 == blastFlag))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:38:29,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE