/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:26:57,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:26:57,026 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:26:57,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:26:57,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:26:57,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:26:57,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:26:57,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:26:57,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:26:57,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:26:57,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:26:57,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:26:57,101 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:26:57,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:26:57,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:26:57,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:26:57,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:26:57,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:26:57,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:26:57,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:26:57,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:26:57,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:26:57,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:26:57,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:26:57,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:26:57,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:26:57,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:26:57,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:26:57,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:26:57,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:26:57,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:26:57,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:26:57,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:26:57,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:26:57,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:26:57,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:26:57,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:26:57,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:26:57,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:26:57,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:26:57,132 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:26:57,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:26:57,148 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:26:57,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:26:57,149 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:26:57,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:26:57,149 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:26:57,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:26:57,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:26:57,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:26:57,150 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:26:57,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:26:57,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:26:57,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:26:57,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:26:57,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:26:57,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:26:57,153 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:26:57,153 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:26:57,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:26:57,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:26:57,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:26:57,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:26:57,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:26:57,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:26:57,315 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:26:57,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-01-09 23:26:57,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15953c2d3/b09fbe4705584c7d91cc7716b73419ad/FLAG17638341b [2022-01-09 23:26:57,753 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:26:57,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c [2022-01-09 23:26:57,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15953c2d3/b09fbe4705584c7d91cc7716b73419ad/FLAG17638341b [2022-01-09 23:26:58,175 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15953c2d3/b09fbe4705584c7d91cc7716b73419ad [2022-01-09 23:26:58,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:26:58,178 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:26:58,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:26:58,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:26:58,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:26:58,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5bceb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58, skipping insertion in model container [2022-01-09 23:26:58,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:26:58,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:26:58,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-01-09 23:26:58,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:26:58,387 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:26:58,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_4.cil.c[42875,42888] [2022-01-09 23:26:58,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:26:58,430 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:26:58,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58 WrapperNode [2022-01-09 23:26:58,430 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:26:58,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:26:58,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:26:58,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:26:58,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,474 INFO L137 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 546 [2022-01-09 23:26:58,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:26:58,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:26:58,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:26:58,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:26:58,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,498 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:26:58,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:26:58,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:26:58,503 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:26:58,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (1/1) ... [2022-01-09 23:26:58,524 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:26:58,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:26:58,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-09 23:26:58,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-09 23:26:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:26:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:26:58,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:26:58,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:26:58,705 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:26:58,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:26:58,716 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-09 23:26:59,058 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-01-09 23:26:59,059 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-01-09 23:26:59,059 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:26:59,064 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:26:59,064 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-09 23:26:59,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:26:59 BoogieIcfgContainer [2022-01-09 23:26:59,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:26:59,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:26:59,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:26:59,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:26:59,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:26:58" (1/3) ... [2022-01-09 23:26:59,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3b3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:26:59, skipping insertion in model container [2022-01-09 23:26:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:26:58" (2/3) ... [2022-01-09 23:26:59,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31b3b3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:26:59, skipping insertion in model container [2022-01-09 23:26:59,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:26:59" (3/3) ... [2022-01-09 23:26:59,071 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_4.cil.c [2022-01-09 23:26:59,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:26:59,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:26:59,105 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:26:59,110 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:26:59,110 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:26:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-09 23:26:59,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:59,136 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:59,137 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:59,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:59,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1632005994, now seen corresponding path program 1 times [2022-01-09 23:26:59,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:59,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053247363] [2022-01-09 23:26:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:59,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:59,370 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:59,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053247363] [2022-01-09 23:26:59,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053247363] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:59,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:59,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:59,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429129348] [2022-01-09 23:26:59,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:59,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:59,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:59,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:59,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:59,402 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.7266187050359711) internal successors, (240), 140 states have internal predecessors, (240), 0 states have call successors, (0), 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 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:59,593 INFO L93 Difference]: Finished difference Result 328 states and 564 transitions. [2022-01-09 23:26:59,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-01-09 23:26:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:59,605 INFO L225 Difference]: With dead ends: 328 [2022-01-09 23:26:59,605 INFO L226 Difference]: Without dead ends: 175 [2022-01-09 23:26:59,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:59,610 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:59,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 190 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:59,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-09 23:26:59,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170. [2022-01-09 23:26:59,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.6272189349112427) internal successors, (275), 169 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 275 transitions. [2022-01-09 23:26:59,655 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 275 transitions. Word has length 44 [2022-01-09 23:26:59,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:59,655 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 275 transitions. [2022-01-09 23:26:59,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 275 transitions. [2022-01-09 23:26:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-09 23:26:59,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:59,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:59,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:26:59,662 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -954576436, now seen corresponding path program 1 times [2022-01-09 23:26:59,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757615671] [2022-01-09 23:26:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:59,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:59,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:59,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757615671] [2022-01-09 23:26:59,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757615671] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:59,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:59,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:59,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521240539] [2022-01-09 23:26:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:59,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:59,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:59,726 INFO L87 Difference]: Start difference. First operand 170 states and 275 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:26:59,861 INFO L93 Difference]: Finished difference Result 380 states and 624 transitions. [2022-01-09 23:26:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:26:59,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-09 23:26:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:26:59,864 INFO L225 Difference]: With dead ends: 380 [2022-01-09 23:26:59,864 INFO L226 Difference]: Without dead ends: 216 [2022-01-09 23:26:59,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:59,872 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 129 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:26:59,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 142 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:26:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-01-09 23:26:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-01-09 23:26:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.6761904761904762) internal successors, (352), 210 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 352 transitions. [2022-01-09 23:26:59,881 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 352 transitions. Word has length 45 [2022-01-09 23:26:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:26:59,881 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 352 transitions. [2022-01-09 23:26:59,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:26:59,882 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 352 transitions. [2022-01-09 23:26:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-09 23:26:59,883 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:26:59,883 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:26:59,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:26:59,884 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:26:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:26:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1754997851, now seen corresponding path program 1 times [2022-01-09 23:26:59,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:26:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701009928] [2022-01-09 23:26:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:26:59,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:26:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:26:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:26:59,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:26:59,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701009928] [2022-01-09 23:26:59,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701009928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:26:59,921 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:26:59,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:26:59,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824704756] [2022-01-09 23:26:59,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:26:59,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:26:59,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:26:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:26:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:26:59,922 INFO L87 Difference]: Start difference. First operand 211 states and 352 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,024 INFO L93 Difference]: Finished difference Result 445 states and 750 transitions. [2022-01-09 23:27:00,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-01-09 23:27:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,026 INFO L225 Difference]: With dead ends: 445 [2022-01-09 23:27:00,026 INFO L226 Difference]: Without dead ends: 242 [2022-01-09 23:27:00,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,032 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 155 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-01-09 23:27:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2022-01-09 23:27:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.6929460580912863) internal successors, (408), 241 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 408 transitions. [2022-01-09 23:27:00,042 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 408 transitions. Word has length 72 [2022-01-09 23:27:00,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,042 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 408 transitions. [2022-01-09 23:27:00,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 408 transitions. [2022-01-09 23:27:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:27:00,044 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,044 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:00,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-09 23:27:00,044 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash -479038981, now seen corresponding path program 1 times [2022-01-09 23:27:00,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295277794] [2022-01-09 23:27:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:00,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295277794] [2022-01-09 23:27:00,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295277794] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552335162] [2022-01-09 23:27:00,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,079 INFO L87 Difference]: Start difference. First operand 242 states and 408 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,173 INFO L93 Difference]: Finished difference Result 493 states and 832 transitions. [2022-01-09 23:27:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-09 23:27:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,174 INFO L225 Difference]: With dead ends: 493 [2022-01-09 23:27:00,174 INFO L226 Difference]: Without dead ends: 259 [2022-01-09 23:27:00,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,175 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 158 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 150 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-01-09 23:27:00,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2022-01-09 23:27:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.68359375) internal successors, (431), 256 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 431 transitions. [2022-01-09 23:27:00,183 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 431 transitions. Word has length 84 [2022-01-09 23:27:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,183 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 431 transitions. [2022-01-09 23:27:00,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 431 transitions. [2022-01-09 23:27:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-09 23:27:00,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,184 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:00,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-09 23:27:00,184 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1816808322, now seen corresponding path program 1 times [2022-01-09 23:27:00,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134886979] [2022-01-09 23:27:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:27:00,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134886979] [2022-01-09 23:27:00,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134886979] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940598235] [2022-01-09 23:27:00,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,222 INFO L87 Difference]: Start difference. First operand 257 states and 431 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,328 INFO L93 Difference]: Finished difference Result 553 states and 933 transitions. [2022-01-09 23:27:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2022-01-09 23:27:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,330 INFO L225 Difference]: With dead ends: 553 [2022-01-09 23:27:00,330 INFO L226 Difference]: Without dead ends: 304 [2022-01-09 23:27:00,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,331 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 147 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-01-09 23:27:00,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2022-01-09 23:27:00,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6946308724832215) internal successors, (505), 298 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 505 transitions. [2022-01-09 23:27:00,337 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 505 transitions. Word has length 84 [2022-01-09 23:27:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,337 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 505 transitions. [2022-01-09 23:27:00,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 505 transitions. [2022-01-09 23:27:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-09 23:27:00,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,338 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:00,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-09 23:27:00,339 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1697148062, now seen corresponding path program 1 times [2022-01-09 23:27:00,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599753314] [2022-01-09 23:27:00,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:00,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599753314] [2022-01-09 23:27:00,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599753314] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542681235] [2022-01-09 23:27:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,364 INFO L87 Difference]: Start difference. First operand 299 states and 505 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,439 INFO L93 Difference]: Finished difference Result 592 states and 1000 transitions. [2022-01-09 23:27:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 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 [2022-01-09 23:27:00,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,441 INFO L225 Difference]: With dead ends: 592 [2022-01-09 23:27:00,441 INFO L226 Difference]: Without dead ends: 301 [2022-01-09 23:27:00,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,442 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 157 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 138 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-01-09 23:27:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2022-01-09 23:27:00,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 298 states have (on average 1.6812080536912752) internal successors, (501), 298 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 501 transitions. [2022-01-09 23:27:00,448 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 501 transitions. Word has length 85 [2022-01-09 23:27:00,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,448 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 501 transitions. [2022-01-09 23:27:00,449 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 501 transitions. [2022-01-09 23:27:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-09 23:27:00,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:00,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-09 23:27:00,450 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1432172412, now seen corresponding path program 1 times [2022-01-09 23:27:00,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239895514] [2022-01-09 23:27:00,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:27:00,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239895514] [2022-01-09 23:27:00,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239895514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745577190] [2022-01-09 23:27:00,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,476 INFO L87 Difference]: Start difference. First operand 299 states and 501 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,583 INFO L93 Difference]: Finished difference Result 595 states and 997 transitions. [2022-01-09 23:27:00,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 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 [2022-01-09 23:27:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,585 INFO L225 Difference]: With dead ends: 595 [2022-01-09 23:27:00,585 INFO L226 Difference]: Without dead ends: 302 [2022-01-09 23:27:00,586 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,586 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-01-09 23:27:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2022-01-09 23:27:00,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.6756756756756757) internal successors, (496), 296 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 496 transitions. [2022-01-09 23:27:00,592 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 496 transitions. Word has length 85 [2022-01-09 23:27:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,592 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 496 transitions. [2022-01-09 23:27:00,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,592 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 496 transitions. [2022-01-09 23:27:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-01-09 23:27:00,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,593 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:00,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-09 23:27:00,593 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1085183485, now seen corresponding path program 1 times [2022-01-09 23:27:00,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991495868] [2022-01-09 23:27:00,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-01-09 23:27:00,612 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991495868] [2022-01-09 23:27:00,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991495868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588028502] [2022-01-09 23:27:00,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,614 INFO L87 Difference]: Start difference. First operand 297 states and 496 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) [2022-01-09 23:27:00,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,680 INFO L93 Difference]: Finished difference Result 595 states and 992 transitions. [2022-01-09 23:27:00,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,680 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 97 [2022-01-09 23:27:00,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,681 INFO L225 Difference]: With dead ends: 595 [2022-01-09 23:27:00,681 INFO L226 Difference]: Without dead ends: 306 [2022-01-09 23:27:00,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,682 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 162 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 149 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-01-09 23:27:00,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2022-01-09 23:27:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.6459016393442623) internal successors, (502), 305 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 502 transitions. [2022-01-09 23:27:00,688 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 502 transitions. Word has length 97 [2022-01-09 23:27:00,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,688 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 502 transitions. [2022-01-09 23:27:00,688 INFO L471 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) [2022-01-09 23:27:00,688 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 502 transitions. [2022-01-09 23:27:00,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-01-09 23:27:00,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-09 23:27:00,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-09 23:27:00,689 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -860132162, now seen corresponding path program 1 times [2022-01-09 23:27:00,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484759767] [2022-01-09 23:27:00,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:00,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484759767] [2022-01-09 23:27:00,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484759767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488726341] [2022-01-09 23:27:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,710 INFO L87 Difference]: Start difference. First operand 306 states and 502 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,797 INFO L93 Difference]: Finished difference Result 635 states and 1045 transitions. [2022-01-09 23:27:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-01-09 23:27:00,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,799 INFO L225 Difference]: With dead ends: 635 [2022-01-09 23:27:00,799 INFO L226 Difference]: Without dead ends: 337 [2022-01-09 23:27:00,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,800 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 141 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 141 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-09 23:27:00,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-01-09 23:27:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6437125748502994) internal successors, (549), 334 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 549 transitions. [2022-01-09 23:27:00,806 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 549 transitions. Word has length 98 [2022-01-09 23:27:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,806 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 549 transitions. [2022-01-09 23:27:00,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,806 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 549 transitions. [2022-01-09 23:27:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-09 23:27:00,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,807 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-09 23:27:00,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-09 23:27:00,808 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1120928325, now seen corresponding path program 1 times [2022-01-09 23:27:00,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600616882] [2022-01-09 23:27:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:00,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600616882] [2022-01-09 23:27:00,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600616882] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257665867] [2022-01-09 23:27:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,828 INFO L87 Difference]: Start difference. First operand 335 states and 549 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:00,940 INFO L93 Difference]: Finished difference Result 664 states and 1088 transitions. [2022-01-09 23:27:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:00,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 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 99 [2022-01-09 23:27:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:00,942 INFO L225 Difference]: With dead ends: 664 [2022-01-09 23:27:00,942 INFO L226 Difference]: Without dead ends: 337 [2022-01-09 23:27:00,942 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,943 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 140 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:00,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 141 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:00,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-01-09 23:27:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2022-01-09 23:27:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 1.6317365269461077) internal successors, (545), 334 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 545 transitions. [2022-01-09 23:27:00,949 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 545 transitions. Word has length 99 [2022-01-09 23:27:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:00,949 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 545 transitions. [2022-01-09 23:27:00,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 545 transitions. [2022-01-09 23:27:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-09 23:27:00,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:00,950 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-09 23:27:00,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-09 23:27:00,950 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1084775058, now seen corresponding path program 1 times [2022-01-09 23:27:00,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988067408] [2022-01-09 23:27:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:00,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:00,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988067408] [2022-01-09 23:27:00,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988067408] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:00,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:00,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:00,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719074676] [2022-01-09 23:27:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:00,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:00,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:00,972 INFO L87 Difference]: Start difference. First operand 335 states and 545 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,061 INFO L93 Difference]: Finished difference Result 697 states and 1138 transitions. [2022-01-09 23:27:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-09 23:27:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,062 INFO L225 Difference]: With dead ends: 697 [2022-01-09 23:27:01,062 INFO L226 Difference]: Without dead ends: 370 [2022-01-09 23:27:01,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,063 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:01,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-01-09 23:27:01,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-01-09 23:27:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.626038781163435) internal successors, (587), 361 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 587 transitions. [2022-01-09 23:27:01,070 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 587 transitions. Word has length 100 [2022-01-09 23:27:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,070 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 587 transitions. [2022-01-09 23:27:01,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 587 transitions. [2022-01-09 23:27:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-09 23:27:01,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,071 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-09 23:27:01,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-09 23:27:01,071 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1691577195, now seen corresponding path program 1 times [2022-01-09 23:27:01,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120415994] [2022-01-09 23:27:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-01-09 23:27:01,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120415994] [2022-01-09 23:27:01,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120415994] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293784542] [2022-01-09 23:27:01,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,090 INFO L87 Difference]: Start difference. First operand 362 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,178 INFO L93 Difference]: Finished difference Result 724 states and 1175 transitions. [2022-01-09 23:27:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 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 101 [2022-01-09 23:27:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,180 INFO L225 Difference]: With dead ends: 724 [2022-01-09 23:27:01,180 INFO L226 Difference]: Without dead ends: 370 [2022-01-09 23:27:01,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,181 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 149 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2022-01-09 23:27:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 362. [2022-01-09 23:27:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 361 states have (on average 1.6121883656509695) internal successors, (582), 361 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 582 transitions. [2022-01-09 23:27:01,187 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 582 transitions. Word has length 101 [2022-01-09 23:27:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,188 INFO L470 AbstractCegarLoop]: Abstraction has 362 states and 582 transitions. [2022-01-09 23:27:01,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,188 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 582 transitions. [2022-01-09 23:27:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-09 23:27:01,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,189 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-09 23:27:01,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-09 23:27:01,189 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,189 INFO L85 PathProgramCache]: Analyzing trace with hash -479008336, now seen corresponding path program 1 times [2022-01-09 23:27:01,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741580815] [2022-01-09 23:27:01,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 23:27:01,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741580815] [2022-01-09 23:27:01,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741580815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088210621] [2022-01-09 23:27:01,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,208 INFO L87 Difference]: Start difference. First operand 362 states and 582 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,285 INFO L93 Difference]: Finished difference Result 741 states and 1193 transitions. [2022-01-09 23:27:01,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-01-09 23:27:01,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,287 INFO L225 Difference]: With dead ends: 741 [2022-01-09 23:27:01,287 INFO L226 Difference]: Without dead ends: 387 [2022-01-09 23:27:01,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,288 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 149 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 144 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:01,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-01-09 23:27:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-01-09 23:27:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5994764397905759) internal successors, (611), 382 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 611 transitions. [2022-01-09 23:27:01,295 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 611 transitions. Word has length 105 [2022-01-09 23:27:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,295 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 611 transitions. [2022-01-09 23:27:01,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,295 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 611 transitions. [2022-01-09 23:27:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-09 23:27:01,296 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,296 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-01-09 23:27:01,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-09 23:27:01,296 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2118869193, now seen corresponding path program 1 times [2022-01-09 23:27:01,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557409946] [2022-01-09 23:27:01,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 23:27:01,313 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557409946] [2022-01-09 23:27:01,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557409946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404399020] [2022-01-09 23:27:01,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,314 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,314 INFO L87 Difference]: Start difference. First operand 383 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,393 INFO L93 Difference]: Finished difference Result 762 states and 1216 transitions. [2022-01-09 23:27:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 106 [2022-01-09 23:27:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,395 INFO L225 Difference]: With dead ends: 762 [2022-01-09 23:27:01,395 INFO L226 Difference]: Without dead ends: 387 [2022-01-09 23:27:01,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,396 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 148 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 144 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:01,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-01-09 23:27:01,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 383. [2022-01-09 23:27:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.5837696335078535) internal successors, (605), 382 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 605 transitions. [2022-01-09 23:27:01,402 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 605 transitions. Word has length 106 [2022-01-09 23:27:01,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,402 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 605 transitions. [2022-01-09 23:27:01,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,403 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 605 transitions. [2022-01-09 23:27:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-09 23:27:01,403 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,403 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:01,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-09 23:27:01,404 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1932137040, now seen corresponding path program 1 times [2022-01-09 23:27:01,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195843018] [2022-01-09 23:27:01,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,425 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-01-09 23:27:01,425 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195843018] [2022-01-09 23:27:01,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195843018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,426 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031089973] [2022-01-09 23:27:01,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,426 INFO L87 Difference]: Start difference. First operand 383 states and 605 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,451 INFO L93 Difference]: Finished difference Result 1131 states and 1790 transitions. [2022-01-09 23:27:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 121 [2022-01-09 23:27:01,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,453 INFO L225 Difference]: With dead ends: 1131 [2022-01-09 23:27:01,453 INFO L226 Difference]: Without dead ends: 756 [2022-01-09 23:27:01,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,454 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 137 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-01-09 23:27:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2022-01-09 23:27:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 755 states have (on average 1.5788079470198675) internal successors, (1192), 755 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1192 transitions. [2022-01-09 23:27:01,467 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1192 transitions. Word has length 121 [2022-01-09 23:27:01,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,468 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1192 transitions. [2022-01-09 23:27:01,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,468 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1192 transitions. [2022-01-09 23:27:01,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-09 23:27:01,469 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,469 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:01,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-09 23:27:01,469 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1552830339, now seen corresponding path program 1 times [2022-01-09 23:27:01,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403185865] [2022-01-09 23:27:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-01-09 23:27:01,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403185865] [2022-01-09 23:27:01,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403185865] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110785168] [2022-01-09 23:27:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,502 INFO L87 Difference]: Start difference. First operand 756 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,527 INFO L93 Difference]: Finished difference Result 1832 states and 2893 transitions. [2022-01-09 23:27:01,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-09 23:27:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,530 INFO L225 Difference]: With dead ends: 1832 [2022-01-09 23:27:01,530 INFO L226 Difference]: Without dead ends: 1084 [2022-01-09 23:27:01,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,532 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 134 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 543 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-01-09 23:27:01,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2022-01-09 23:27:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1083 states have (on average 1.5780240073868883) internal successors, (1709), 1083 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1709 transitions. [2022-01-09 23:27:01,549 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1709 transitions. Word has length 122 [2022-01-09 23:27:01,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,549 INFO L470 AbstractCegarLoop]: Abstraction has 1084 states and 1709 transitions. [2022-01-09 23:27:01,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1709 transitions. [2022-01-09 23:27:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-09 23:27:01,551 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,551 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:01,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-09 23:27:01,551 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash 323652479, now seen corresponding path program 1 times [2022-01-09 23:27:01,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970271739] [2022-01-09 23:27:01,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-01-09 23:27:01,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970271739] [2022-01-09 23:27:01,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970271739] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528021886] [2022-01-09 23:27:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,577 INFO L87 Difference]: Start difference. First operand 1084 states and 1709 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,608 INFO L93 Difference]: Finished difference Result 2529 states and 3993 transitions. [2022-01-09 23:27:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 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 122 [2022-01-09 23:27:01,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,613 INFO L225 Difference]: With dead ends: 2529 [2022-01-09 23:27:01,613 INFO L226 Difference]: Without dead ends: 1453 [2022-01-09 23:27:01,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,615 INFO L933 BasicCegarLoop]: 361 mSDtfsCounter, 155 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 546 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-01-09 23:27:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1453. [2022-01-09 23:27:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1452 states have (on average 1.5778236914600552) internal successors, (2291), 1452 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2291 transitions. [2022-01-09 23:27:01,640 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2291 transitions. Word has length 122 [2022-01-09 23:27:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,640 INFO L470 AbstractCegarLoop]: Abstraction has 1453 states and 2291 transitions. [2022-01-09 23:27:01,640 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2291 transitions. [2022-01-09 23:27:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-01-09 23:27:01,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,642 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:01,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-09 23:27:01,642 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1712946493, now seen corresponding path program 1 times [2022-01-09 23:27:01,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711269720] [2022-01-09 23:27:01,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-01-09 23:27:01,660 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711269720] [2022-01-09 23:27:01,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711269720] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617516710] [2022-01-09 23:27:01,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,662 INFO L87 Difference]: Start difference. First operand 1453 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,697 INFO L93 Difference]: Finished difference Result 3249 states and 5126 transitions. [2022-01-09 23:27:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2022-01-09 23:27:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,702 INFO L225 Difference]: With dead ends: 3249 [2022-01-09 23:27:01,702 INFO L226 Difference]: Without dead ends: 1804 [2022-01-09 23:27:01,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,705 INFO L933 BasicCegarLoop]: 213 mSDtfsCounter, 170 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 388 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:01,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2022-01-09 23:27:01,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1804. [2022-01-09 23:27:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5762617859123682) internal successors, (2842), 1803 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2842 transitions. [2022-01-09 23:27:01,744 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2842 transitions. Word has length 122 [2022-01-09 23:27:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:01,744 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2842 transitions. [2022-01-09 23:27:01,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2842 transitions. [2022-01-09 23:27:01,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-09 23:27:01,747 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:01,748 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:01,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-09 23:27:01,748 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:01,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:01,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1532697181, now seen corresponding path program 1 times [2022-01-09 23:27:01,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:01,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080443192] [2022-01-09 23:27:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:01,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-01-09 23:27:01,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080443192] [2022-01-09 23:27:01,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080443192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:01,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:01,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:01,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106854744] [2022-01-09 23:27:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:01,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:01,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:01,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:01,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,826 INFO L87 Difference]: Start difference. First operand 1804 states and 2842 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:01,984 INFO L93 Difference]: Finished difference Result 3650 states and 5732 transitions. [2022-01-09 23:27:01,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:01,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-01-09 23:27:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:01,990 INFO L225 Difference]: With dead ends: 3650 [2022-01-09 23:27:01,990 INFO L226 Difference]: Without dead ends: 1854 [2022-01-09 23:27:01,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:01,992 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:01,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2022-01-09 23:27:02,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1804. [2022-01-09 23:27:02,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.5363283416528009) internal successors, (2770), 1803 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2770 transitions. [2022-01-09 23:27:02,031 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2770 transitions. Word has length 199 [2022-01-09 23:27:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:02,031 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2770 transitions. [2022-01-09 23:27:02,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2770 transitions. [2022-01-09 23:27:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-01-09 23:27:02,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:02,034 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:02,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-09 23:27:02,035 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:02,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -995291011, now seen corresponding path program 1 times [2022-01-09 23:27:02,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:02,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586278441] [2022-01-09 23:27:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:02,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-01-09 23:27:02,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:02,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586278441] [2022-01-09 23:27:02,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586278441] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:02,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:02,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:02,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743014838] [2022-01-09 23:27:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:02,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:02,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:02,077 INFO L87 Difference]: Start difference. First operand 1804 states and 2770 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:02,211 INFO L93 Difference]: Finished difference Result 3667 states and 5605 transitions. [2022-01-09 23:27:02,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 213 [2022-01-09 23:27:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:02,216 INFO L225 Difference]: With dead ends: 3667 [2022-01-09 23:27:02,216 INFO L226 Difference]: Without dead ends: 1871 [2022-01-09 23:27:02,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:02,219 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 152 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:02,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 163 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2022-01-09 23:27:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1804. [2022-01-09 23:27:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1804 states, 1803 states have (on average 1.4941763727121464) internal successors, (2694), 1803 states have internal predecessors, (2694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:02,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 2694 transitions. [2022-01-09 23:27:02,259 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 2694 transitions. Word has length 213 [2022-01-09 23:27:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:02,259 INFO L470 AbstractCegarLoop]: Abstraction has 1804 states and 2694 transitions. [2022-01-09 23:27:02,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 2694 transitions. [2022-01-09 23:27:02,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-01-09 23:27:02,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:02,263 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:02,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-09 23:27:02,263 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:02,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -344869126, now seen corresponding path program 1 times [2022-01-09 23:27:02,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:02,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833455017] [2022-01-09 23:27:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:02,264 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-09 23:27:02,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:02,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833455017] [2022-01-09 23:27:02,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833455017] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:27:02,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937265129] [2022-01-09 23:27:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:02,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:02,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:27:02,328 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:27:02,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:27:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:02,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:27:02,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:27:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-09 23:27:02,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:27:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 343 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-01-09 23:27:03,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937265129] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:27:03,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:27:03,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-09 23:27:03,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245632654] [2022-01-09 23:27:03,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:27:03,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:27:03,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:03,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:27:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:27:03,044 INFO L87 Difference]: Start difference. First operand 1804 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:03,320 INFO L93 Difference]: Finished difference Result 4265 states and 6321 transitions. [2022-01-09 23:27:03,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:27:03,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2022-01-09 23:27:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:03,342 INFO L225 Difference]: With dead ends: 4265 [2022-01-09 23:27:03,343 INFO L226 Difference]: Without dead ends: 2436 [2022-01-09 23:27:03,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:27:03,345 INFO L933 BasicCegarLoop]: 236 mSDtfsCounter, 486 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:03,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [486 Valid, 448 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:27:03,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-01-09 23:27:03,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 1604. [2022-01-09 23:27:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1603 states have (on average 1.470991890205864) internal successors, (2358), 1603 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2358 transitions. [2022-01-09 23:27:03,429 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2358 transitions. Word has length 232 [2022-01-09 23:27:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:03,429 INFO L470 AbstractCegarLoop]: Abstraction has 1604 states and 2358 transitions. [2022-01-09 23:27:03,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2358 transitions. [2022-01-09 23:27:03,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-01-09 23:27:03,433 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:03,433 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:03,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-09 23:27:03,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-01-09 23:27:03,651 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:03,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1731638989, now seen corresponding path program 1 times [2022-01-09 23:27:03,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:03,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692194109] [2022-01-09 23:27:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:03,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-01-09 23:27:03,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:03,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692194109] [2022-01-09 23:27:03,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692194109] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:03,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:03,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:03,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336647467] [2022-01-09 23:27:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:03,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:03,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:03,689 INFO L87 Difference]: Start difference. First operand 1604 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:03,823 INFO L93 Difference]: Finished difference Result 3395 states and 5009 transitions. [2022-01-09 23:27:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 241 [2022-01-09 23:27:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:03,828 INFO L225 Difference]: With dead ends: 3395 [2022-01-09 23:27:03,829 INFO L226 Difference]: Without dead ends: 1679 [2022-01-09 23:27:03,830 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:03,831 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:03,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 270 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-01-09 23:27:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1679. [2022-01-09 23:27:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1679 states, 1678 states have (on average 1.4439809296781883) internal successors, (2423), 1678 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1679 states to 1679 states and 2423 transitions. [2022-01-09 23:27:03,866 INFO L78 Accepts]: Start accepts. Automaton has 1679 states and 2423 transitions. Word has length 241 [2022-01-09 23:27:03,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:03,867 INFO L470 AbstractCegarLoop]: Abstraction has 1679 states and 2423 transitions. [2022-01-09 23:27:03,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1679 states and 2423 transitions. [2022-01-09 23:27:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-09 23:27:03,869 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:03,869 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:03,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-09 23:27:03,870 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:03,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1272517136, now seen corresponding path program 1 times [2022-01-09 23:27:03,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:03,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021924198] [2022-01-09 23:27:03,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:03,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-09 23:27:03,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:03,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021924198] [2022-01-09 23:27:03,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021924198] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:27:03,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733495296] [2022-01-09 23:27:03,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:03,902 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:03,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:27:03,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:27:03,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 23:27:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:03,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:27:04,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:27:04,289 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-09 23:27:04,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:27:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-09 23:27:04,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733495296] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:27:04,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:27:04,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-09 23:27:04,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864648817] [2022-01-09 23:27:04,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:27:04,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:27:04,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:04,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:27:04,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:27:04,614 INFO L87 Difference]: Start difference. First operand 1679 states and 2423 transitions. Second operand has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:05,179 INFO L93 Difference]: Finished difference Result 7700 states and 11238 transitions. [2022-01-09 23:27:05,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-09 23:27:05,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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 253 [2022-01-09 23:27:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:05,195 INFO L225 Difference]: With dead ends: 7700 [2022-01-09 23:27:05,195 INFO L226 Difference]: Without dead ends: 6029 [2022-01-09 23:27:05,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 508 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:27:05,198 INFO L933 BasicCegarLoop]: 540 mSDtfsCounter, 438 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:05,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [438 Valid, 1186 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-09 23:27:05,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6029 states. [2022-01-09 23:27:05,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6029 to 2357. [2022-01-09 23:27:05,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2357 states, 2356 states have (on average 1.3247028862478778) internal successors, (3121), 2356 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2357 states to 2357 states and 3121 transitions. [2022-01-09 23:27:05,267 INFO L78 Accepts]: Start accepts. Automaton has 2357 states and 3121 transitions. Word has length 253 [2022-01-09 23:27:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:05,268 INFO L470 AbstractCegarLoop]: Abstraction has 2357 states and 3121 transitions. [2022-01-09 23:27:05,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2357 states and 3121 transitions. [2022-01-09 23:27:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-01-09 23:27:05,271 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:05,271 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:05,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 23:27:05,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-09 23:27:05,485 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:05,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1561336526, now seen corresponding path program 1 times [2022-01-09 23:27:05,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195100161] [2022-01-09 23:27:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:05,486 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2022-01-09 23:27:05,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:05,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195100161] [2022-01-09 23:27:05,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195100161] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:05,513 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:05,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:05,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203147849] [2022-01-09 23:27:05,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:05,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:05,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:05,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:05,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:05,514 INFO L87 Difference]: Start difference. First operand 2357 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:05,609 INFO L93 Difference]: Finished difference Result 6533 states and 8644 transitions. [2022-01-09 23:27:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:05,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253 [2022-01-09 23:27:05,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:05,619 INFO L225 Difference]: With dead ends: 6533 [2022-01-09 23:27:05,619 INFO L226 Difference]: Without dead ends: 4184 [2022-01-09 23:27:05,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:05,622 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 120 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:05,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 514 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2022-01-09 23:27:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 4182. [2022-01-09 23:27:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3207366658694093) internal successors, (5522), 4181 states have internal predecessors, (5522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5522 transitions. [2022-01-09 23:27:05,723 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5522 transitions. Word has length 253 [2022-01-09 23:27:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:05,723 INFO L470 AbstractCegarLoop]: Abstraction has 4182 states and 5522 transitions. [2022-01-09 23:27:05,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5522 transitions. [2022-01-09 23:27:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2022-01-09 23:27:05,729 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:05,729 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:05,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-09 23:27:05,729 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash -914284920, now seen corresponding path program 1 times [2022-01-09 23:27:05,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:05,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898346560] [2022-01-09 23:27:05,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:05,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2022-01-09 23:27:05,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:05,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898346560] [2022-01-09 23:27:05,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898346560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:05,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:05,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:05,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503461438] [2022-01-09 23:27:05,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:05,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:05,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:05,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:05,758 INFO L87 Difference]: Start difference. First operand 4182 states and 5522 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:05,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:05,903 INFO L93 Difference]: Finished difference Result 8584 states and 11340 transitions. [2022-01-09 23:27:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:05,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 256 [2022-01-09 23:27:05,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:05,910 INFO L225 Difference]: With dead ends: 8584 [2022-01-09 23:27:05,910 INFO L226 Difference]: Without dead ends: 4410 [2022-01-09 23:27:05,914 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:05,914 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 137 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:05,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 166 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4410 states. [2022-01-09 23:27:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4410 to 4182. [2022-01-09 23:27:06,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4182 states, 4181 states have (on average 1.3035159052858167) internal successors, (5450), 4181 states have internal predecessors, (5450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4182 states to 4182 states and 5450 transitions. [2022-01-09 23:27:06,022 INFO L78 Accepts]: Start accepts. Automaton has 4182 states and 5450 transitions. Word has length 256 [2022-01-09 23:27:06,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:06,022 INFO L470 AbstractCegarLoop]: Abstraction has 4182 states and 5450 transitions. [2022-01-09 23:27:06,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,022 INFO L276 IsEmpty]: Start isEmpty. Operand 4182 states and 5450 transitions. [2022-01-09 23:27:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2022-01-09 23:27:06,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:06,028 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:06,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-09 23:27:06,028 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1357789354, now seen corresponding path program 1 times [2022-01-09 23:27:06,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:06,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367118295] [2022-01-09 23:27:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:06,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 300 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2022-01-09 23:27:06,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:06,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367118295] [2022-01-09 23:27:06,053 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367118295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:06,053 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:06,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:06,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557668868] [2022-01-09 23:27:06,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:06,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:06,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,054 INFO L87 Difference]: Start difference. First operand 4182 states and 5450 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:06,177 INFO L93 Difference]: Finished difference Result 8488 states and 11054 transitions. [2022-01-09 23:27:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:06,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 290 [2022-01-09 23:27:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:06,184 INFO L225 Difference]: With dead ends: 8488 [2022-01-09 23:27:06,184 INFO L226 Difference]: Without dead ends: 4314 [2022-01-09 23:27:06,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,188 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:06,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 300 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:06,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-01-09 23:27:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 4274. [2022-01-09 23:27:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4274 states, 4273 states have (on average 1.301661596068336) internal successors, (5562), 4273 states have internal predecessors, (5562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 5562 transitions. [2022-01-09 23:27:06,304 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 5562 transitions. Word has length 290 [2022-01-09 23:27:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:06,304 INFO L470 AbstractCegarLoop]: Abstraction has 4274 states and 5562 transitions. [2022-01-09 23:27:06,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 5562 transitions. [2022-01-09 23:27:06,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-01-09 23:27:06,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:06,310 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:06,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-09 23:27:06,311 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:06,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:06,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1702375352, now seen corresponding path program 1 times [2022-01-09 23:27:06,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:06,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959064372] [2022-01-09 23:27:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:06,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:06,337 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2022-01-09 23:27:06,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:06,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959064372] [2022-01-09 23:27:06,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959064372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:06,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:06,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:06,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887190815] [2022-01-09 23:27:06,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:06,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:06,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:06,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:06,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,338 INFO L87 Difference]: Start difference. First operand 4274 states and 5562 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:06,468 INFO L93 Difference]: Finished difference Result 8920 states and 11652 transitions. [2022-01-09 23:27:06,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:06,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 311 [2022-01-09 23:27:06,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:06,475 INFO L225 Difference]: With dead ends: 8920 [2022-01-09 23:27:06,476 INFO L226 Difference]: Without dead ends: 4654 [2022-01-09 23:27:06,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,480 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 29 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:06,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 299 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2022-01-09 23:27:06,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 4524. [2022-01-09 23:27:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4523 states have (on average 1.2960424497015255) internal successors, (5862), 4523 states have internal predecessors, (5862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 5862 transitions. [2022-01-09 23:27:06,586 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 5862 transitions. Word has length 311 [2022-01-09 23:27:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:06,586 INFO L470 AbstractCegarLoop]: Abstraction has 4524 states and 5862 transitions. [2022-01-09 23:27:06,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 5862 transitions. [2022-01-09 23:27:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-01-09 23:27:06,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:06,594 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:06,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-09 23:27:06,594 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:06,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 602793911, now seen corresponding path program 1 times [2022-01-09 23:27:06,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:06,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400766723] [2022-01-09 23:27:06,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:06,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-01-09 23:27:06,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:06,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400766723] [2022-01-09 23:27:06,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400766723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:06,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:06,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:06,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198652464] [2022-01-09 23:27:06,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:06,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:06,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,625 INFO L87 Difference]: Start difference. First operand 4524 states and 5862 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:06,726 INFO L93 Difference]: Finished difference Result 7636 states and 9829 transitions. [2022-01-09 23:27:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 321 [2022-01-09 23:27:06,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:06,730 INFO L225 Difference]: With dead ends: 7636 [2022-01-09 23:27:06,730 INFO L226 Difference]: Without dead ends: 2476 [2022-01-09 23:27:06,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,733 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:06,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 288 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:06,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2022-01-09 23:27:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2022-01-09 23:27:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2836363636363637) internal successors, (3177), 2475 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3177 transitions. [2022-01-09 23:27:06,775 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3177 transitions. Word has length 321 [2022-01-09 23:27:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:06,775 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3177 transitions. [2022-01-09 23:27:06,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3177 transitions. [2022-01-09 23:27:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2022-01-09 23:27:06,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:06,778 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:06,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-09 23:27:06,778 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -616309997, now seen corresponding path program 1 times [2022-01-09 23:27:06,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193920586] [2022-01-09 23:27:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:06,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 580 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-01-09 23:27:06,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193920586] [2022-01-09 23:27:06,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193920586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:06,808 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:06,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:06,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399869633] [2022-01-09 23:27:06,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:06,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:06,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,809 INFO L87 Difference]: Start difference. First operand 2476 states and 3177 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:06,924 INFO L93 Difference]: Finished difference Result 4984 states and 6407 transitions. [2022-01-09 23:27:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 337 [2022-01-09 23:27:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:06,928 INFO L225 Difference]: With dead ends: 4984 [2022-01-09 23:27:06,928 INFO L226 Difference]: Without dead ends: 2516 [2022-01-09 23:27:06,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:06,930 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 19 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:06,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 293 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:06,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2022-01-09 23:27:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2476. [2022-01-09 23:27:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2735353535353535) internal successors, (3152), 2475 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3152 transitions. [2022-01-09 23:27:06,982 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3152 transitions. Word has length 337 [2022-01-09 23:27:06,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:06,982 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3152 transitions. [2022-01-09 23:27:06,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3152 transitions. [2022-01-09 23:27:06,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2022-01-09 23:27:06,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:06,986 INFO L514 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:06,986 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-09 23:27:06,986 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1063549815, now seen corresponding path program 1 times [2022-01-09 23:27:06,986 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:06,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443265371] [2022-01-09 23:27:06,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:06,986 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:07,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2022-01-09 23:27:07,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:07,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443265371] [2022-01-09 23:27:07,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443265371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:07,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:07,022 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:07,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036180848] [2022-01-09 23:27:07,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:07,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:07,023 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:07,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:07,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:07,023 INFO L87 Difference]: Start difference. First operand 2476 states and 3152 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:07,121 INFO L93 Difference]: Finished difference Result 4954 states and 6302 transitions. [2022-01-09 23:27:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 360 [2022-01-09 23:27:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:07,125 INFO L225 Difference]: With dead ends: 4954 [2022-01-09 23:27:07,125 INFO L226 Difference]: Without dead ends: 2486 [2022-01-09 23:27:07,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:07,127 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:07,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 293 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:07,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2022-01-09 23:27:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2476. [2022-01-09 23:27:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.2634343434343434) internal successors, (3127), 2475 states have internal predecessors, (3127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3127 transitions. [2022-01-09 23:27:07,170 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3127 transitions. Word has length 360 [2022-01-09 23:27:07,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:07,171 INFO L470 AbstractCegarLoop]: Abstraction has 2476 states and 3127 transitions. [2022-01-09 23:27:07,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3127 transitions. [2022-01-09 23:27:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2022-01-09 23:27:07,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:07,174 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:07,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-09 23:27:07,174 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:07,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2107174257, now seen corresponding path program 1 times [2022-01-09 23:27:07,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:07,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608748249] [2022-01-09 23:27:07,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:07,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2022-01-09 23:27:07,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608748249] [2022-01-09 23:27:07,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608748249] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:27:07,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67019774] [2022-01-09 23:27:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:07,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:27:07,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:27:07,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 23:27:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:07,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:27:07,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:27:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2022-01-09 23:27:07,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 23:27:07,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67019774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:07,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-09 23:27:07,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-01-09 23:27:07,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208936110] [2022-01-09 23:27:07,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:07,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:07,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:07,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:07,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:27:07,927 INFO L87 Difference]: Start difference. First operand 2476 states and 3127 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:08,010 INFO L93 Difference]: Finished difference Result 3068 states and 3883 transitions. [2022-01-09 23:27:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:08,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 393 [2022-01-09 23:27:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:08,019 INFO L225 Difference]: With dead ends: 3068 [2022-01-09 23:27:08,019 INFO L226 Difference]: Without dead ends: 2930 [2022-01-09 23:27:08,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-09 23:27:08,020 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 91 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:08,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 447 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:27:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2022-01-09 23:27:08,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2340. [2022-01-09 23:27:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2340 states, 2339 states have (on average 1.27105600684053) internal successors, (2973), 2339 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 2973 transitions. [2022-01-09 23:27:08,066 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 2973 transitions. Word has length 393 [2022-01-09 23:27:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:08,067 INFO L470 AbstractCegarLoop]: Abstraction has 2340 states and 2973 transitions. [2022-01-09 23:27:08,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 2973 transitions. [2022-01-09 23:27:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-01-09 23:27:08,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:08,070 INFO L514 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:08,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 23:27:08,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:08,288 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:08,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2021892229, now seen corresponding path program 1 times [2022-01-09 23:27:08,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:08,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696632751] [2022-01-09 23:27:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:08,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-09 23:27:08,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696632751] [2022-01-09 23:27:08,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696632751] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:27:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125804427] [2022-01-09 23:27:08,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:08,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:08,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:27:08,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:27:08,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 23:27:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:08,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:27:08,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:27:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-09 23:27:08,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:27:09,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 1045 proven. 26 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2022-01-09 23:27:09,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125804427] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:27:09,349 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:27:09,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-09 23:27:09,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336653434] [2022-01-09 23:27:09,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:27:09,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:27:09,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:27:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:27:09,350 INFO L87 Difference]: Start difference. First operand 2340 states and 2973 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:09,632 INFO L93 Difference]: Finished difference Result 5609 states and 7131 transitions. [2022-01-09 23:27:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-09 23:27:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2022-01-09 23:27:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:09,636 INFO L225 Difference]: With dead ends: 5609 [2022-01-09 23:27:09,637 INFO L226 Difference]: Without dead ends: 3228 [2022-01-09 23:27:09,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 818 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:27:09,639 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 586 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:09,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 397 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-09 23:27:09,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-01-09 23:27:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 2400. [2022-01-09 23:27:09,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2400 states, 2399 states have (on average 1.2705293872446852) internal successors, (3048), 2399 states have internal predecessors, (3048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:09,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3048 transitions. [2022-01-09 23:27:09,687 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3048 transitions. Word has length 409 [2022-01-09 23:27:09,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:09,688 INFO L470 AbstractCegarLoop]: Abstraction has 2400 states and 3048 transitions. [2022-01-09 23:27:09,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:09,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3048 transitions. [2022-01-09 23:27:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2022-01-09 23:27:09,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:09,692 INFO L514 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:09,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 23:27:09,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:09,905 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:09,905 INFO L85 PathProgramCache]: Analyzing trace with hash -50523035, now seen corresponding path program 1 times [2022-01-09 23:27:09,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:09,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393857779] [2022-01-09 23:27:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:09,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3128 backedges. 1661 proven. 0 refuted. 0 times theorem prover too weak. 1467 trivial. 0 not checked. [2022-01-09 23:27:09,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393857779] [2022-01-09 23:27:09,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393857779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:27:09,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:27:09,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:27:09,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742124180] [2022-01-09 23:27:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:27:09,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:27:09,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:27:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:09,954 INFO L87 Difference]: Start difference. First operand 2400 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:10,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:10,055 INFO L93 Difference]: Finished difference Result 4972 states and 6324 transitions. [2022-01-09 23:27:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:27:10,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 537 [2022-01-09 23:27:10,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:10,059 INFO L225 Difference]: With dead ends: 4972 [2022-01-09 23:27:10,059 INFO L226 Difference]: Without dead ends: 2580 [2022-01-09 23:27:10,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:27:10,061 INFO L933 BasicCegarLoop]: 191 mSDtfsCounter, 11 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:10,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 290 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2022-01-09 23:27:10,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 2570. [2022-01-09 23:27:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 1.262358894511483) internal successors, (3243), 2569 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:10,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 3243 transitions. [2022-01-09 23:27:10,109 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 3243 transitions. Word has length 537 [2022-01-09 23:27:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:10,109 INFO L470 AbstractCegarLoop]: Abstraction has 2570 states and 3243 transitions. [2022-01-09 23:27:10,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 3243 transitions. [2022-01-09 23:27:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2022-01-09 23:27:10,113 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:27:10,113 INFO L514 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:10,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-09 23:27:10,113 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:27:10,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:27:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1600887189, now seen corresponding path program 1 times [2022-01-09 23:27:10,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:27:10,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510620732] [2022-01-09 23:27:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:10,114 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:27:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 23:27:10,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:27:10,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510620732] [2022-01-09 23:27:10,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510620732] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:27:10,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642802552] [2022-01-09 23:27:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:27:10,203 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:27:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:27:10,220 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:27:10,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-09 23:27:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:27:10,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:27:10,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:27:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 23:27:10,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:27:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4009 backedges. 2315 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2022-01-09 23:27:11,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642802552] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:27:11,154 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:27:11,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-01-09 23:27:11,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829643784] [2022-01-09 23:27:11,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:27:11,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-09 23:27:11,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:27:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-09 23:27:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:27:11,155 INFO L87 Difference]: Start difference. First operand 2570 states and 3243 transitions. Second operand has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:11,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:27:11,303 INFO L93 Difference]: Finished difference Result 4135 states and 5217 transitions. [2022-01-09 23:27:11,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:27:11,303 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 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 599 [2022-01-09 23:27:11,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:27:11,304 INFO L225 Difference]: With dead ends: 4135 [2022-01-09 23:27:11,304 INFO L226 Difference]: Without dead ends: 0 [2022-01-09 23:27:11,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1204 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:27:11,307 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 119 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:27:11,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 398 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:27:11,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-09 23:27:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-09 23:27:11,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:11,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-09 23:27:11,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 599 [2022-01-09 23:27:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:27:11,307 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-09 23:27:11,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:27:11,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-09 23:27:11,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-09 23:27:11,309 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-09 23:27:11,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-09 23:27:11,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-01-09 23:27:11,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-09 23:27:25,385 INFO L858 garLoopResultBuilder]: For program point L531(lines 531 535) no Hoare annotation was computed. [2022-01-09 23:27:25,385 INFO L858 garLoopResultBuilder]: For program point L531-2(lines 531 535) no Hoare annotation was computed. [2022-01-09 23:27:25,385 INFO L858 garLoopResultBuilder]: For program point L399(lines 399 417) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L854 garLoopResultBuilder]: At program point L201(lines 197 562) the Hoare annotation is: (let ((.cse2 (not (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (.cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse1 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (or (and (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 .cse2) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse3 .cse0 .cse1 .cse2) (and (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse0 .cse1) (and .cse3 .cse0 .cse1 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)))) [2022-01-09 23:27:25,386 INFO L854 garLoopResultBuilder]: At program point L168(lines 164 573) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-01-09 23:27:25,386 INFO L854 garLoopResultBuilder]: At program point L135(lines 134 583) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse4 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10))) [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 104) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L499(lines 499 502) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L400(lines 400 406) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L861 garLoopResultBuilder]: At program point L632(lines 623 634) the Hoare annotation is: true [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L203(lines 203 560) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L170(lines 170 571) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L137(lines 137 582) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2022-01-09 23:27:25,386 INFO L858 garLoopResultBuilder]: For program point L468(lines 468 470) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L270(lines 270 272) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L237(lines 237 248) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L237-2(lines 219 553) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L304-2(lines 304 308) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L437-1(lines 437 445) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L239(lines 239 242) no Hoare annotation was computed. [2022-01-09 23:27:25,387 INFO L858 garLoopResultBuilder]: For program point L206(lines 206 559) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L173(lines 173 570) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L140(lines 140 581) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L504(lines 504 510) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L854 garLoopResultBuilder]: At program point L207(lines 203 560) the Hoare annotation is: (let ((.cse0 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse7 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse6 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse7 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse7) .cse6))) [2022-01-09 23:27:25,388 INFO L854 garLoopResultBuilder]: At program point L174(lines 170 571) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496)))) (or (and .cse0 .cse1 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse2 .cse3 .cse4 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3 .cse4))) [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L440(lines 440 443) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L341(lines 341 379) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L209(lines 209 558) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L176(lines 176 569) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L143(lines 143 580) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L854 garLoopResultBuilder]: At program point L110-2(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L507(lines 507 509) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L507-2(lines 219 553) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L854 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-01-09 23:27:25,388 INFO L858 garLoopResultBuilder]: For program point L243(lines 243 246) no Hoare annotation was computed. [2022-01-09 23:27:25,388 INFO L854 garLoopResultBuilder]: At program point L177(lines 176 569) the Hoare annotation is: (let ((.cse6 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse7 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse3 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|)) (.cse1 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640) .cse0 .cse1 (not .cse2)) (and .cse0 .cse3 .cse2 .cse1 .cse4) (and .cse5 .cse0 .cse6 .cse1 .cse7) (and (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse3 .cse2 .cse1) (and (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse0 .cse6 .cse2 .cse1 .cse7) (and .cse0 .cse6 .cse1 .cse7 .cse4) (and .cse5 .cse0 .cse3 .cse2 .cse1))) [2022-01-09 23:27:25,389 INFO L854 garLoopResultBuilder]: At program point L144(lines 137 582) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse6 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse7 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse9 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse10 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse10) (and .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse5 .cse6 .cse7 .cse8 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse9 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L541(lines 541 547) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L344(lines 344 378) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L344-1(lines 344 378) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L212(lines 212 557) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L179(lines 179 568) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 579) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 590) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L477(lines 477 479) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L411(lines 411 413) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L345(lines 345 375) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L854 garLoopResultBuilder]: At program point L213(lines 209 558) the Hoare annotation is: (let ((.cse1 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse0 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse2 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (or (and .cse0 .cse1 .cse2 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (and .cse0 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (and .cse0 .cse1 .cse2 (not .cse3)) (and .cse0 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse2 .cse3))) [2022-01-09 23:27:25,389 INFO L854 garLoopResultBuilder]: At program point L114(lines 113 590) the Hoare annotation is: false [2022-01-09 23:27:25,389 INFO L861 garLoopResultBuilder]: At program point L610(lines 109 611) the Hoare annotation is: true [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L544(lines 544 546) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L215(lines 215 556) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L182(lines 182 567) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L149(lines 149 578) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L116(lines 116 589) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L315(lines 315 322) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L858 garLoopResultBuilder]: For program point L315-2(lines 315 322) no Hoare annotation was computed. [2022-01-09 23:27:25,389 INFO L854 garLoopResultBuilder]: At program point L216(lines 215 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-01-09 23:27:25,389 INFO L854 garLoopResultBuilder]: At program point L183(lines 179 568) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-01-09 23:27:25,390 INFO L854 garLoopResultBuilder]: At program point L150(lines 146 579) the Hoare annotation is: (let ((.cse0 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse7 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse8 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse13 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse14 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12 .cse13 .cse14) (and (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse14))) [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L350(lines 350 373) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L854 garLoopResultBuilder]: At program point L218(lines 217 556) the Hoare annotation is: (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L185(lines 185 566) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L152(lines 152 577) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 588) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L615(lines 615 617) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L615-2(lines 615 617) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L516(lines 516 519) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L285(lines 285 287) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L285-2(lines 219 553) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L451(lines 451 453) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L319(lines 319 321) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L353(lines 353 357) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L353-2(lines 353 357) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L254(lines 254 264) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L188(lines 188 565) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L155(lines 155 576) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 587) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L486(lines 486 488) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L387(lines 387 419) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L858 garLoopResultBuilder]: For program point L255(lines 255 258) no Hoare annotation was computed. [2022-01-09 23:27:25,390 INFO L854 garLoopResultBuilder]: At program point L222(lines 116 589) the Hoare annotation is: false [2022-01-09 23:27:25,391 INFO L854 garLoopResultBuilder]: At program point L189(lines 185 566) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-01-09 23:27:25,391 INFO L854 garLoopResultBuilder]: At program point L156(lines 152 577) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L454(lines 454 463) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L388(lines 388 394) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L861 garLoopResultBuilder]: At program point L620(lines 22 622) the Hoare annotation is: true [2022-01-09 23:27:25,391 INFO L854 garLoopResultBuilder]: At program point L554(lines 110 609) the Hoare annotation is: (let ((.cse6 (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse25 (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse19 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|))) (let ((.cse0 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8640)) (.cse18 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse26 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse4 (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse31 (<= 8672 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse30 (= 3 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse3 (not .cse19)) (.cse20 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672)) (.cse21 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse15 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576)) (.cse22 (< 8496 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse23 (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576)) (.cse7 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0)) (.cse1 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8448)) (.cse28 (= 3 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|)) (.cse2 (<= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)) (.cse12 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1)) (.cse8 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse24 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|)) (.cse13 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8640)) (.cse16 (not (= 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse29 (not .cse25)) (.cse27 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 3)) (.cse14 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse17 (not .cse6))) (or (and (<= 8640 |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1|) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse5 .cse3) (and .cse6 .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse2 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse14 .cse2 .cse7 .cse17) (and .cse18 .cse12 .cse4 .cse19 .cse20) (and .cse21 .cse22 .cse23 .cse7 .cse15) (and .cse8 .cse9 .cse10 .cse11 .cse24 (< |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8576) .cse13 .cse14 .cse19 .cse2 .cse23) (and .cse24 .cse19 .cse25) (and .cse24 .cse18 .cse26 .cse4 .cse23 .cse20) (and .cse0 .cse27) (and .cse1 .cse28 .cse19 .cse2 .cse7) (and .cse12 .cse1 .cse22 .cse2 .cse23) (and .cse18 .cse4 .cse7 .cse20) (and .cse24 .cse18 .cse26 .cse4 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse21 .cse14) (and (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8528) .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse30 .cse1 .cse28 .cse19 .cse2) (and .cse24 .cse1 .cse22 .cse19 .cse2 .cse23) (and .cse31 .cse30 .cse23 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse24 (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8512) .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse17) (and .cse31 .cse30 .cse3 .cse20) (and .cse8 .cse9 .cse10 .cse11 .cse13 .cse5 .cse16 .cse27 .cse14 .cse7 .cse17) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse21 .cse14 .cse19 .cse23 .cse17) (and .cse12 .cse21 .cse22 .cse23 .cse15) (and .cse24 (< 8496 |ULTIMATE.start_ssl3_accept_~s__state~0#1|) .cse22 .cse19 .cse23 .cse15) (and .cse24 .cse6 .cse19) (and .cse1 .cse22 .cse2 .cse23 .cse7) (and .cse12 .cse1 .cse28 .cse19 .cse2) (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse5 .cse27 .cse14) (and .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse5 .cse16 .cse29 .cse27 .cse14 .cse17)))) [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 564) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L158(lines 158 575) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L125(lines 125 586) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L489-2(lines 489 493) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L93(lines 93 99) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L524(lines 524 526) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L458(lines 458 460) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L227(lines 227 229) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L194(lines 194 563) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L161(lines 161 574) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L227-2(lines 227 229) no Hoare annotation was computed. [2022-01-09 23:27:25,391 INFO L858 garLoopResultBuilder]: For program point L128(lines 128 585) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L591(lines 591 607) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L854 garLoopResultBuilder]: At program point L525(lines 83 621) the Hoare annotation is: false [2022-01-09 23:27:25,392 INFO L854 garLoopResultBuilder]: At program point L195(lines 191 564) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse2 (not (<= 8640 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) (<= |ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~0#1| 8576) .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6))) [2022-01-09 23:27:25,392 INFO L854 garLoopResultBuilder]: At program point L162(lines 158 575) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L96(lines 96 98) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L592(lines 592 606) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L361(lines 361 369) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L593(lines 593 598) no Hoare annotation was computed. [2022-01-09 23:27:25,392 INFO L858 garLoopResultBuilder]: For program point L527(lines 527 529) no Hoare annotation was computed. [2022-01-09 23:27:25,395 INFO L858 garLoopResultBuilder]: For program point L593-2(lines 592 606) no Hoare annotation was computed. [2022-01-09 23:27:25,395 INFO L854 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse2 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8545))) (.cse3 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse4 (not (= 8544 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse5 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse6 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse6) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse3 .cse4 .cse5 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse6))) [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L197(lines 197 562) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L164(lines 164 573) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L131(lines 131 584) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L429(lines 429 431) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L854 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (let ((.cse0 (not (<= 8576 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse1 (not (= 8673 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse2 (not (= 8448 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse3 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8561))) (.cse4 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8481))) (.cse5 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8657))) (.cse6 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8672))) (.cse7 (not (= 8497 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse8 (not (= 12292 |ULTIMATE.start_ssl3_accept_~s__state~0#1|))) (.cse9 (not (<= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8496))) (.cse10 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8480))) (.cse11 (not (= |ULTIMATE.start_ssl3_accept_~s__state~0#1| 8656))) (.cse12 (not (= 8560 |ULTIMATE.start_ssl3_accept_~s__state~0#1|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_ssl3_accept_~blastFlag~0#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= 2 |ULTIMATE.start_ssl3_accept_~blastFlag~0#1|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 |ULTIMATE.start_ssl3_accept_~s__hit~0#1|) .cse12))) [2022-01-09 23:27:25,396 INFO L854 garLoopResultBuilder]: At program point L132(lines 128 585) the Hoare annotation is: false [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L595(lines 595 597) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L364(lines 364 366) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L298(lines 298 300) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L232(lines 232 234) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L298-2(lines 219 553) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L332(lines 332 336) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L332-2(lines 219 553) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L200(lines 200 561) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L167(lines 167 572) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L134(lines 134 583) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2022-01-09 23:27:25,396 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 83 621) no Hoare annotation was computed. [2022-01-09 23:27:25,399 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:27:25,400 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-09 23:27:25,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:27:25 BoogieIcfgContainer [2022-01-09 23:27:25,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-09 23:27:25,489 INFO L158 Benchmark]: Toolchain (without parser) took 27311.51ms. Allocated memory was 167.8MB in the beginning and 591.4MB in the end (delta: 423.6MB). Free memory was 114.7MB in the beginning and 299.5MB in the end (delta: -184.8MB). Peak memory consumption was 351.8MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,489 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:27:25,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.41ms. Allocated memory was 167.8MB in the beginning and 223.3MB in the end (delta: 55.6MB). Free memory was 114.5MB in the beginning and 194.8MB in the end (delta: -80.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,490 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.00ms. Allocated memory is still 223.3MB. Free memory was 194.8MB in the beginning and 191.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,490 INFO L158 Benchmark]: Boogie Preprocessor took 27.89ms. Allocated memory is still 223.3MB. Free memory was 191.7MB in the beginning and 190.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,490 INFO L158 Benchmark]: RCFGBuilder took 562.87ms. Allocated memory is still 223.3MB. Free memory was 189.6MB in the beginning and 156.5MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,490 INFO L158 Benchmark]: TraceAbstraction took 26421.79ms. Allocated memory was 223.3MB in the beginning and 591.4MB in the end (delta: 368.1MB). Free memory was 156.1MB in the beginning and 299.5MB in the end (delta: -143.4MB). Peak memory consumption was 338.4MB. Max. memory is 8.0GB. [2022-01-09 23:27:25,491 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 132.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.41ms. Allocated memory was 167.8MB in the beginning and 223.3MB in the end (delta: 55.6MB). Free memory was 114.5MB in the beginning and 194.8MB in the end (delta: -80.4MB). Peak memory consumption was 6.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.00ms. Allocated memory is still 223.3MB. Free memory was 194.8MB in the beginning and 191.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.89ms. Allocated memory is still 223.3MB. Free memory was 191.7MB in the beginning and 190.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 562.87ms. Allocated memory is still 223.3MB. Free memory was 189.6MB in the beginning and 156.5MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * TraceAbstraction took 26421.79ms. Allocated memory was 223.3MB in the beginning and 591.4MB in the end (delta: 368.1MB). Free memory was 156.1MB in the beginning and 299.5MB in the end (delta: -143.4MB). Peak memory consumption was 338.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 619]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.3s, OverallIterations: 34, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 13.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4953 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4953 mSDsluCounter, 10153 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3407 mSDsCounter, 1020 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4114 IncrementalHoareTripleChecker+Invalid, 5134 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1020 mSolverCounterUnsat, 6746 mSDtfsCounter, 4114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3496 GetRequests, 3436 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4524occurred in iteration=27, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 6551 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 28 LocationsWithAnnotation, 28 PreInvPairs, 235 NumberOfFragments, 3584 HoareAnnotationTreeSize, 28 FomulaSimplifications, 59890 FormulaSimplificationTreeSizeReduction, 5.5s HoareSimplificationTime, 28 FomulaSimplificationsInter, 208853 FormulaSimplificationTreeSizeReductionInter, 8.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 8782 NumberOfCodeBlocks, 8782 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10232 ConstructedInterpolants, 0 QuantifiedInterpolants, 14466 SizeOfPredicates, 4 NumberOfNonLiveVariables, 3095 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 43 InterpolantComputations, 30 PerfectInterpolantSequences, 34894/35202 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: (((((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) || (((((((!(8448 == s__state) && !(s__state == 8481)) && blastFlag == 1) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && 0 == s__hit) && s__state <= 8672)) || ((((((!(8448 == s__state) && !(s__state == 8481)) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && blastFlag == 0) && s__state <= 8672)) || (((((((!(8448 == s__state) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8672)) && 8640 <= s__state) && !(s__state == 8480)) && !(0 == s__hit)) && s__state <= 8672) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((((((!(8576 <= s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && !(8560 == s__state)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: !(s__state == 8672) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: (((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && blastFlag == 0) && !(8560 == s__state)) || (((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && !(8560 == s__state))) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8481)) && 2 == blastFlag) && !(s__state == 8657)) && !(s__state == 8672)) && !(8497 == s__state)) && !(12292 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: (((((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && s__s3__tmp__next_state___0 <= 8576) || ((8672 <= s__state && !(12292 == s__state)) && blastFlag == 0)) || (((8672 <= s__state && 3 == blastFlag) && !(12292 == s__state)) && !(0 == s__hit))) || (((8672 <= s__state && blastFlag == 1) && !(12292 == s__state)) && 0 == s__hit) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: (((((((!(8576 <= s__state) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) || (((((!(8576 <= s__state) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0)) || (((((!(8576 <= s__state) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || (((((((!(s__state == 8561) && !(s__state == 8545)) && !(8640 <= s__state)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: (((((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state)) || ((((((((((((((!(8576 <= s__state) && !(8673 == s__state)) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(s__state == 8657)) && blastFlag == 1) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && !(8560 == s__state))) || (((((((((((((((!(8673 == s__state) && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && s__state < 8576) && !(s__state == 8657)) && !(s__state == 8672)) && !(8544 == s__state)) && !(12292 == s__state)) && !(s__state == 8480)) && !(s__state == 8656)) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && !(8560 == s__state)) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((((((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit)) || ((8640 <= s__state && s__state < 8656) && blastFlag == 0)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && !(0 == s__hit))) || ((blastFlag == 1 && 8640 <= s__state) && s__state < 8656)) || (((2 == blastFlag && 8640 <= s__state) && s__state < 8656) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && blastFlag == 1) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(8560 == s__state)) || (((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && blastFlag == 0) && !(8560 == s__state))) || ((((((((!(8576 <= s__state) && !(s__state == 8561)) && !(s__state == 8545)) && 2 == blastFlag) && !(8497 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && 0 == s__hit) && !(8560 == s__state)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((8640 <= s__s3__tmp__next_state___0 && s__s3__tmp__next_state___0 <= 8640) && s__state <= 8448) && 8448 <= s__state) && !(0 == s__hit)) || (((s__s3__tmp__next_state___0 <= 8640 && 8640 <= s__state) && s__state <= 8640) && !(0 == s__hit))) || (8560 == s__state && blastFlag == 0)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(s__state == 8480)) && 8448 <= s__state) && blastFlag == 0) && !(8560 == s__state))) || ((((!(s__state == 8657) && blastFlag == 1) && 8640 <= s__state) && 0 == s__hit) && s__state <= 8672)) || ((((!(s__state <= 8496) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0) && s__state <= 8576)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state < 8576) && !(8497 == s__state)) && !(s__state == 8480)) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((2 == blastFlag && 0 == s__hit) && 8544 == s__state)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (s__s3__tmp__next_state___0 <= 8640 && s__state == 3)) || ((((s__state <= 8448 && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((!(s__state == 8657) && 8640 <= s__state) && blastFlag == 0) && s__state <= 8672)) || (((((2 == blastFlag && !(s__state == 8657)) && !(s__state == 8672)) && 8640 <= s__state) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && !(s__state <= 8496)) && !(s__state == 8480))) || (((((((((((((s__state == 8528 && !(8448 == s__state)) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || ((((3 == blastFlag && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || (((((2 == blastFlag && s__state <= 8448) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576)) || (((8672 <= s__state && 3 == blastFlag) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && s__state == 8512) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && !(8560 == s__state))) || (((8672 <= s__state && 3 == blastFlag) && !(0 == s__hit)) && s__state <= 8672)) || ((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && s__state == 3) && !(s__state == 8480)) && blastFlag == 0) && !(8560 == s__state))) || (((((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && !(s__state <= 8496)) && !(s__state == 8480)) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && !(8560 == s__state))) || ((((blastFlag == 1 && !(s__state <= 8496)) && 8496 < s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || (((((2 == blastFlag && 8496 < s__state) && 8496 < s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8576)) || ((2 == blastFlag && 8560 == s__state) && 0 == s__hit)) || ((((s__state <= 8448 && 8496 < s__s3__tmp__next_state___0) && 8448 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && blastFlag == 0)) || ((((blastFlag == 1 && s__state <= 8448) && 3 == s__s3__tmp__next_state___0) && 0 == s__hit) && 8448 <= s__state)) || ((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && blastFlag == 1) && !(8497 == s__state)) && s__state <= 8640) && s__state == 3) && !(s__state == 8480))) || (((((((((((!(8448 == s__state) && !(s__state == 8561)) && !(s__state == 8545)) && !(s__state == 8481)) && 2 == blastFlag) && !(8497 == s__state)) && s__state <= 8640) && !(8496 == s__state)) && !(8544 == s__state)) && s__state == 3) && !(s__state == 8480)) && !(8560 == s__state)) RESULT: Ultimate proved your program to be correct! [2022-01-09 23:27:25,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...