/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-2a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 09:00:43,911 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 09:00:43,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 09:00:43,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 09:00:43,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 09:00:44,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 09:00:44,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 09:00:44,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 09:00:44,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 09:00:44,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 09:00:44,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 09:00:44,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 09:00:44,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 09:00:44,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 09:00:44,008 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 09:00:44,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 09:00:44,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 09:00:44,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 09:00:44,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 09:00:44,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 09:00:44,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 09:00:44,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 09:00:44,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 09:00:44,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 09:00:44,013 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 09:00:44,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 09:00:44,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 09:00:44,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 09:00:44,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:44,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 09:00:44,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 09:00:44,015 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 09:00:44,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 09:00:44,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 09:00:44,016 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> 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-11-03 09:00:44,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 09:00:44,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 09:00:44,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 09:00:44,232 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 09:00:44,232 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 09:00:44,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-03 09:00:45,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 09:00:45,642 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 09:00:45,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-2a.c [2024-11-03 09:00:45,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8894feb99/0c07b78fd5cd4534bd79da371b6f78d2/FLAG1daf2be96 [2024-11-03 09:00:45,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8894feb99/0c07b78fd5cd4534bd79da371b6f78d2 [2024-11-03 09:00:45,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 09:00:45,671 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 09:00:45,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:45,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 09:00:45,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 09:00:45,677 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:45,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af90096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45, skipping insertion in model container [2024-11-03 09:00:45,678 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:45,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 09:00:45,895 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-03 09:00:45,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:45,918 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 09:00:45,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/s3_clnt_3.BV.c.cil-2a.c[37884,37897] [2024-11-03 09:00:45,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 09:00:45,987 INFO L204 MainTranslator]: Completed translation [2024-11-03 09:00:45,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45 WrapperNode [2024-11-03 09:00:45,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 09:00:45,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:45,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 09:00:45,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 09:00:45,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,030 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 474 [2024-11-03 09:00:46,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 09:00:46,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 09:00:46,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 09:00:46,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 09:00:46,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,046 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,063 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-11-03 09:00:46,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 09:00:46,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 09:00:46,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 09:00:46,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 09:00:46,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (1/1) ... [2024-11-03 09:00:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 09:00:46,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 09:00:46,124 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-11-03 09:00:46,126 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-11-03 09:00:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 09:00:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 09:00:46,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 09:00:46,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 09:00:46,225 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 09:00:46,226 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 09:00:46,241 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-03 09:00:46,643 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2024-11-03 09:00:46,643 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2024-11-03 09:00:46,695 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-03 09:00:46,696 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 09:00:46,714 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 09:00:46,714 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 09:00:46,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:46 BoogieIcfgContainer [2024-11-03 09:00:46,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 09:00:46,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 09:00:46,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 09:00:46,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 09:00:46,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 09:00:45" (1/3) ... [2024-11-03 09:00:46,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb0c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:46, skipping insertion in model container [2024-11-03 09:00:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 09:00:45" (2/3) ... [2024-11-03 09:00:46,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37fb0c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 09:00:46, skipping insertion in model container [2024-11-03 09:00:46,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 09:00:46" (3/3) ... [2024-11-03 09:00:46,724 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.BV.c.cil-2a.c [2024-11-03 09:00:46,736 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 09:00:46,737 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 09:00:46,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 09:00:46,793 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;@2f303eb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 09:00:46,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 09:00:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 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-11-03 09:00:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-03 09:00:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:46,804 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, 1, 1] [2024-11-03 09:00:46,804 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:46,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:46,809 INFO L85 PathProgramCache]: Analyzing trace with hash 259999105, now seen corresponding path program 1 times [2024-11-03 09:00:46,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:46,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1088120911] [2024-11-03 09:00:46,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:46,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-11-03 09:00:46,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:46,825 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-11-03 09:00:46,847 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-11-03 09:00:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:46,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:46,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:47,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:47,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:47,029 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1088120911] [2024-11-03 09:00:47,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1088120911] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:47,030 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:47,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:47,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671728026] [2024-11-03 09:00:47,033 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:47,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:47,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:47,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:47,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:47,056 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 125 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-11-03 09:00:47,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:47,225 INFO L93 Difference]: Finished difference Result 247 states and 423 transitions. [2024-11-03 09:00:47,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:47,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2024-11-03 09:00:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:47,236 INFO L225 Difference]: With dead ends: 247 [2024-11-03 09:00:47,236 INFO L226 Difference]: Without dead ends: 113 [2024-11-03 09:00:47,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-11-03 09:00:47,243 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:47,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 320 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:47,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-03 09:00:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-03 09:00:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.5267857142857142) internal successors, (171), 112 states have internal predecessors, (171), 0 states have call successors, (0), 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-11-03 09:00:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-11-03 09:00:47,282 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 25 [2024-11-03 09:00:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:47,282 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-11-03 09:00:47,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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-11-03 09:00:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-11-03 09:00:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-03 09:00:47,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:47,284 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:47,289 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-11-03 09:00:47,488 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-11-03 09:00:47,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:47,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:47,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1138040513, now seen corresponding path program 1 times [2024-11-03 09:00:47,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:47,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1515856412] [2024-11-03 09:00:47,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:47,491 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-11-03 09:00:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:47,493 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-11-03 09:00:47,494 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-11-03 09:00:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:47,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:47,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:47,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 09:00:47,603 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:47,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1515856412] [2024-11-03 09:00:47,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1515856412] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:47,604 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564465933] [2024-11-03 09:00:47,604 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:47,608 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11-03 09:00:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:47,740 INFO L93 Difference]: Finished difference Result 230 states and 352 transitions. [2024-11-03 09:00:47,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:47,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-03 09:00:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:47,742 INFO L225 Difference]: With dead ends: 230 [2024-11-03 09:00:47,742 INFO L226 Difference]: Without dead ends: 128 [2024-11-03 09:00:47,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 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-11-03 09:00:47,743 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:47,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 242 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-03 09:00:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-03 09:00:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.5039370078740157) internal successors, (191), 127 states have internal predecessors, (191), 0 states have call successors, (0), 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-11-03 09:00:47,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2024-11-03 09:00:47,755 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 37 [2024-11-03 09:00:47,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:47,755 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2024-11-03 09:00:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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-11-03 09:00:47,755 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2024-11-03 09:00:47,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 09:00:47,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:47,756 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:47,760 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:47,959 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-11-03 09:00:47,960 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:47,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:47,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1126420040, now seen corresponding path program 1 times [2024-11-03 09:00:47,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:47,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2127192186] [2024-11-03 09:00:47,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:47,961 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-11-03 09:00:47,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:47,962 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-11-03 09:00:47,963 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-11-03 09:00:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:48,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:48,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:48,068 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:48,106 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:48,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2127192186] [2024-11-03 09:00:48,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2127192186] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:48,106 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:48,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161297966] [2024-11-03 09:00:48,106 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:48,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:48,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:48,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:48,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:48,108 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-03 09:00:48,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:48,126 INFO L93 Difference]: Finished difference Result 271 states and 400 transitions. [2024-11-03 09:00:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:48,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-03 09:00:48,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:48,128 INFO L225 Difference]: With dead ends: 271 [2024-11-03 09:00:48,128 INFO L226 Difference]: Without dead ends: 154 [2024-11-03 09:00:48,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-11-03 09:00:48,129 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 21 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:48,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:48,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-03 09:00:48,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-03 09:00:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 0 states have call successors, (0), 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-11-03 09:00:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-03 09:00:48,144 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 51 [2024-11-03 09:00:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:48,144 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-03 09:00:48,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-03 09:00:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-03 09:00:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-03 09:00:48,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:48,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:48,149 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:48,346 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-11-03 09:00:48,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:48,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:48,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1260433546, now seen corresponding path program 1 times [2024-11-03 09:00:48,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:48,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376063643] [2024-11-03 09:00:48,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:48,348 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-11-03 09:00:48,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:48,351 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-11-03 09:00:48,351 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-11-03 09:00:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:48,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:48,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:48,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:48,434 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376063643] [2024-11-03 09:00:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [376063643] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:48,435 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:48,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:48,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738672387] [2024-11-03 09:00:48,435 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:48,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:48,436 INFO L87 Difference]: Start difference. First operand 154 states and 224 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-03 09:00:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:48,531 INFO L93 Difference]: Finished difference Result 288 states and 429 transitions. [2024-11-03 09:00:48,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:48,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 51 [2024-11-03 09:00:48,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:48,532 INFO L225 Difference]: With dead ends: 288 [2024-11-03 09:00:48,533 INFO L226 Difference]: Without dead ends: 171 [2024-11-03 09:00:48,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-11-03 09:00:48,534 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:48,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 255 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:48,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-03 09:00:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2024-11-03 09:00:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.4470588235294117) internal successors, (246), 170 states have internal predecessors, (246), 0 states have call successors, (0), 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-11-03 09:00:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 246 transitions. [2024-11-03 09:00:48,541 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 246 transitions. Word has length 51 [2024-11-03 09:00:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:48,541 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 246 transitions. [2024-11-03 09:00:48,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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-11-03 09:00:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 246 transitions. [2024-11-03 09:00:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:48,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:48,543 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:48,547 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:48,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-11-03 09:00:48,744 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:48,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash -457628469, now seen corresponding path program 1 times [2024-11-03 09:00:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:48,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1571096136] [2024-11-03 09:00:48,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:48,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-11-03 09:00:48,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:48,746 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-11-03 09:00:48,748 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-11-03 09:00:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:48,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-03 09:00:48,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:48,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:49,164 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1571096136] [2024-11-03 09:00:49,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1571096136] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:49,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:49,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-03 09:00:49,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994491527] [2024-11-03 09:00:49,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 09:00:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:49,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 09:00:49,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-03 09:00:49,166 INFO L87 Difference]: Start difference. First operand 171 states and 246 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-03 09:00:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:49,564 INFO L93 Difference]: Finished difference Result 556 states and 838 transitions. [2024-11-03 09:00:49,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 09:00:49,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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 68 [2024-11-03 09:00:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:49,566 INFO L225 Difference]: With dead ends: 556 [2024-11-03 09:00:49,566 INFO L226 Difference]: Without dead ends: 421 [2024-11-03 09:00:49,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 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-11-03 09:00:49,568 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 280 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:49,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 495 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-03 09:00:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-03 09:00:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 419. [2024-11-03 09:00:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 1.4521531100478469) internal successors, (607), 418 states have internal predecessors, (607), 0 states have call successors, (0), 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-11-03 09:00:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 607 transitions. [2024-11-03 09:00:49,585 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 607 transitions. Word has length 68 [2024-11-03 09:00:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:49,586 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 607 transitions. [2024-11-03 09:00:49,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-03 09:00:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 607 transitions. [2024-11-03 09:00:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:49,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:49,590 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:49,594 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-11-03 09:00:49,790 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-11-03 09:00:49,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 2031900493, now seen corresponding path program 1 times [2024-11-03 09:00:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [685938972] [2024-11-03 09:00:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:49,791 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-11-03 09:00:49,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:49,793 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-11-03 09:00:49,794 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-11-03 09:00:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:49,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:49,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:49,931 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:49,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:49,997 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [685938972] [2024-11-03 09:00:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [685938972] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:49,997 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:49,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414189091] [2024-11-03 09:00:49,997 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:49,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:49,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:49,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:49,999 INFO L87 Difference]: Start difference. First operand 419 states and 607 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-03 09:00:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:50,029 INFO L93 Difference]: Finished difference Result 927 states and 1364 transitions. [2024-11-03 09:00:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:50,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2024-11-03 09:00:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:50,032 INFO L225 Difference]: With dead ends: 927 [2024-11-03 09:00:50,032 INFO L226 Difference]: Without dead ends: 574 [2024-11-03 09:00:50,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-11-03 09:00:50,035 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 124 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:50,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 323 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-03 09:00:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 572. [2024-11-03 09:00:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 1.4623467600700526) internal successors, (835), 571 states have internal predecessors, (835), 0 states have call successors, (0), 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-11-03 09:00:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 835 transitions. [2024-11-03 09:00:50,065 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 835 transitions. Word has length 68 [2024-11-03 09:00:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:50,065 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 835 transitions. [2024-11-03 09:00:50,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-03 09:00:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 835 transitions. [2024-11-03 09:00:50,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:50,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:50,067 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:50,073 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-11-03 09:00:50,267 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-11-03 09:00:50,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:50,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:50,268 INFO L85 PathProgramCache]: Analyzing trace with hash -875025075, now seen corresponding path program 1 times [2024-11-03 09:00:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [667105388] [2024-11-03 09:00:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:50,269 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-11-03 09:00:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:50,270 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-11-03 09:00:50,271 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-11-03 09:00:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:50,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:50,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:50,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-03 09:00:50,409 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [667105388] [2024-11-03 09:00:50,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [667105388] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:50,410 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:50,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:50,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203791157] [2024-11-03 09:00:50,410 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:50,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:50,411 INFO L87 Difference]: Start difference. First operand 572 states and 835 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-03 09:00:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:50,438 INFO L93 Difference]: Finished difference Result 576 states and 837 transitions. [2024-11-03 09:00:50,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:50,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 68 [2024-11-03 09:00:50,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:50,440 INFO L225 Difference]: With dead ends: 576 [2024-11-03 09:00:50,440 INFO L226 Difference]: Without dead ends: 419 [2024-11-03 09:00:50,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-11-03 09:00:50,441 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 122 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:50,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 399 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-03 09:00:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2024-11-03 09:00:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.4375) internal successors, (598), 416 states have internal predecessors, (598), 0 states have call successors, (0), 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-11-03 09:00:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 598 transitions. [2024-11-03 09:00:50,453 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 598 transitions. Word has length 68 [2024-11-03 09:00:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:50,455 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 598 transitions. [2024-11-03 09:00:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-03 09:00:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 598 transitions. [2024-11-03 09:00:50,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-03 09:00:50,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:50,456 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:50,463 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-03 09:00:50,657 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-11-03 09:00:50,657 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:50,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1614503887, now seen corresponding path program 1 times [2024-11-03 09:00:50,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:50,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1288121569] [2024-11-03 09:00:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:50,658 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-11-03 09:00:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:50,659 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-11-03 09:00:50,661 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-11-03 09:00:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:50,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-03 09:00:50,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:50,863 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-03 09:00:50,959 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:50,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1288121569] [2024-11-03 09:00:50,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1288121569] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 09:00:50,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 09:00:50,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-03 09:00:50,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382910570] [2024-11-03 09:00:50,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 09:00:50,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 09:00:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:50,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 09:00:50,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-03 09:00:50,961 INFO L87 Difference]: Start difference. First operand 417 states and 598 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-03 09:00:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,350 INFO L93 Difference]: Finished difference Result 636 states and 943 transitions. [2024-11-03 09:00:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 09:00:51,351 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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 68 [2024-11-03 09:00:51,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,353 INFO L225 Difference]: With dead ends: 636 [2024-11-03 09:00:51,353 INFO L226 Difference]: Without dead ends: 480 [2024-11-03 09:00:51,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 127 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-11-03 09:00:51,354 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 506 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1211 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-03 09:00:51,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-03 09:00:51,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 476. [2024-11-03 09:00:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 1.4042105263157896) internal successors, (667), 475 states have internal predecessors, (667), 0 states have call successors, (0), 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-11-03 09:00:51,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 667 transitions. [2024-11-03 09:00:51,367 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 667 transitions. Word has length 68 [2024-11-03 09:00:51,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,367 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 667 transitions. [2024-11-03 09:00:51,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-03 09:00:51,368 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 667 transitions. [2024-11-03 09:00:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-03 09:00:51,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,368 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:51,372 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-11-03 09:00:51,569 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-11-03 09:00:51,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:51,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1844660206, now seen corresponding path program 1 times [2024-11-03 09:00:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306199535] [2024-11-03 09:00:51,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:51,570 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-11-03 09:00:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:51,572 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-11-03 09:00:51,573 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-11-03 09:00:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:51,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:51,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:51,636 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-03 09:00:51,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-03 09:00:51,654 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:51,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306199535] [2024-11-03 09:00:51,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [306199535] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:51,654 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:51,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2024-11-03 09:00:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762545833] [2024-11-03 09:00:51,654 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-03 09:00:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-03 09:00:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-03 09:00:51,655 INFO L87 Difference]: Start difference. First operand 476 states and 667 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:51,750 INFO L93 Difference]: Finished difference Result 928 states and 1325 transitions. [2024-11-03 09:00:51,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-03 09:00:51,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-11-03 09:00:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:51,752 INFO L225 Difference]: With dead ends: 928 [2024-11-03 09:00:51,752 INFO L226 Difference]: Without dead ends: 518 [2024-11-03 09:00:51,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 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-11-03 09:00:51,753 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 9 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:51,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 259 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 09:00:51,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-03 09:00:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 518. [2024-11-03 09:00:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 517 states have (on average 1.390715667311412) internal successors, (719), 517 states have internal predecessors, (719), 0 states have call successors, (0), 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-11-03 09:00:51,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 719 transitions. [2024-11-03 09:00:51,763 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 719 transitions. Word has length 85 [2024-11-03 09:00:51,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 719 transitions. [2024-11-03 09:00:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 09:00:51,763 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 719 transitions. [2024-11-03 09:00:51,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-03 09:00:51,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:51,764 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:51,767 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-11-03 09:00:51,964 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-11-03 09:00:51,965 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:51,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:51,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2022672797, now seen corresponding path program 1 times [2024-11-03 09:00:51,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:51,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [116271695] [2024-11-03 09:00:51,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:51,965 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-11-03 09:00:51,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:51,968 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-11-03 09:00:51,969 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-11-03 09:00:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 09:00:52,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-03 09:00:52,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 09:00:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-03 09:00:52,075 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 09:00:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-03 09:00:52,117 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 09:00:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [116271695] [2024-11-03 09:00:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [116271695] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 09:00:52,117 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 09:00:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2024-11-03 09:00:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376738293] [2024-11-03 09:00:52,118 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 09:00:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 09:00:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 09:00:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 09:00:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:52,119 INFO L87 Difference]: Start difference. First operand 518 states and 719 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-03 09:00:52,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 09:00:52,159 INFO L93 Difference]: Finished difference Result 1466 states and 2044 transitions. [2024-11-03 09:00:52,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 09:00:52,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-03 09:00:52,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 09:00:52,162 INFO L225 Difference]: With dead ends: 1466 [2024-11-03 09:00:52,162 INFO L226 Difference]: Without dead ends: 1014 [2024-11-03 09:00:52,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-03 09:00:52,164 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 257 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 09:00:52,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 385 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 09:00:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2024-11-03 09:00:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 1012. [2024-11-03 09:00:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1011 states have (on average 1.3788328387734916) internal successors, (1394), 1011 states have internal predecessors, (1394), 0 states have call successors, (0), 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-11-03 09:00:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1394 transitions. [2024-11-03 09:00:52,184 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1394 transitions. Word has length 104 [2024-11-03 09:00:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 09:00:52,184 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1394 transitions. [2024-11-03 09:00:52,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 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-11-03 09:00:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1394 transitions. [2024-11-03 09:00:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-03 09:00:52,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 09:00:52,185 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:52,191 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-11-03 09:00:52,386 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-11-03 09:00:52,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 09:00:52,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 09:00:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1888659291, now seen corresponding path program 1 times [2024-11-03 09:00:52,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 09:00:52,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1919423010] [2024-11-03 09:00:52,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 09:00:52,387 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-11-03 09:00:52,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-03 09:00:52,388 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-11-03 09:00:52,391 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-11-03 09:00:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 09:00:52,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-03 09:00:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-03 09:00:52,510 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-03 09:00:52,510 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-03 09:00:52,511 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 09:00:52,516 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-11-03 09:00:52,712 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-11-03 09:00:52,715 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 09:00:52,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 09:00:52,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 09:00:52 BoogieIcfgContainer [2024-11-03 09:00:52,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 09:00:52,796 INFO L158 Benchmark]: Toolchain (without parser) took 7125.61ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 156.8MB in the beginning and 140.6MB in the end (delta: 16.2MB). Peak memory consumption was 72.2MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,796 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 186.6MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 09:00:52,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.98ms. Allocated memory is still 186.6MB. Free memory was 156.8MB in the beginning and 138.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.87ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 135.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,797 INFO L158 Benchmark]: Boogie Preprocessor took 61.61ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 132.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,797 INFO L158 Benchmark]: RCFGBuilder took 622.23ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 95.5MB in the end (delta: 37.1MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,798 INFO L158 Benchmark]: TraceAbstraction took 6077.98ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 94.9MB in the beginning and 140.6MB in the end (delta: -45.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. [2024-11-03 09:00:52,799 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.12ms. Allocated memory is still 186.6MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 315.98ms. Allocated memory is still 186.6MB. Free memory was 156.8MB in the beginning and 138.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.87ms. Allocated memory is still 186.6MB. Free memory was 138.5MB in the beginning and 135.8MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.61ms. Allocated memory is still 186.6MB. Free memory was 135.8MB in the beginning and 132.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 622.23ms. Allocated memory is still 186.6MB. Free memory was 132.7MB in the beginning and 95.5MB in the end (delta: 37.1MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * TraceAbstraction took 6077.98ms. Allocated memory was 186.6MB in the beginning and 242.2MB in the end (delta: 55.6MB). Free memory was 94.9MB in the beginning and 140.6MB in the end (delta: -45.7MB). Peak memory consumption was 10.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, s__state=12292, skip=0] [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 VAL [ag_Z=48, blastFlag=0, cb=2, ret=-1, s__hit=0, s__in_handshake=0, skip=0, 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 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] [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 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] [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 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] [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 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] [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 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] [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, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1345 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1345 mSDsluCounter, 4200 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2304 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1363 IncrementalHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 1896 mSDtfsCounter, 1363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1236 GetRequests, 1210 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1012occurred in iteration=10, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1230 ConstructedInterpolants, 59 QuantifiedInterpolants, 2943 SizeOfPredicates, 5 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 20 InterpolantComputations, 16 PerfectInterpolantSequences, 715/828 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-11-03 09:00:52,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...