./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:10:57,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:10:57,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 15:10:57,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:10:57,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:10:58,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:10:58,036 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:10:58,037 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:10:58,037 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:10:58,038 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:10:58,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:10:58,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:10:58,039 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:10:58,040 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:10:58,042 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:10:58,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:10:58,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:10:58,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:10:58,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 15:10:58,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:10:58,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:10:58,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:10:58,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:10:58,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:10:58,048 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:10:58,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:10:58,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:10:58,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:10:58,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:10:58,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:10:58,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:10:58,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:10:58,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:10:58,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:10:58,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:10:58,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:10:58,051 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 15:10:58,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 15:10:58,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:10:58,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:10:58,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:10:58,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:10:58,053 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2024-10-12 15:10:58,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:10:58,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:10:58,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:10:58,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:10:58,360 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:10:58,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:10:59,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:10:59,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:10:59,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:10:59,961 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0efe8bcf7/dad6199eae704d2bb3147248b889a058/FLAG9fca51336 [2024-10-12 15:11:00,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0efe8bcf7/dad6199eae704d2bb3147248b889a058 [2024-10-12 15:11:00,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:00,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:00,333 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:00,333 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:00,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:00,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688a153b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00, skipping insertion in model container [2024-10-12 15:11:00,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:00,592 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-10-12 15:11:00,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:00,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:00,669 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-10-12 15:11:00,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:00,691 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:00,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00 WrapperNode [2024-10-12 15:11:00,692 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:00,693 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:00,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:00,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:00,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,765 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 528 [2024-10-12 15:11:00,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:00,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:00,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:00,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:00,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,817 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]. [2024-10-12 15:11:00,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:00,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:00,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:00,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:00,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (1/1) ... [2024-10-12 15:11:00,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:00,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:00,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:11:00,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:11:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:00,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 15:11:00,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:00,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:01,037 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:01,041 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:01,061 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:11:01,550 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-12 15:11:01,551 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-12 15:11:01,599 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:01,599 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:01,652 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:01,652 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:11:01,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:01 BoogieIcfgContainer [2024-10-12 15:11:01,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:01,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:01,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:01,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:01,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:00" (1/3) ... [2024-10-12 15:11:01,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:01, skipping insertion in model container [2024-10-12 15:11:01,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:00" (2/3) ... [2024-10-12 15:11:01,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:01, skipping insertion in model container [2024-10-12 15:11:01,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:01" (3/3) ... [2024-10-12 15:11:01,660 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:11:01,685 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:01,686 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:01,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:01,744 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;@5b8d6813, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:01,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 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) [2024-10-12 15:11:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:11:01,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:01,755 INFO L215 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] [2024-10-12 15:11:01,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:01,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1091064671, now seen corresponding path program 1 times [2024-10-12 15:11:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:01,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308481728] [2024-10-12 15:11:01,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:01,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:01,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:01,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308481728] [2024-10-12 15:11:01,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308481728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:01,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:01,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:01,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944224651] [2024-10-12 15:11:01,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:01,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:02,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:02,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,011 INFO L87 Difference]: Start difference. First operand has 127 states, 125 states have (on average 1.76) internal successors, (220), 126 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:02,212 INFO L93 Difference]: Finished difference Result 249 states and 433 transitions. [2024-10-12 15:11:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:02,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 15:11:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:02,222 INFO L225 Difference]: With dead ends: 249 [2024-10-12 15:11:02,222 INFO L226 Difference]: Without dead ends: 117 [2024-10-12 15:11:02,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,228 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 7 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:02,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 319 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-12 15:11:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-12 15:11:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.543103448275862) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2024-10-12 15:11:02,276 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 23 [2024-10-12 15:11:02,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:02,277 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2024-10-12 15:11:02,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,277 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2024-10-12 15:11:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 15:11:02,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:02,279 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:02,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 15:11:02,280 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:02,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1983510372, now seen corresponding path program 1 times [2024-10-12 15:11:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174808803] [2024-10-12 15:11:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:02,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:02,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:02,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174808803] [2024-10-12 15:11:02,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174808803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:02,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994685224] [2024-10-12 15:11:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:02,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:02,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:02,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,424 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:02,640 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-10-12 15:11:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-12 15:11:02,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:02,643 INFO L225 Difference]: With dead ends: 239 [2024-10-12 15:11:02,644 INFO L226 Difference]: Without dead ends: 131 [2024-10-12 15:11:02,644 INFO L431 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 [2024-10-12 15:11:02,646 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 9 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:02,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 248 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-12 15:11:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-12 15:11:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.523076923076923) internal successors, (198), 130 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 198 transitions. [2024-10-12 15:11:02,665 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 198 transitions. Word has length 33 [2024-10-12 15:11:02,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:02,666 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 198 transitions. [2024-10-12 15:11:02,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 198 transitions. [2024-10-12 15:11:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:11:02,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:02,667 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 15:11:02,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2051034107, now seen corresponding path program 1 times [2024-10-12 15:11:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:02,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318201080] [2024-10-12 15:11:02,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:02,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:02,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318201080] [2024-10-12 15:11:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318201080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:02,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:02,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140401153] [2024-10-12 15:11:02,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:02,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:02,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:02,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:02,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,790 INFO L87 Difference]: Start difference. First operand 131 states and 198 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:02,828 INFO L93 Difference]: Finished difference Result 277 states and 414 transitions. [2024-10-12 15:11:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:02,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-12 15:11:02,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:02,832 INFO L225 Difference]: With dead ends: 277 [2024-10-12 15:11:02,834 INFO L226 Difference]: Without dead ends: 155 [2024-10-12 15:11:02,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,836 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 21 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:02,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 324 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:02,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-12 15:11:02,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-12 15:11:02,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.4870129870129871) internal successors, (229), 154 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2024-10-12 15:11:02,859 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 46 [2024-10-12 15:11:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:02,860 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2024-10-12 15:11:02,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2024-10-12 15:11:02,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:11:02,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:02,862 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:02,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 15:11:02,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:02,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:02,863 INFO L85 PathProgramCache]: Analyzing trace with hash -438494855, now seen corresponding path program 1 times [2024-10-12 15:11:02,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:02,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454733969] [2024-10-12 15:11:02,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:02,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:02,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454733969] [2024-10-12 15:11:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454733969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:02,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:02,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098489326] [2024-10-12 15:11:02,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:02,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:02,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:02,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:02,974 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:03,099 INFO L93 Difference]: Finished difference Result 293 states and 442 transitions. [2024-10-12 15:11:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:03,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-12 15:11:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:03,101 INFO L225 Difference]: With dead ends: 293 [2024-10-12 15:11:03,101 INFO L226 Difference]: Without dead ends: 171 [2024-10-12 15:11:03,102 INFO L431 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 [2024-10-12 15:11:03,103 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 10 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:03,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 261 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-12 15:11:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-10-12 15:11:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4705882352941178) internal successors, (250), 170 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 250 transitions. [2024-10-12 15:11:03,115 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 250 transitions. Word has length 46 [2024-10-12 15:11:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:03,116 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 250 transitions. [2024-10-12 15:11:03,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 250 transitions. [2024-10-12 15:11:03,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 15:11:03,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:03,118 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-12 15:11:03,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 15:11:03,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:03,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1782095985, now seen corresponding path program 1 times [2024-10-12 15:11:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:03,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90949329] [2024-10-12 15:11:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:03,197 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:03,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:03,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90949329] [2024-10-12 15:11:03,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90949329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:03,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:03,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:03,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433281760] [2024-10-12 15:11:03,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:03,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:03,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:03,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:03,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:03,200 INFO L87 Difference]: Start difference. First operand 171 states and 250 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:03,226 INFO L93 Difference]: Finished difference Result 464 states and 679 transitions. [2024-10-12 15:11:03,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:03,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 64 [2024-10-12 15:11:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:03,229 INFO L225 Difference]: With dead ends: 464 [2024-10-12 15:11:03,229 INFO L226 Difference]: Without dead ends: 326 [2024-10-12 15:11:03,230 INFO L431 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 [2024-10-12 15:11:03,230 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 130 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:03,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 330 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-12 15:11:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2024-10-12 15:11:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 1.4551083591331269) internal successors, (470), 323 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 470 transitions. [2024-10-12 15:11:03,254 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 470 transitions. Word has length 64 [2024-10-12 15:11:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:03,255 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 470 transitions. [2024-10-12 15:11:03,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 470 transitions. [2024-10-12 15:11:03,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 15:11:03,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:03,257 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-12 15:11:03,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 15:11:03,258 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:03,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:03,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1762519458, now seen corresponding path program 1 times [2024-10-12 15:11:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807112574] [2024-10-12 15:11:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807112574] [2024-10-12 15:11:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807112574] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:03,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285864749] [2024-10-12 15:11:03,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:03,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:03,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:03,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:03,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 15:11:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:03,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:03,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:03,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:03,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285864749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:03,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:03,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-12 15:11:03,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653675152] [2024-10-12 15:11:03,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:03,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 15:11:03,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:03,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 15:11:03,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:11:03,807 INFO L87 Difference]: Start difference. First operand 324 states and 470 transitions. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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) [2024-10-12 15:11:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:04,351 INFO L93 Difference]: Finished difference Result 967 states and 1518 transitions. [2024-10-12 15:11:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:04,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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 64 [2024-10-12 15:11:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:04,354 INFO L225 Difference]: With dead ends: 967 [2024-10-12 15:11:04,354 INFO L226 Difference]: Without dead ends: 577 [2024-10-12 15:11:04,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:04,359 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 284 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:04,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 925 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 15:11:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2024-10-12 15:11:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 569. [2024-10-12 15:11:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4419014084507042) internal successors, (819), 568 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 819 transitions. [2024-10-12 15:11:04,386 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 819 transitions. Word has length 64 [2024-10-12 15:11:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:04,388 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 819 transitions. [2024-10-12 15:11:04,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 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) [2024-10-12 15:11:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 819 transitions. [2024-10-12 15:11:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 15:11:04,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:04,391 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-12 15:11:04,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:04,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 15:11:04,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:04,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:04,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1580272051, now seen corresponding path program 1 times [2024-10-12 15:11:04,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:04,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008294127] [2024-10-12 15:11:04,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:04,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:04,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:04,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008294127] [2024-10-12 15:11:04,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008294127] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 15:11:04,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469591950] [2024-10-12 15:11:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:04,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 15:11:04,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:04,694 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 15:11:04,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 15:11:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:04,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 15:11:04,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:04,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469591950] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:04,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 15:11:04,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-10-12 15:11:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855587673] [2024-10-12 15:11:04,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:04,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 15:11:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:04,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 15:11:04,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-12 15:11:04,997 INFO L87 Difference]: Start difference. First operand 569 states and 819 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:05,428 INFO L93 Difference]: Finished difference Result 1298 states and 1890 transitions. [2024-10-12 15:11:05,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 15:11:05,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 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 64 [2024-10-12 15:11:05,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:05,432 INFO L225 Difference]: With dead ends: 1298 [2024-10-12 15:11:05,432 INFO L226 Difference]: Without dead ends: 746 [2024-10-12 15:11:05,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-10-12 15:11:05,434 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 450 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:05,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 886 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:11:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-12 15:11:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 569. [2024-10-12 15:11:05,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4383802816901408) internal successors, (817), 568 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 817 transitions. [2024-10-12 15:11:05,450 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 817 transitions. Word has length 64 [2024-10-12 15:11:05,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:05,451 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 817 transitions. [2024-10-12 15:11:05,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 11 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,451 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 817 transitions. [2024-10-12 15:11:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-12 15:11:05,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:05,453 INFO L215 NwaCegarLoop]: trace histogram [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, 1] [2024-10-12 15:11:05,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 15:11:05,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-12 15:11:05,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1560695524, now seen corresponding path program 1 times [2024-10-12 15:11:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962573074] [2024-10-12 15:11:05,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962573074] [2024-10-12 15:11:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962573074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:05,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:05,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:05,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277662012] [2024-10-12 15:11:05,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:05,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:05,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:05,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:05,726 INFO L87 Difference]: Start difference. First operand 569 states and 817 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:05,748 INFO L93 Difference]: Finished difference Result 747 states and 1069 transitions. [2024-10-12 15:11:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 64 [2024-10-12 15:11:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:05,750 INFO L225 Difference]: With dead ends: 747 [2024-10-12 15:11:05,750 INFO L226 Difference]: Without dead ends: 400 [2024-10-12 15:11:05,751 INFO L431 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 [2024-10-12 15:11:05,751 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 124 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:05,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 467 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-10-12 15:11:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2024-10-12 15:11:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4253164556962026) internal successors, (563), 395 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 563 transitions. [2024-10-12 15:11:05,764 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 563 transitions. Word has length 64 [2024-10-12 15:11:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:05,765 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 563 transitions. [2024-10-12 15:11:05,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,766 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 563 transitions. [2024-10-12 15:11:05,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 15:11:05,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:05,767 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1] [2024-10-12 15:11:05,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 15:11:05,768 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:05,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash 719605973, now seen corresponding path program 1 times [2024-10-12 15:11:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:05,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603426855] [2024-10-12 15:11:05,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:05,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:05,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 15:11:05,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603426855] [2024-10-12 15:11:05,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603426855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:05,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:05,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546682576] [2024-10-12 15:11:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:05,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:05,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 15:11:05,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:05,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:05,831 INFO L87 Difference]: Start difference. First operand 396 states and 563 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) [2024-10-12 15:11:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:05,847 INFO L93 Difference]: Finished difference Result 571 states and 812 transitions. [2024-10-12 15:11:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:05,848 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 65 [2024-10-12 15:11:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:05,849 INFO L225 Difference]: With dead ends: 571 [2024-10-12 15:11:05,850 INFO L226 Difference]: Without dead ends: 398 [2024-10-12 15:11:05,850 INFO L431 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 [2024-10-12 15:11:05,851 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 125 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:05,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 320 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-12 15:11:05,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2024-10-12 15:11:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4227848101265823) internal successors, (562), 395 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 562 transitions. [2024-10-12 15:11:05,860 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 562 transitions. Word has length 65 [2024-10-12 15:11:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:05,860 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 562 transitions. [2024-10-12 15:11:05,860 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) [2024-10-12 15:11:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 562 transitions. [2024-10-12 15:11:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 15:11:05,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:05,861 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-10-12 15:11:05,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 15:11:05,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:05,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:05,862 INFO L85 PathProgramCache]: Analyzing trace with hash -204590847, now seen corresponding path program 1 times [2024-10-12 15:11:05,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 15:11:05,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864684574] [2024-10-12 15:11:05,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:05,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 15:11:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:05,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:11:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:05,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 15:11:05,921 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:11:05,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:11:05,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 15:11:05,928 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:06,031 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:11:06,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:11:06 BoogieIcfgContainer [2024-10-12 15:11:06,034 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:11:06,034 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:11:06,034 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:11:06,035 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:11:06,035 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:01" (3/4) ... [2024-10-12 15:11:06,038 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-12 15:11:06,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:11:06,039 INFO L158 Benchmark]: Toolchain (without parser) took 5716.59ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 146.1MB in the beginning and 108.7MB in the end (delta: 37.4MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,039 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:06,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.39ms. Allocated memory is still 184.5MB. Free memory was 156.2MB in the beginning and 139.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.46ms. Allocated memory is still 184.5MB. Free memory was 139.5MB in the beginning and 136.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,040 INFO L158 Benchmark]: Boogie Preprocessor took 83.06ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 133.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,041 INFO L158 Benchmark]: RCFGBuilder took 803.21ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 122.6MB in the end (delta: 10.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,041 INFO L158 Benchmark]: TraceAbstraction took 4379.54ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 122.4MB in the beginning and 108.7MB in the end (delta: 13.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. [2024-10-12 15:11:06,042 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 224.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:06,043 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.18ms. Allocated memory is still 184.5MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.39ms. Allocated memory is still 184.5MB. Free memory was 156.2MB in the beginning and 139.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.46ms. Allocated memory is still 184.5MB. Free memory was 139.5MB in the beginning and 136.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.06ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 133.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 803.21ms. Allocated memory is still 184.5MB. Free memory was 133.2MB in the beginning and 122.6MB in the end (delta: 10.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4379.54ms. Allocated memory was 184.5MB in the beginning and 224.4MB in the end (delta: 39.8MB). Free memory was 122.4MB in the beginning and 108.7MB in the end (delta: 13.7MB). Peak memory consumption was 56.7MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 224.4MB. Free memory is still 108.7MB. 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: 624]: 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 311. Possible FailurePath: [L633] int __retres1 ; [L637] 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 ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 VAL [blastFlag=0, cb=0, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L103] COND TRUE \read(s__hit) [L104] ag_Y = 208 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=12292, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND TRUE s__state == 12292 [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L222] s__server = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L223] COND TRUE cb != 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L253] COND FALSE !(! tmp___4) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=12292, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4368, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND TRUE s__state == 4368 VAL [ag_Y=208, blastFlag=0, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4368, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4384, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, blastFlag=1, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L310] COND TRUE \read(s__hit) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4352, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] EXPR s__state | ag_Y VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L311] s__state = s__state | ag_Y [L315] s__init_num = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L611] skip = 0 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4384, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__state=4432, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=4, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Y=208, blastFlag=2, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Y=208, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] [L624] reach_error() VAL [ag_X=4352, ag_Y=208, cb=1, num1=0, ret=-1, s__bbio=0, s__ctx__info_callback=0, s__ctx__stats__sess_connect=0, s__ctx__stats__sess_connect_renegotiate=0, s__debug=0, s__hit=1, 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=0, s__s3__tmp__new_compression=0, s__s3__tmp__new_compression__id=0, s__s3__tmp__reuse_message=1, s__version=-64512, s__wbio=1, skip=0, state=4432, tmp___3=0, tmp___4=1, tmp___5=1, tmp___6=0, tmp___7=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1160 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 4080 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2299 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1465 IncrementalHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 1781 mSDtfsCounter, 1465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=6, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 193 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 712 ConstructedInterpolants, 0 QuantifiedInterpolants, 1740 SizeOfPredicates, 2 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 211/343 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-12 15:11:06,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 15:11:08,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 15:11:08,339 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-12 15:11:08,344 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 15:11:08,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 15:11:08,369 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 15:11:08,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 15:11:08,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 15:11:08,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 15:11:08,371 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 15:11:08,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 15:11:08,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 15:11:08,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 15:11:08,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 15:11:08,377 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 15:11:08,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 15:11:08,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 15:11:08,377 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 15:11:08,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 15:11:08,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 15:11:08,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 15:11:08,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 15:11:08,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 15:11:08,379 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-12 15:11:08,379 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-12 15:11:08,379 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 15:11:08,380 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-12 15:11:08,380 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 15:11:08,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 15:11:08,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 15:11:08,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 15:11:08,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 15:11:08,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 15:11:08,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 15:11:08,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:08,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 15:11:08,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 15:11:08,382 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 15:11:08,382 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-12 15:11:08,382 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-12 15:11:08,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 15:11:08,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 15:11:08,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 15:11:08,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 15:11:08,384 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-12 15:11:08,384 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 053ed37729093871c2c498497e190e53b613cb8aee6f9e8241abee9e3eadcf24 [2024-10-12 15:11:08,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 15:11:08,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 15:11:08,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 15:11:08,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 15:11:08,700 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 15:11:08,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:11:10,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 15:11:10,386 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 15:11:10,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:11:10,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d4ea7fb/3b9e3962a4b044efbba1018d247071a0/FLAG57660d250 [2024-10-12 15:11:10,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d4ea7fb/3b9e3962a4b044efbba1018d247071a0 [2024-10-12 15:11:10,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 15:11:10,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 15:11:10,418 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:10,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 15:11:10,424 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 15:11:10,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd093fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10, skipping insertion in model container [2024-10-12 15:11:10,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 15:11:10,712 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-10-12 15:11:10,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:10,743 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 15:11:10,796 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-10-12 15:11:10,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 15:11:10,823 INFO L204 MainTranslator]: Completed translation [2024-10-12 15:11:10,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10 WrapperNode [2024-10-12 15:11:10,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 15:11:10,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:10,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 15:11:10,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 15:11:10,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,871 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-10-12 15:11:10,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 15:11:10,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 15:11:10,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 15:11:10,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 15:11:10,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,907 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]. [2024-10-12 15:11:10,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 15:11:10,949 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 15:11:10,949 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 15:11:10,949 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 15:11:10,950 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (1/1) ... [2024-10-12 15:11:10,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 15:11:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 15:11:10,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 15:11:10,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 15:11:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 15:11:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-12 15:11:11,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 15:11:11,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 15:11:11,121 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 15:11:11,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 15:11:11,140 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-12 15:11:11,589 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-10-12 15:11:11,590 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-10-12 15:11:11,639 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-12 15:11:11,639 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 15:11:11,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 15:11:11,673 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 15:11:11,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:11 BoogieIcfgContainer [2024-10-12 15:11:11,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 15:11:11,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 15:11:11,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 15:11:11,680 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 15:11:11,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 03:11:10" (1/3) ... [2024-10-12 15:11:11,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a82c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:11, skipping insertion in model container [2024-10-12 15:11:11,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 03:11:10" (2/3) ... [2024-10-12 15:11:11,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69a82c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 03:11:11, skipping insertion in model container [2024-10-12 15:11:11,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:11" (3/3) ... [2024-10-12 15:11:11,684 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-10-12 15:11:11,698 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 15:11:11,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 15:11:11,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 15:11:11,787 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;@7aae6273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 15:11:11,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 15:11:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 118 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 15:11:11,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:11,800 INFO L215 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] [2024-10-12 15:11:11,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1053989179, now seen corresponding path program 1 times [2024-10-12 15:11:11,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:11,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874923942] [2024-10-12 15:11:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:11,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:11,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:11,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-12 15:11:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:11,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:11,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:11,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:11,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874923942] [2024-10-12 15:11:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874923942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563363186] [2024-10-12 15:11:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:11,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:11,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:11,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:11,987 INFO L87 Difference]: Start difference. First operand has 119 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 118 states have internal predecessors, (208), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:12,175 INFO L93 Difference]: Finished difference Result 233 states and 409 transitions. [2024-10-12 15:11:12,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:12,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 15:11:12,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:12,187 INFO L225 Difference]: With dead ends: 233 [2024-10-12 15:11:12,188 INFO L226 Difference]: Without dead ends: 109 [2024-10-12 15:11:12,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:12,195 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 7 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:12,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 303 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 15:11:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-12 15:11:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-12 15:11:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 108 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 167 transitions. [2024-10-12 15:11:12,232 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 167 transitions. Word has length 23 [2024-10-12 15:11:12,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:12,233 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 167 transitions. [2024-10-12 15:11:12,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,233 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 167 transitions. [2024-10-12 15:11:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 15:11:12,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:12,235 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:12,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-12 15:11:12,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:12,438 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:12,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:12,439 INFO L85 PathProgramCache]: Analyzing trace with hash 433548802, now seen corresponding path program 1 times [2024-10-12 15:11:12,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306421725] [2024-10-12 15:11:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:12,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:12,442 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:12,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-12 15:11:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:12,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:12,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 15:11:12,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:12,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:12,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306421725] [2024-10-12 15:11:12,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306421725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:12,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:12,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:12,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398378951] [2024-10-12 15:11:12,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:12,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:12,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:12,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:12,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:12,546 INFO L87 Difference]: Start difference. First operand 109 states and 167 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:12,698 INFO L93 Difference]: Finished difference Result 223 states and 345 transitions. [2024-10-12 15:11:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-12 15:11:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:12,700 INFO L225 Difference]: With dead ends: 223 [2024-10-12 15:11:12,701 INFO L226 Difference]: Without dead ends: 123 [2024-10-12 15:11:12,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:12,704 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:12,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 232 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-12 15:11:12,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-12 15:11:12,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.5245901639344261) internal successors, (186), 122 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 186 transitions. [2024-10-12 15:11:12,724 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 186 transitions. Word has length 33 [2024-10-12 15:11:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:12,724 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 186 transitions. [2024-10-12 15:11:12,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 186 transitions. [2024-10-12 15:11:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:11:12,727 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:12,727 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:12,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-12 15:11:12,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:12,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1707743867, now seen corresponding path program 1 times [2024-10-12 15:11:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091647835] [2024-10-12 15:11:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:12,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:12,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:12,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:12,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-12 15:11:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:12,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:12,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:13,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:13,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091647835] [2024-10-12 15:11:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091647835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 15:11:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059796608] [2024-10-12 15:11:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:13,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:13,045 INFO L87 Difference]: Start difference. First operand 123 states and 186 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:13,072 INFO L93 Difference]: Finished difference Result 261 states and 390 transitions. [2024-10-12 15:11:13,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:13,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-12 15:11:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:13,074 INFO L225 Difference]: With dead ends: 261 [2024-10-12 15:11:13,074 INFO L226 Difference]: Without dead ends: 147 [2024-10-12 15:11:13,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:13,076 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 21 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:13,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 300 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-12 15:11:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-12 15:11:13,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2024-10-12 15:11:13,088 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 46 [2024-10-12 15:11:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:13,089 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2024-10-12 15:11:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2024-10-12 15:11:13,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 15:11:13,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:13,091 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:13,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-12 15:11:13,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:13,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:13,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:13,295 INFO L85 PathProgramCache]: Analyzing trace with hash -781785095, now seen corresponding path program 1 times [2024-10-12 15:11:13,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:13,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037175133] [2024-10-12 15:11:13,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:13,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:13,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:13,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:13,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-12 15:11:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:13,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:13,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:13,382 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:13,382 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:13,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:13,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037175133] [2024-10-12 15:11:13,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037175133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210952194] [2024-10-12 15:11:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:13,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:13,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:13,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:13,384 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:13,522 INFO L93 Difference]: Finished difference Result 277 states and 418 transitions. [2024-10-12 15:11:13,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 [2024-10-12 15:11:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:13,524 INFO L225 Difference]: With dead ends: 277 [2024-10-12 15:11:13,524 INFO L226 Difference]: Without dead ends: 163 [2024-10-12 15:11:13,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:13,525 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:13,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 245 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-12 15:11:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-12 15:11:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4691358024691359) internal successors, (238), 162 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 238 transitions. [2024-10-12 15:11:13,540 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 238 transitions. Word has length 46 [2024-10-12 15:11:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:13,541 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 238 transitions. [2024-10-12 15:11:13,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 238 transitions. [2024-10-12 15:11:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:11:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:13,543 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:13,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-12 15:11:13,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:13,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:13,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -845701464, now seen corresponding path program 1 times [2024-10-12 15:11:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218020863] [2024-10-12 15:11:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:13,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:13,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:13,747 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-12 15:11:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:13,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 15:11:13,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:14,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:14,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:14,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218020863] [2024-10-12 15:11:14,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218020863] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:14,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:14,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-12 15:11:14,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719398274] [2024-10-12 15:11:14,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:14,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 15:11:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:14,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 15:11:14,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-12 15:11:14,264 INFO L87 Difference]: Start difference. First operand 163 states and 238 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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) [2024-10-12 15:11:14,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:14,746 INFO L93 Difference]: Finished difference Result 534 states and 816 transitions. [2024-10-12 15:11:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 15:11:14,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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 62 [2024-10-12 15:11:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:14,750 INFO L225 Difference]: With dead ends: 534 [2024-10-12 15:11:14,750 INFO L226 Difference]: Without dead ends: 403 [2024-10-12 15:11:14,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-12 15:11:14,761 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 280 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:14,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 478 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:11:14,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-12 15:11:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2024-10-12 15:11:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 1.4725) internal successors, (589), 400 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 589 transitions. [2024-10-12 15:11:14,790 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 589 transitions. Word has length 62 [2024-10-12 15:11:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:14,791 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 589 transitions. [2024-10-12 15:11:14,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 6 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) [2024-10-12 15:11:14,791 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 589 transitions. [2024-10-12 15:11:14,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:11:14,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:14,797 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:14,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-12 15:11:14,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:14,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:14,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:14,999 INFO L85 PathProgramCache]: Analyzing trace with hash -626846746, now seen corresponding path program 1 times [2024-10-12 15:11:14,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:14,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120429308] [2024-10-12 15:11:14,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:15,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:15,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:15,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-12 15:11:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:15,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:15,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:15,143 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:15,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:15,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:15,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120429308] [2024-10-12 15:11:15,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120429308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:15,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:15,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:15,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490339755] [2024-10-12 15:11:15,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:15,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:15,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:15,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:15,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:15,149 INFO L87 Difference]: Start difference. First operand 401 states and 589 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:15,183 INFO L93 Difference]: Finished difference Result 893 states and 1330 transitions. [2024-10-12 15:11:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 62 [2024-10-12 15:11:15,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:15,186 INFO L225 Difference]: With dead ends: 893 [2024-10-12 15:11:15,187 INFO L226 Difference]: Without dead ends: 551 [2024-10-12 15:11:15,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:15,190 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 124 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:15,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 312 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-12 15:11:15,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2024-10-12 15:11:15,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.4817518248175183) internal successors, (812), 548 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 812 transitions. [2024-10-12 15:11:15,212 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 812 transitions. Word has length 62 [2024-10-12 15:11:15,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:15,213 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 812 transitions. [2024-10-12 15:11:15,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 812 transitions. [2024-10-12 15:11:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:11:15,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:15,215 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:15,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-12 15:11:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:15,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:15,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:15,417 INFO L85 PathProgramCache]: Analyzing trace with hash -411972378, now seen corresponding path program 1 times [2024-10-12 15:11:15,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:15,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434048731] [2024-10-12 15:11:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:15,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:15,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:15,419 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:15,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-12 15:11:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:15,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:15,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:15,563 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 15:11:15,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:15,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:15,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434048731] [2024-10-12 15:11:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434048731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:15,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:15,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:15,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932834275] [2024-10-12 15:11:15,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:15,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:15,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:15,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:15,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:15,570 INFO L87 Difference]: Start difference. First operand 549 states and 812 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:15,602 INFO L93 Difference]: Finished difference Result 553 states and 814 transitions. [2024-10-12 15:11:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 62 [2024-10-12 15:11:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:15,605 INFO L225 Difference]: With dead ends: 553 [2024-10-12 15:11:15,605 INFO L226 Difference]: Without dead ends: 401 [2024-10-12 15:11:15,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:15,607 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 122 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:15,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-12 15:11:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2024-10-12 15:11:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 398 states have (on average 1.4572864321608041) internal successors, (580), 398 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 580 transitions. [2024-10-12 15:11:15,622 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 580 transitions. Word has length 62 [2024-10-12 15:11:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:15,623 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 580 transitions. [2024-10-12 15:11:15,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 580 transitions. [2024-10-12 15:11:15,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-12 15:11:15,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:15,625 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:15,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-12 15:11:15,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:15,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:15,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash -193117660, now seen corresponding path program 1 times [2024-10-12 15:11:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:15,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588876068] [2024-10-12 15:11:15,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:15,829 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:15,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-12 15:11:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:15,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 15:11:15,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:16,056 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 15:11:16,182 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 15:11:16,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:16,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588876068] [2024-10-12 15:11:16,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588876068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 15:11:16,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 15:11:16,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-12 15:11:16,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834169917] [2024-10-12 15:11:16,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 15:11:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 15:11:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:16,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 15:11:16,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-12 15:11:16,184 INFO L87 Difference]: Start difference. First operand 399 states and 580 transitions. Second operand has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:16,661 INFO L93 Difference]: Finished difference Result 611 states and 918 transitions. [2024-10-12 15:11:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 15:11:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 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 62 [2024-10-12 15:11:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:16,665 INFO L225 Difference]: With dead ends: 611 [2024-10-12 15:11:16,665 INFO L226 Difference]: Without dead ends: 460 [2024-10-12 15:11:16,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-12 15:11:16,666 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 385 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:16,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1066 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 15:11:16,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-12 15:11:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2024-10-12 15:11:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.421978021978022) internal successors, (647), 455 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 647 transitions. [2024-10-12 15:11:16,678 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 647 transitions. Word has length 62 [2024-10-12 15:11:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 647 transitions. [2024-10-12 15:11:16,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.777777777777779) internal successors, (97), 9 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 647 transitions. [2024-10-12 15:11:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 15:11:16,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:16,680 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:16,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-12 15:11:16,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:16,883 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:16,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1735736275, now seen corresponding path program 1 times [2024-10-12 15:11:16,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:16,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003257199] [2024-10-12 15:11:16,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:16,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:16,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:16,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:16,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-12 15:11:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:16,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:16,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-12 15:11:16,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:16,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:16,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003257199] [2024-10-12 15:11:16,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003257199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:16,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:16,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809387146] [2024-10-12 15:11:16,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:16,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:16,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:16,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:16,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:16,982 INFO L87 Difference]: Start difference. First operand 456 states and 647 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:17,113 INFO L93 Difference]: Finished difference Result 893 states and 1290 transitions. [2024-10-12 15:11:17,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:17,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 78 [2024-10-12 15:11:17,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:17,116 INFO L225 Difference]: With dead ends: 893 [2024-10-12 15:11:17,116 INFO L226 Difference]: Without dead ends: 496 [2024-10-12 15:11:17,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:17,118 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 9 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:17,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 249 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 15:11:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-12 15:11:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-10-12 15:11:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.408080808080808) internal successors, (697), 495 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 697 transitions. [2024-10-12 15:11:17,131 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 697 transitions. Word has length 78 [2024-10-12 15:11:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:17,131 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 697 transitions. [2024-10-12 15:11:17,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 697 transitions. [2024-10-12 15:11:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 15:11:17,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:17,133 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:17,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-12 15:11:17,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:17,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:17,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:17,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1606695298, now seen corresponding path program 1 times [2024-10-12 15:11:17,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:17,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791010563] [2024-10-12 15:11:17,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:17,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:17,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:17,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-12 15:11:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 15:11:17,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 15:11:17,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 15:11:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 15:11:17,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 15:11:17,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-12 15:11:17,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791010563] [2024-10-12 15:11:17,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791010563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 15:11:17,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 15:11:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 15:11:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609580248] [2024-10-12 15:11:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 15:11:17,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 15:11:17,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-12 15:11:17,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 15:11:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:17,454 INFO L87 Difference]: Start difference. First operand 496 states and 697 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 15:11:17,497 INFO L93 Difference]: Finished difference Result 1364 states and 1930 transitions. [2024-10-12 15:11:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 15:11:17,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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 96 [2024-10-12 15:11:17,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 15:11:17,501 INFO L225 Difference]: With dead ends: 1364 [2024-10-12 15:11:17,501 INFO L226 Difference]: Without dead ends: 927 [2024-10-12 15:11:17,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 15:11:17,502 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 120 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 15:11:17,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 344 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 15:11:17,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-10-12 15:11:17,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 925. [2024-10-12 15:11:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 924 states have (on average 1.4036796536796536) internal successors, (1297), 924 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1297 transitions. [2024-10-12 15:11:17,523 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1297 transitions. Word has length 96 [2024-10-12 15:11:17,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 15:11:17,524 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1297 transitions. [2024-10-12 15:11:17,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 15:11:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1297 transitions. [2024-10-12 15:11:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-12 15:11:17,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 15:11:17,525 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 15:11:17,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-12 15:11:17,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:17,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 15:11:17,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 15:11:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -198743036, now seen corresponding path program 1 times [2024-10-12 15:11:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-12 15:11:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678631528] [2024-10-12 15:11:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 15:11:17,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-12 15:11:17,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-12 15:11:17,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-12 15:11:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:17,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 15:11:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 15:11:17,925 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-12 15:11:17,925 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-12 15:11:17,926 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 15:11:17,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-12 15:11:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-12 15:11:18,134 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 15:11:18,237 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-12 15:11:18,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 03:11:18 BoogieIcfgContainer [2024-10-12 15:11:18,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-12 15:11:18,240 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 15:11:18,240 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 15:11:18,240 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 15:11:18,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 03:11:11" (3/4) ... [2024-10-12 15:11:18,241 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-12 15:11:18,332 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 15:11:18,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 15:11:18,333 INFO L158 Benchmark]: Toolchain (without parser) took 7916.78ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 49.2MB in the beginning and 68.8MB in the end (delta: -19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,333 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 15:11:18,333 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.93ms. Allocated memory is still 75.5MB. Free memory was 49.0MB in the beginning and 54.3MB in the end (delta: -5.3MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.12ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 51.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,334 INFO L158 Benchmark]: Boogie Preprocessor took 68.09ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 48.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,334 INFO L158 Benchmark]: RCFGBuilder took 725.65ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 31.1MB in the end (delta: 17.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,335 INFO L158 Benchmark]: TraceAbstraction took 6562.64ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 30.7MB in the beginning and 80.4MB in the end (delta: -49.7MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,335 INFO L158 Benchmark]: Witness Printer took 92.36ms. Allocated memory is still 119.5MB. Free memory was 80.4MB in the beginning and 68.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-12 15:11:18,337 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.16ms. Allocated memory is still 52.4MB. Free memory is still 24.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.93ms. Allocated memory is still 75.5MB. Free memory was 49.0MB in the beginning and 54.3MB in the end (delta: -5.3MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.12ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 51.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.09ms. Allocated memory is still 75.5MB. Free memory was 51.7MB in the beginning and 48.5MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 725.65ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 31.1MB in the end (delta: 17.4MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6562.64ms. Allocated memory was 75.5MB in the beginning and 119.5MB in the end (delta: 44.0MB). Free memory was 30.7MB in the beginning and 80.4MB in the end (delta: -49.7MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * Witness Printer took 92.36ms. Allocated memory is still 119.5MB. Free memory was 80.4MB in the beginning and 68.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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 - CounterExampleResult [Line: 624]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L633] int __retres1 ; [L637] 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 ag_Z ; [L74] int __retres60 ; [L77] s__state = 12292 [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 VAL [blastFlag=0, cb=0, ret=-1, s__state=12292, skip=0] [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback VAL [blastFlag=0, cb=2, ret=-1, s__state=12292, skip=0] [L93] s__in_handshake = s__in_handshake + 1 VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L94] COND FALSE !(tmp___1 + 12288) VAL [blastFlag=0, cb=2, ret=-1, s__in_handshake=0, s__state=12292, skip=0] [L103] COND FALSE !(\read(s__hit)) [L106] ag_Z = 48 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0, state=12292] [L112] COND TRUE s__state == 12292 [L215] s__new_session = 1 [L216] s__state = 4096 [L217] s__ctx__stats__sess_connect_renegotiate = s__ctx__stats__sess_connect_renegotiate + 1 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L222] s__server = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L223] COND TRUE cb != 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, skip=0, state=12292] [L228] COND FALSE !(s__version + 65280 != 768) [L234] s__type = 4096 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__version=-64512, skip=0, state=12292] [L235] COND FALSE !((unsigned long )s__init_buf___0 == (unsigned long )((void *)0)) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292] [L253] COND FALSE !(! tmp___4) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__version=-64512, skip=0, state=12292, tmp___4=2] [L259] COND FALSE !(! tmp___5) [L265] s__state = 4368 [L266] s__ctx__stats__sess_connect = s__ctx__stats__sess_connect + 1 [L267] s__init_num = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=12292, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4368, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L127] COND TRUE s__state == 4368 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 VAL [ag_Z=48, blastFlag=1, cb=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L278] COND FALSE !(ret <= 0) [L283] s__state = 4384 [L284] ag_X = s__state - 32 [L285] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, skip=0, state=4368, tmp___4=2, tmp___5=2] [L286] COND TRUE (unsigned long )s__bbio != (unsigned long )s__wbio VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4368, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4384, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L133] COND TRUE s__state == 4384 VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=2, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L294] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=1, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L295] COND TRUE blastFlag == 1 [L296] blastFlag = 2 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L304] COND FALSE !(ret <= 0) [L309] s__state = ag_X VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4352, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L310] COND FALSE !(\read(s__hit)) [L313] s__state = s__state | ag_Z VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L315] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4384, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__state=4400, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L139] COND TRUE s__state == 4400 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L319] COND TRUE (unsigned long )s__s3__tmp__new_cipher__algorithms + 256UL [L320] skip = 1 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L334] s__state = 4416 [L335] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=1, state=4400, tmp___4=2, tmp___5=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4400, tmp___4=2, tmp___5=2] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4416, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L145] COND TRUE s__state == 4416 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L339] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L340] COND FALSE !(blastFlag == 3) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L345] COND FALSE !(ret <= 0) [L350] s__state = 4432 [L351] s__init_num = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2] [L352] COND FALSE !(! tmp___6) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L582] COND FALSE !(! s__s3__tmp__reuse_message) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L611] skip = 0 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4416, tmp___4=2, tmp___5=2, tmp___6=2] [L109] COND TRUE 1 [L111] state = s__state VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L112] COND FALSE !(s__state == 12292) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L115] COND FALSE !(s__state == 16384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L118] COND FALSE !(s__state == 4096) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L121] COND FALSE !(s__state == 20480) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L124] COND FALSE !(s__state == 4099) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L127] COND FALSE !(s__state == 4368) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L130] COND FALSE !(s__state == 4369) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L133] COND FALSE !(s__state == 4384) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L136] COND FALSE !(s__state == 4385) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L139] COND FALSE !(s__state == 4400) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L142] COND FALSE !(s__state == 4401) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L145] COND FALSE !(s__state == 4416) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L148] COND FALSE !(s__state == 4417) VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__state=4432, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L151] COND TRUE s__state == 4432 VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=1073741824, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L361] ret = __VERIFIER_nondet_int() VAL [ag_X=4352, ag_Z=48, blastFlag=2, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L362] COND TRUE blastFlag <= 5 VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] [L624] reach_error() VAL [ag_X=4352, ag_Z=48, cb=2, ret=7, s__bbio=6, s__ctx__stats__sess_connect=1, s__ctx__stats__sess_connect_renegotiate=1, s__hit=0, s__in_handshake=0, s__init_buf___0=2, s__s3__tmp__new_cipher__algorithms=0, s__s3__tmp__reuse_message=2, s__version=-64512, s__wbio=4, skip=0, state=4432, tmp___4=2, tmp___5=2, tmp___6=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1087 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 3913 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2095 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1299 IncrementalHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 1818 mSDtfsCounter, 1299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 663 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=925occurred in iteration=10, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 682 ConstructedInterpolants, 54 QuantifiedInterpolants, 1830 SizeOfPredicates, 5 NumberOfNonLiveVariables, 851 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 329/428 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-12 15:11:18,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE