java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:04:27,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:04:27,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:04:27,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:04:27,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:04:27,258 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:04:27,260 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:04:27,262 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:04:27,264 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:04:27,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:04:27,266 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:04:27,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:04:27,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:04:27,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:04:27,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:04:27,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:04:27,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:04:27,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:04:27,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:04:27,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:04:27,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:04:27,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:04:27,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:04:27,286 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:04:27,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:04:27,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:04:27,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:04:27,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:04:27,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:04:27,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:04:27,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:04:27,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:04:27,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:04:27,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:04:27,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:04:27,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:04:27,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:04:27,305 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:04:27,305 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:04:27,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:04:27,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:04:27,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-16 17:04:27,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:04:27,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:04:27,335 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:04:27,336 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:04:27,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:04:27,337 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:04:27,337 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:04:27,337 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:04:27,337 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:04:27,337 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:04:27,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:04:27,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:04:27,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:04:27,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:04:27,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:04:27,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:04:27,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:04:27,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:04:27,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:04:27,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:04:27,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:04:27,342 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:04:27,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:04:27,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:27,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:04:27,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:04:27,344 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:04:27,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:04:27,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:04:27,344 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:04:27,391 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:04:27,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:04:27,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:04:27,410 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:04:27,410 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:04:27,411 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-09-16 17:04:27,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3844dad/57db528e839c48989119bd8ed7ecfdbe/FLAG44336d014 [2019-09-16 17:04:28,005 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:04:28,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_1.cil-1.c [2019-09-16 17:04:28,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3844dad/57db528e839c48989119bd8ed7ecfdbe/FLAG44336d014 [2019-09-16 17:04:28,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f3844dad/57db528e839c48989119bd8ed7ecfdbe [2019-09-16 17:04:28,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:04:28,359 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:04:28,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:28,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:04:28,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:04:28,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@142c7701 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28, skipping insertion in model container [2019-09-16 17:04:28,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,377 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:04:28,429 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:04:28,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:28,786 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:04:28,848 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:04:28,862 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:04:28,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28 WrapperNode [2019-09-16 17:04:28,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:04:28,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:04:28,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:04:28,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:04:28,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,899 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... [2019-09-16 17:04:28,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:04:28,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:04:28,922 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:04:28,922 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:04:28,923 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:04:28,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:04:28,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:04:28,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-09-16 17:04:28,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:04:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:04:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-16 17:04:28,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:04:28,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:04:29,168 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:04:29,713 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-09-16 17:04:29,713 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-09-16 17:04:29,731 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:04:29,731 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-16 17:04:29,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:29 BoogieIcfgContainer [2019-09-16 17:04:29,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:04:29,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:04:29,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:04:29,738 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:04:29,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:04:28" (1/3) ... [2019-09-16 17:04:29,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:29, skipping insertion in model container [2019-09-16 17:04:29,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:04:28" (2/3) ... [2019-09-16 17:04:29,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eed5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:04:29, skipping insertion in model container [2019-09-16 17:04:29,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:04:29" (3/3) ... [2019-09-16 17:04:29,745 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-1.c [2019-09-16 17:04:29,757 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:04:29,769 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:04:29,788 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:04:29,825 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:04:29,825 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:04:29,826 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:04:29,826 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:04:29,826 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:04:29,826 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:04:29,826 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:04:29,827 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:04:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-09-16 17:04:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-16 17:04:29,859 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:29,861 INFO L407 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] [2019-09-16 17:04:29,863 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:29,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:29,869 INFO L82 PathProgramCache]: Analyzing trace with hash 173381458, now seen corresponding path program 1 times [2019-09-16 17:04:29,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:29,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:30,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:30,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:30,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:30,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:30,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:30,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:30,167 INFO L87 Difference]: Start difference. First operand 135 states. Second operand 3 states. [2019-09-16 17:04:30,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:30,305 INFO L93 Difference]: Finished difference Result 251 states and 414 transitions. [2019-09-16 17:04:30,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:30,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-16 17:04:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:30,323 INFO L225 Difference]: With dead ends: 251 [2019-09-16 17:04:30,323 INFO L226 Difference]: Without dead ends: 218 [2019-09-16 17:04:30,325 INFO L636 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 [2019-09-16 17:04:30,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-16 17:04:30,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2019-09-16 17:04:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-16 17:04:30,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 324 transitions. [2019-09-16 17:04:30,445 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 324 transitions. Word has length 29 [2019-09-16 17:04:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:30,448 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 324 transitions. [2019-09-16 17:04:30,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 324 transitions. [2019-09-16 17:04:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-09-16 17:04:30,454 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:30,454 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-16 17:04:30,454 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:30,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:30,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1098410427, now seen corresponding path program 1 times [2019-09-16 17:04:30,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:30,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:04:30,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:30,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:30,586 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:30,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:30,589 INFO L87 Difference]: Start difference. First operand 218 states and 324 transitions. Second operand 3 states. [2019-09-16 17:04:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:30,848 INFO L93 Difference]: Finished difference Result 260 states and 379 transitions. [2019-09-16 17:04:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:30,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-09-16 17:04:30,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:30,853 INFO L225 Difference]: With dead ends: 260 [2019-09-16 17:04:30,856 INFO L226 Difference]: Without dead ends: 260 [2019-09-16 17:04:30,858 INFO L636 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 [2019-09-16 17:04:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-09-16 17:04:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 252. [2019-09-16 17:04:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-16 17:04:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 368 transitions. [2019-09-16 17:04:30,889 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 368 transitions. Word has length 43 [2019-09-16 17:04:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:30,890 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 368 transitions. [2019-09-16 17:04:30,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 368 transitions. [2019-09-16 17:04:30,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 17:04:30,897 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:30,898 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-16 17:04:30,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1578256893, now seen corresponding path program 1 times [2019-09-16 17:04:30,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:30,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:30,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:30,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:31,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:31,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:31,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:31,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:31,032 INFO L87 Difference]: Start difference. First operand 252 states and 368 transitions. Second operand 3 states. [2019-09-16 17:04:31,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,268 INFO L93 Difference]: Finished difference Result 354 states and 492 transitions. [2019-09-16 17:04:31,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:31,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-16 17:04:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,275 INFO L225 Difference]: With dead ends: 354 [2019-09-16 17:04:31,276 INFO L226 Difference]: Without dead ends: 352 [2019-09-16 17:04:31,276 INFO L636 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 [2019-09-16 17:04:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-16 17:04:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 334. [2019-09-16 17:04:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-09-16 17:04:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 468 transitions. [2019-09-16 17:04:31,311 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 468 transitions. Word has length 60 [2019-09-16 17:04:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,312 INFO L475 AbstractCegarLoop]: Abstraction has 334 states and 468 transitions. [2019-09-16 17:04:31,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 468 transitions. [2019-09-16 17:04:31,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 17:04:31,320 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,320 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-09-16 17:04:31,320 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,321 INFO L82 PathProgramCache]: Analyzing trace with hash -227181441, now seen corresponding path program 1 times [2019-09-16 17:04:31,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:31,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:31,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:31,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:31,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:31,411 INFO L87 Difference]: Start difference. First operand 334 states and 468 transitions. Second operand 3 states. [2019-09-16 17:04:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,568 INFO L93 Difference]: Finished difference Result 380 states and 527 transitions. [2019-09-16 17:04:31,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:31,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-16 17:04:31,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,574 INFO L225 Difference]: With dead ends: 380 [2019-09-16 17:04:31,574 INFO L226 Difference]: Without dead ends: 380 [2019-09-16 17:04:31,577 INFO L636 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 [2019-09-16 17:04:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-09-16 17:04:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 372. [2019-09-16 17:04:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-09-16 17:04:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2019-09-16 17:04:31,590 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 60 [2019-09-16 17:04:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,591 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2019-09-16 17:04:31,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2019-09-16 17:04:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-16 17:04:31,594 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,594 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,595 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1103223005, now seen corresponding path program 1 times [2019-09-16 17:04:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-16 17:04:31,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:31,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:31,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:31,690 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand 3 states. [2019-09-16 17:04:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:31,911 INFO L93 Difference]: Finished difference Result 478 states and 684 transitions. [2019-09-16 17:04:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:31,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-16 17:04:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:31,918 INFO L225 Difference]: With dead ends: 478 [2019-09-16 17:04:31,919 INFO L226 Difference]: Without dead ends: 476 [2019-09-16 17:04:31,920 INFO L636 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 [2019-09-16 17:04:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-16 17:04:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 450. [2019-09-16 17:04:31,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-16 17:04:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 650 transitions. [2019-09-16 17:04:31,935 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 650 transitions. Word has length 73 [2019-09-16 17:04:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:31,938 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 650 transitions. [2019-09-16 17:04:31,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 650 transitions. [2019-09-16 17:04:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-16 17:04:31,940 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:31,940 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:31,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:31,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:31,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1464237739, now seen corresponding path program 1 times [2019-09-16 17:04:31,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:31,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:31,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-16 17:04:31,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:31,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:31,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:32,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:32,001 INFO L87 Difference]: Start difference. First operand 450 states and 650 transitions. Second operand 3 states. [2019-09-16 17:04:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:32,135 INFO L93 Difference]: Finished difference Result 498 states and 709 transitions. [2019-09-16 17:04:32,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:32,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-16 17:04:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:32,140 INFO L225 Difference]: With dead ends: 498 [2019-09-16 17:04:32,141 INFO L226 Difference]: Without dead ends: 498 [2019-09-16 17:04:32,141 INFO L636 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 [2019-09-16 17:04:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-09-16 17:04:32,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 492. [2019-09-16 17:04:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-09-16 17:04:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 702 transitions. [2019-09-16 17:04:32,159 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 702 transitions. Word has length 76 [2019-09-16 17:04:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:32,162 INFO L475 AbstractCegarLoop]: Abstraction has 492 states and 702 transitions. [2019-09-16 17:04:32,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 702 transitions. [2019-09-16 17:04:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-16 17:04:32,164 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:32,166 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:32,167 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:32,173 INFO L82 PathProgramCache]: Analyzing trace with hash 665980045, now seen corresponding path program 1 times [2019-09-16 17:04:32,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:32,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-16 17:04:32,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:32,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:32,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:32,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:32,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:32,271 INFO L87 Difference]: Start difference. First operand 492 states and 702 transitions. Second operand 3 states. [2019-09-16 17:04:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:32,309 INFO L93 Difference]: Finished difference Result 731 states and 1044 transitions. [2019-09-16 17:04:32,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:32,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-16 17:04:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:32,314 INFO L225 Difference]: With dead ends: 731 [2019-09-16 17:04:32,314 INFO L226 Difference]: Without dead ends: 731 [2019-09-16 17:04:32,314 INFO L636 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 [2019-09-16 17:04:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-09-16 17:04:32,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2019-09-16 17:04:32,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-16 17:04:32,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1044 transitions. [2019-09-16 17:04:32,332 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1044 transitions. Word has length 96 [2019-09-16 17:04:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:32,332 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1044 transitions. [2019-09-16 17:04:32,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1044 transitions. [2019-09-16 17:04:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-16 17:04:32,335 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:32,335 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:32,335 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:32,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:32,336 INFO L82 PathProgramCache]: Analyzing trace with hash -208123337, now seen corresponding path program 1 times [2019-09-16 17:04:32,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:32,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-16 17:04:32,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:32,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:32,412 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:32,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:32,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:32,414 INFO L87 Difference]: Start difference. First operand 731 states and 1044 transitions. Second operand 3 states. [2019-09-16 17:04:32,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:32,459 INFO L93 Difference]: Finished difference Result 970 states and 1388 transitions. [2019-09-16 17:04:32,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:32,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-16 17:04:32,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:32,465 INFO L225 Difference]: With dead ends: 970 [2019-09-16 17:04:32,466 INFO L226 Difference]: Without dead ends: 970 [2019-09-16 17:04:32,466 INFO L636 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 [2019-09-16 17:04:32,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2019-09-16 17:04:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2019-09-16 17:04:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2019-09-16 17:04:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1388 transitions. [2019-09-16 17:04:32,490 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1388 transitions. Word has length 98 [2019-09-16 17:04:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:32,490 INFO L475 AbstractCegarLoop]: Abstraction has 970 states and 1388 transitions. [2019-09-16 17:04:32,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1388 transitions. [2019-09-16 17:04:32,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-16 17:04:32,493 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:32,493 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:32,494 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:32,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:32,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1174534704, now seen corresponding path program 1 times [2019-09-16 17:04:32,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:32,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-16 17:04:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:32,564 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:32,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:32,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:32,565 INFO L87 Difference]: Start difference. First operand 970 states and 1388 transitions. Second operand 3 states. [2019-09-16 17:04:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:32,713 INFO L93 Difference]: Finished difference Result 1076 states and 1514 transitions. [2019-09-16 17:04:32,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:32,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-16 17:04:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:32,720 INFO L225 Difference]: With dead ends: 1076 [2019-09-16 17:04:32,720 INFO L226 Difference]: Without dead ends: 1076 [2019-09-16 17:04:32,721 INFO L636 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 [2019-09-16 17:04:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-09-16 17:04:32,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1062. [2019-09-16 17:04:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1062 states. [2019-09-16 17:04:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1500 transitions. [2019-09-16 17:04:32,746 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1500 transitions. Word has length 123 [2019-09-16 17:04:32,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:32,746 INFO L475 AbstractCegarLoop]: Abstraction has 1062 states and 1500 transitions. [2019-09-16 17:04:32,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1500 transitions. [2019-09-16 17:04:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-16 17:04:32,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:32,750 INFO L407 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:32,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:32,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:32,751 INFO L82 PathProgramCache]: Analyzing trace with hash -176623095, now seen corresponding path program 1 times [2019-09-16 17:04:32,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:32,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:32,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:32,806 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 17:04:32,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:32,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:32,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:32,808 INFO L87 Difference]: Start difference. First operand 1062 states and 1500 transitions. Second operand 3 states. [2019-09-16 17:04:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,035 INFO L93 Difference]: Finished difference Result 1266 states and 1780 transitions. [2019-09-16 17:04:33,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:33,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-16 17:04:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,044 INFO L225 Difference]: With dead ends: 1266 [2019-09-16 17:04:33,044 INFO L226 Difference]: Without dead ends: 1258 [2019-09-16 17:04:33,044 INFO L636 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 [2019-09-16 17:04:33,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2019-09-16 17:04:33,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1218. [2019-09-16 17:04:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-16 17:04:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1724 transitions. [2019-09-16 17:04:33,081 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1724 transitions. Word has length 144 [2019-09-16 17:04:33,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,082 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1724 transitions. [2019-09-16 17:04:33,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:33,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1724 transitions. [2019-09-16 17:04:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 17:04:33,089 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,090 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,090 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash -871418854, now seen corresponding path program 1 times [2019-09-16 17:04:33,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,163 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 17:04:33,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:33,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:33,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:33,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:33,166 INFO L87 Difference]: Start difference. First operand 1218 states and 1724 transitions. Second operand 3 states. [2019-09-16 17:04:33,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,313 INFO L93 Difference]: Finished difference Result 1338 states and 1864 transitions. [2019-09-16 17:04:33,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:33,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-16 17:04:33,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,321 INFO L225 Difference]: With dead ends: 1338 [2019-09-16 17:04:33,322 INFO L226 Difference]: Without dead ends: 1338 [2019-09-16 17:04:33,322 INFO L636 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 [2019-09-16 17:04:33,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2019-09-16 17:04:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2019-09-16 17:04:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-09-16 17:04:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1856 transitions. [2019-09-16 17:04:33,354 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1856 transitions. Word has length 180 [2019-09-16 17:04:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,355 INFO L475 AbstractCegarLoop]: Abstraction has 1330 states and 1856 transitions. [2019-09-16 17:04:33,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:33,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1856 transitions. [2019-09-16 17:04:33,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-16 17:04:33,360 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,360 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,361 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,361 INFO L82 PathProgramCache]: Analyzing trace with hash -310719076, now seen corresponding path program 1 times [2019-09-16 17:04:33,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-16 17:04:33,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:33,446 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:33,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:33,447 INFO L87 Difference]: Start difference. First operand 1330 states and 1856 transitions. Second operand 3 states. [2019-09-16 17:04:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,582 INFO L93 Difference]: Finished difference Result 1466 states and 2016 transitions. [2019-09-16 17:04:33,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:33,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-16 17:04:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,590 INFO L225 Difference]: With dead ends: 1466 [2019-09-16 17:04:33,591 INFO L226 Difference]: Without dead ends: 1466 [2019-09-16 17:04:33,591 INFO L636 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 [2019-09-16 17:04:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2019-09-16 17:04:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1454. [2019-09-16 17:04:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1454 states. [2019-09-16 17:04:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 2000 transitions. [2019-09-16 17:04:33,626 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 2000 transitions. Word has length 180 [2019-09-16 17:04:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,626 INFO L475 AbstractCegarLoop]: Abstraction has 1454 states and 2000 transitions. [2019-09-16 17:04:33,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 2000 transitions. [2019-09-16 17:04:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:04:33,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,632 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,633 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2035334682, now seen corresponding path program 1 times [2019-09-16 17:04:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 308 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2019-09-16 17:04:33,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:33,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:33,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:33,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:33,716 INFO L87 Difference]: Start difference. First operand 1454 states and 2000 transitions. Second operand 3 states. [2019-09-16 17:04:33,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:33,742 INFO L93 Difference]: Finished difference Result 2892 states and 3976 transitions. [2019-09-16 17:04:33,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:33,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-16 17:04:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:33,758 INFO L225 Difference]: With dead ends: 2892 [2019-09-16 17:04:33,758 INFO L226 Difference]: Without dead ends: 2892 [2019-09-16 17:04:33,758 INFO L636 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 [2019-09-16 17:04:33,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2019-09-16 17:04:33,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2890. [2019-09-16 17:04:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2019-09-16 17:04:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 3975 transitions. [2019-09-16 17:04:33,832 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 3975 transitions. Word has length 210 [2019-09-16 17:04:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:33,832 INFO L475 AbstractCegarLoop]: Abstraction has 2890 states and 3975 transitions. [2019-09-16 17:04:33,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 3975 transitions. [2019-09-16 17:04:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:04:33,841 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:33,841 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:33,842 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:33,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932836, now seen corresponding path program 1 times [2019-09-16 17:04:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:33,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:33,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-16 17:04:33,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:33,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:33,967 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:33,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:33,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:33,969 INFO L87 Difference]: Start difference. First operand 2890 states and 3975 transitions. Second operand 3 states. [2019-09-16 17:04:34,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:34,174 INFO L93 Difference]: Finished difference Result 3190 states and 4315 transitions. [2019-09-16 17:04:34,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:34,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-16 17:04:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:34,197 INFO L225 Difference]: With dead ends: 3190 [2019-09-16 17:04:34,197 INFO L226 Difference]: Without dead ends: 3190 [2019-09-16 17:04:34,199 INFO L636 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 [2019-09-16 17:04:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3190 states. [2019-09-16 17:04:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3190 to 3174. [2019-09-16 17:04:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3174 states. [2019-09-16 17:04:34,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3174 states to 3174 states and 4299 transitions. [2019-09-16 17:04:34,293 INFO L78 Accepts]: Start accepts. Automaton has 3174 states and 4299 transitions. Word has length 210 [2019-09-16 17:04:34,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:34,294 INFO L475 AbstractCegarLoop]: Abstraction has 3174 states and 4299 transitions. [2019-09-16 17:04:34,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:34,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3174 states and 4299 transitions. [2019-09-16 17:04:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-16 17:04:34,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:34,307 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:34,307 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:34,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1588238652, now seen corresponding path program 1 times [2019-09-16 17:04:34,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 656 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-16 17:04:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:34,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:34,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:34,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:34,464 INFO L87 Difference]: Start difference. First operand 3174 states and 4299 transitions. Second operand 3 states. [2019-09-16 17:04:34,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:34,654 INFO L93 Difference]: Finished difference Result 3322 states and 4467 transitions. [2019-09-16 17:04:34,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:34,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-16 17:04:34,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:34,671 INFO L225 Difference]: With dead ends: 3322 [2019-09-16 17:04:34,672 INFO L226 Difference]: Without dead ends: 3322 [2019-09-16 17:04:34,672 INFO L636 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 [2019-09-16 17:04:34,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2019-09-16 17:04:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3306. [2019-09-16 17:04:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2019-09-16 17:04:34,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4451 transitions. [2019-09-16 17:04:34,744 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4451 transitions. Word has length 234 [2019-09-16 17:04:34,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:34,745 INFO L475 AbstractCegarLoop]: Abstraction has 3306 states and 4451 transitions. [2019-09-16 17:04:34,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4451 transitions. [2019-09-16 17:04:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-16 17:04:34,809 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:34,809 INFO L407 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:34,810 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -736614694, now seen corresponding path program 1 times [2019-09-16 17:04:34,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:34,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:34,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 17:04:34,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:34,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:34,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:34,909 INFO L87 Difference]: Start difference. First operand 3306 states and 4451 transitions. Second operand 3 states. [2019-09-16 17:04:35,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:35,079 INFO L93 Difference]: Finished difference Result 3706 states and 4923 transitions. [2019-09-16 17:04:35,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:35,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-16 17:04:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:35,096 INFO L225 Difference]: With dead ends: 3706 [2019-09-16 17:04:35,097 INFO L226 Difference]: Without dead ends: 3706 [2019-09-16 17:04:35,097 INFO L636 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 [2019-09-16 17:04:35,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2019-09-16 17:04:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3618. [2019-09-16 17:04:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3618 states. [2019-09-16 17:04:35,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3618 states to 3618 states and 4819 transitions. [2019-09-16 17:04:35,168 INFO L78 Accepts]: Start accepts. Automaton has 3618 states and 4819 transitions. Word has length 245 [2019-09-16 17:04:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:35,169 INFO L475 AbstractCegarLoop]: Abstraction has 3618 states and 4819 transitions. [2019-09-16 17:04:35,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3618 states and 4819 transitions. [2019-09-16 17:04:35,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-16 17:04:35,178 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,179 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,179 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1168177660, now seen corresponding path program 1 times [2019-09-16 17:04:35,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 17:04:35,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:35,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:35,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:35,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:35,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:35,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:35,279 INFO L87 Difference]: Start difference. First operand 3618 states and 4819 transitions. Second operand 3 states. [2019-09-16 17:04:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:35,480 INFO L93 Difference]: Finished difference Result 4026 states and 5267 transitions. [2019-09-16 17:04:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:35,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-09-16 17:04:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:35,506 INFO L225 Difference]: With dead ends: 4026 [2019-09-16 17:04:35,506 INFO L226 Difference]: Without dead ends: 4026 [2019-09-16 17:04:35,506 INFO L636 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 [2019-09-16 17:04:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4026 states. [2019-09-16 17:04:35,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4026 to 3738. [2019-09-16 17:04:35,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3738 states. [2019-09-16 17:04:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3738 states to 3738 states and 4963 transitions. [2019-09-16 17:04:35,631 INFO L78 Accepts]: Start accepts. Automaton has 3738 states and 4963 transitions. Word has length 259 [2019-09-16 17:04:35,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:35,632 INFO L475 AbstractCegarLoop]: Abstraction has 3738 states and 4963 transitions. [2019-09-16 17:04:35,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3738 states and 4963 transitions. [2019-09-16 17:04:35,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-09-16 17:04:35,646 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,647 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,647 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1227839833, now seen corresponding path program 1 times [2019-09-16 17:04:35,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:35,791 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2019-09-16 17:04:35,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:35,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:35,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:35,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:35,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:35,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:35,793 INFO L87 Difference]: Start difference. First operand 3738 states and 4963 transitions. Second operand 3 states. [2019-09-16 17:04:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:35,830 INFO L93 Difference]: Finished difference Result 6960 states and 9294 transitions. [2019-09-16 17:04:35,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:35,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-09-16 17:04:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:35,847 INFO L225 Difference]: With dead ends: 6960 [2019-09-16 17:04:35,847 INFO L226 Difference]: Without dead ends: 6960 [2019-09-16 17:04:35,847 INFO L636 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 [2019-09-16 17:04:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6960 states. [2019-09-16 17:04:35,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6960 to 6958. [2019-09-16 17:04:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6958 states. [2019-09-16 17:04:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6958 states to 6958 states and 9293 transitions. [2019-09-16 17:04:35,964 INFO L78 Accepts]: Start accepts. Automaton has 6958 states and 9293 transitions. Word has length 260 [2019-09-16 17:04:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:35,965 INFO L475 AbstractCegarLoop]: Abstraction has 6958 states and 9293 transitions. [2019-09-16 17:04:35,965 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 6958 states and 9293 transitions. [2019-09-16 17:04:35,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-16 17:04:35,980 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:35,980 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:35,980 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:35,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818967, now seen corresponding path program 1 times [2019-09-16 17:04:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:35,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:35,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2019-09-16 17:04:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:36,128 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:36,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:36,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:36,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:36,131 INFO L87 Difference]: Start difference. First operand 6958 states and 9293 transitions. Second operand 3 states. [2019-09-16 17:04:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:36,295 INFO L93 Difference]: Finished difference Result 6966 states and 9109 transitions. [2019-09-16 17:04:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:36,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-09-16 17:04:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:36,313 INFO L225 Difference]: With dead ends: 6966 [2019-09-16 17:04:36,313 INFO L226 Difference]: Without dead ends: 6966 [2019-09-16 17:04:36,313 INFO L636 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 [2019-09-16 17:04:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-09-16 17:04:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6934. [2019-09-16 17:04:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6934 states. [2019-09-16 17:04:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6934 states to 6934 states and 9077 transitions. [2019-09-16 17:04:36,450 INFO L78 Accepts]: Start accepts. Automaton has 6934 states and 9077 transitions. Word has length 261 [2019-09-16 17:04:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:36,451 INFO L475 AbstractCegarLoop]: Abstraction has 6934 states and 9077 transitions. [2019-09-16 17:04:36,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 6934 states and 9077 transitions. [2019-09-16 17:04:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-16 17:04:36,468 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:36,469 INFO L407 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:36,469 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:36,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,469 INFO L82 PathProgramCache]: Analyzing trace with hash 747649846, now seen corresponding path program 1 times [2019-09-16 17:04:36,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:36,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:36,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 318 proven. 18 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2019-09-16 17:04:36,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:36,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:36,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2019-09-16 17:04:36,591 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-09-16 17:04:36,642 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:36,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:36,771 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-16 17:04:36,773 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 81 root evaluator evaluations with a maximum evaluation depth of 5. Performed 81 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 102 variables. [2019-09-16 17:04:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:36,778 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-16 17:04:37,025 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 76.51% of their original sizes. [2019-09-16 17:04:37,025 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-16 17:04:37,221 INFO L420 sIntCurrentIteration]: We unified 283 AI predicates to 283 [2019-09-16 17:04:37,222 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-16 17:04:37,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:04:37,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2019-09-16 17:04:37,224 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:37,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 17:04:37,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 17:04:37,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-09-16 17:04:37,225 INFO L87 Difference]: Start difference. First operand 6934 states and 9077 transitions. Second operand 13 states. [2019-09-16 17:04:38,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:38,109 INFO L93 Difference]: Finished difference Result 6938 states and 9081 transitions. [2019-09-16 17:04:38,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:38,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 284 [2019-09-16 17:04:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:38,122 INFO L225 Difference]: With dead ends: 6938 [2019-09-16 17:04:38,122 INFO L226 Difference]: Without dead ends: 6938 [2019-09-16 17:04:38,123 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-09-16 17:04:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6938 states. [2019-09-16 17:04:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6938 to 6937. [2019-09-16 17:04:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6937 states. [2019-09-16 17:04:38,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6937 states to 6937 states and 9080 transitions. [2019-09-16 17:04:38,232 INFO L78 Accepts]: Start accepts. Automaton has 6937 states and 9080 transitions. Word has length 284 [2019-09-16 17:04:38,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:38,233 INFO L475 AbstractCegarLoop]: Abstraction has 6937 states and 9080 transitions. [2019-09-16 17:04:38,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 17:04:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 6937 states and 9080 transitions. [2019-09-16 17:04:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-16 17:04:38,252 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:38,253 INFO L407 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:38,253 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -39333344, now seen corresponding path program 1 times [2019-09-16 17:04:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:38,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:38,397 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-16 17:04:38,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:38,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:38,397 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2019-09-16 17:04:38,398 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [280], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-09-16 17:04:38,402 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:38,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:39,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:04:39,956 INFO L272 AbstractInterpreter]: Visited 107 different actions 1841 times. Merged at 95 different actions 1506 times. Widened at 20 different actions 203 times. Performed 4800 root evaluator evaluations with a maximum evaluation depth of 5. Performed 4800 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 220 fixpoints after 27 different actions. Largest state had 104 variables. [2019-09-16 17:04:39,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:39,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:04:39,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:39,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-16 17:04:39,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:39,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:40,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:04:40,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:40,201 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-16 17:04:40,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 328 proven. 18 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-16 17:04:40,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:40,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-16 17:04:40,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:40,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:40,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:40,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:40,338 INFO L87 Difference]: Start difference. First operand 6937 states and 9080 transitions. Second operand 4 states. [2019-09-16 17:04:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:40,725 INFO L93 Difference]: Finished difference Result 10415 states and 13403 transitions. [2019-09-16 17:04:40,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:04:40,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-09-16 17:04:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:40,747 INFO L225 Difference]: With dead ends: 10415 [2019-09-16 17:04:40,748 INFO L226 Difference]: Without dead ends: 10407 [2019-09-16 17:04:40,748 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10407 states. [2019-09-16 17:04:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10407 to 8841. [2019-09-16 17:04:40,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8841 states. [2019-09-16 17:04:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8841 states to 8841 states and 11578 transitions. [2019-09-16 17:04:40,913 INFO L78 Accepts]: Start accepts. Automaton has 8841 states and 11578 transitions. Word has length 297 [2019-09-16 17:04:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:40,914 INFO L475 AbstractCegarLoop]: Abstraction has 8841 states and 11578 transitions. [2019-09-16 17:04:40,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 8841 states and 11578 transitions. [2019-09-16 17:04:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-16 17:04:40,934 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:40,935 INFO L407 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:40,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:40,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:40,935 INFO L82 PathProgramCache]: Analyzing trace with hash 280748442, now seen corresponding path program 2 times [2019-09-16 17:04:40,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:40,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:40,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 407 proven. 5 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2019-09-16 17:04:41,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:41,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:41,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-16 17:04:41,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-16 17:04:41,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:41,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:41,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-16 17:04:41,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-16 17:04:41,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-16 17:04:41,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 17:04:41,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:04:41,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:41,207 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-09-16 17:04:41,207 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2019-09-16 17:04:41,337 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:04:41,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-16 17:04:41,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:41,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:41,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:41,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:41,339 INFO L87 Difference]: Start difference. First operand 8841 states and 11578 transitions. Second operand 3 states. [2019-09-16 17:04:41,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:41,469 INFO L93 Difference]: Finished difference Result 9273 states and 12154 transitions. [2019-09-16 17:04:41,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:41,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 310 [2019-09-16 17:04:41,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:41,487 INFO L225 Difference]: With dead ends: 9273 [2019-09-16 17:04:41,488 INFO L226 Difference]: Without dead ends: 9273 [2019-09-16 17:04:41,488 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-09-16 17:04:41,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 9201. [2019-09-16 17:04:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9201 states. [2019-09-16 17:04:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9201 states to 9201 states and 12058 transitions. [2019-09-16 17:04:41,595 INFO L78 Accepts]: Start accepts. Automaton has 9201 states and 12058 transitions. Word has length 310 [2019-09-16 17:04:41,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:41,596 INFO L475 AbstractCegarLoop]: Abstraction has 9201 states and 12058 transitions. [2019-09-16 17:04:41,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9201 states and 12058 transitions. [2019-09-16 17:04:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-09-16 17:04:41,614 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:41,615 INFO L407 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:41,615 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:41,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:41,615 INFO L82 PathProgramCache]: Analyzing trace with hash 670685447, now seen corresponding path program 1 times [2019-09-16 17:04:41,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 17:04:41,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:41,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 954 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-16 17:04:41,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:41,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:41,773 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 378 with the following transitions: [2019-09-16 17:04:41,774 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [286], [288], [291], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-09-16 17:04:41,780 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:41,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:43,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:04:43,420 INFO L272 AbstractInterpreter]: Visited 111 different actions 2385 times. Merged at 100 different actions 1906 times. Widened at 21 different actions 238 times. Performed 6226 root evaluator evaluations with a maximum evaluation depth of 5. Performed 6226 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 352 fixpoints after 46 different actions. Largest state had 104 variables. [2019-09-16 17:04:43,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:43,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:04:43,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:43,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:43,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:43,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:43,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:04:43,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-09-16 17:04:43,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1648 backedges. 821 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2019-09-16 17:04:43,939 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-16 17:04:43,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-09-16 17:04:43,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:43,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:43,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:43,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:43,942 INFO L87 Difference]: Start difference. First operand 9201 states and 12058 transitions. Second operand 3 states. [2019-09-16 17:04:43,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:43,983 INFO L93 Difference]: Finished difference Result 13769 states and 18004 transitions. [2019-09-16 17:04:43,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:43,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 377 [2019-09-16 17:04:43,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:44,014 INFO L225 Difference]: With dead ends: 13769 [2019-09-16 17:04:44,015 INFO L226 Difference]: Without dead ends: 13769 [2019-09-16 17:04:44,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:04:44,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13769 states. [2019-09-16 17:04:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13769 to 13769. [2019-09-16 17:04:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13769 states. [2019-09-16 17:04:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13769 states to 13769 states and 18004 transitions. [2019-09-16 17:04:44,224 INFO L78 Accepts]: Start accepts. Automaton has 13769 states and 18004 transitions. Word has length 377 [2019-09-16 17:04:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:44,225 INFO L475 AbstractCegarLoop]: Abstraction has 13769 states and 18004 transitions. [2019-09-16 17:04:44,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:44,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13769 states and 18004 transitions. [2019-09-16 17:04:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-09-16 17:04:44,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:44,250 INFO L407 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:44,251 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:44,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:44,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2068327023, now seen corresponding path program 1 times [2019-09-16 17:04:44,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:44,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:44,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:44,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:44,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-16 17:04:44,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:44,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:44,414 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 380 with the following transitions: [2019-09-16 17:04:44,415 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [250], [256], [259], [264], [267], [269], [275], [280], [282], [288], [291], [293], [299], [301], [303], [306], [308], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [420], [422], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-09-16 17:04:44,425 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:44,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:45,847 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:04:45,848 INFO L272 AbstractInterpreter]: Visited 111 different actions 2298 times. Merged at 99 different actions 1838 times. Widened at 20 different actions 222 times. Performed 5880 root evaluator evaluations with a maximum evaluation depth of 5. Performed 5880 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 331 fixpoints after 42 different actions. Largest state had 104 variables. [2019-09-16 17:04:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:45,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:04:45,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:45,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:45,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:45,875 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:45,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:04:45,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-09-16 17:04:46,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 956 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 17:04:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:46,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-16 17:04:46,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:46,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:46,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:46,186 INFO L87 Difference]: Start difference. First operand 13769 states and 18004 transitions. Second operand 4 states. [2019-09-16 17:04:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:46,578 INFO L93 Difference]: Finished difference Result 17184 states and 22132 transitions. [2019-09-16 17:04:46,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:46,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-09-16 17:04:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:46,619 INFO L225 Difference]: With dead ends: 17184 [2019-09-16 17:04:46,619 INFO L226 Difference]: Without dead ends: 17172 [2019-09-16 17:04:46,619 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 763 GetRequests, 758 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17172 states. [2019-09-16 17:04:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17172 to 14517. [2019-09-16 17:04:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14517 states. [2019-09-16 17:04:46,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14517 states to 14517 states and 18566 transitions. [2019-09-16 17:04:46,834 INFO L78 Accepts]: Start accepts. Automaton has 14517 states and 18566 transitions. Word has length 379 [2019-09-16 17:04:46,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:46,835 INFO L475 AbstractCegarLoop]: Abstraction has 14517 states and 18566 transitions. [2019-09-16 17:04:46,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:46,836 INFO L276 IsEmpty]: Start isEmpty. Operand 14517 states and 18566 transitions. [2019-09-16 17:04:46,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-16 17:04:46,858 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:46,859 INFO L407 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:46,859 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:46,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -725462501, now seen corresponding path program 1 times [2019-09-16 17:04:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:46,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:46,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1971 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-09-16 17:04:47,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:04:47,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:04:47,112 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:04:47,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:04:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:04:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:04:47,114 INFO L87 Difference]: Start difference. First operand 14517 states and 18566 transitions. Second operand 3 states. [2019-09-16 17:04:47,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:47,286 INFO L93 Difference]: Finished difference Result 13251 states and 16445 transitions. [2019-09-16 17:04:47,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:04:47,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-09-16 17:04:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:47,302 INFO L225 Difference]: With dead ends: 13251 [2019-09-16 17:04:47,303 INFO L226 Difference]: Without dead ends: 5532 [2019-09-16 17:04:47,303 INFO L636 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 [2019-09-16 17:04:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-09-16 17:04:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5191. [2019-09-16 17:04:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5191 states. [2019-09-16 17:04:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 6440 transitions. [2019-09-16 17:04:47,376 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 6440 transitions. Word has length 418 [2019-09-16 17:04:47,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:47,376 INFO L475 AbstractCegarLoop]: Abstraction has 5191 states and 6440 transitions. [2019-09-16 17:04:47,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:04:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 6440 transitions. [2019-09-16 17:04:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-16 17:04:47,386 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:04:47,387 INFO L407 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:04:47,387 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:04:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:47,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1911375163, now seen corresponding path program 1 times [2019-09-16 17:04:47,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:04:47,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:47,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:04:47,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:04:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-09-16 17:04:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:47,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-16 17:04:47,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 448 with the following transitions: [2019-09-16 17:04:47,612 INFO L207 CegarAbsIntRunner]: [0], [1], [4], [13], [24], [33], [35], [38], [40], [45], [50], [55], [60], [63], [65], [70], [73], [75], [80], [83], [85], [90], [93], [95], [100], [103], [105], [110], [113], [115], [120], [125], [130], [135], [140], [143], [145], [150], [155], [160], [163], [165], [170], [173], [175], [180], [183], [185], [190], [193], [203], [205], [208], [212], [217], [232], [238], [243], [245], [248], [256], [259], [264], [267], [275], [278], [282], [288], [291], [299], [301], [303], [306], [314], [319], [321], [324], [326], [331], [333], [336], [344], [349], [351], [360], [365], [370], [372], [381], [386], [389], [397], [402], [404], [409], [412], [417], [422], [424], [429], [432], [436], [438], [448], [450], [517], [519], [531], [537], [541], [542], [543], [545] [2019-09-16 17:04:47,615 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-16 17:04:47,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-16 17:04:48,014 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-16 17:04:48,016 INFO L272 AbstractInterpreter]: Visited 113 different actions 628 times. Merged at 98 different actions 449 times. Widened at 15 different actions 19 times. Performed 1635 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1635 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 61 fixpoints after 22 different actions. Largest state had 105 variables. [2019-09-16 17:04:48,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:04:48,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-16 17:04:48,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 17:04:48,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 17:04:48,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:04:48,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-16 17:04:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:04:48,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-16 17:04:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 17:04:48,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [2019-09-16 17:04:48,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-16 17:04:48,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1283 proven. 14 refuted. 0 times theorem prover too weak. 745 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-09-16 17:04:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-16 17:04:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-09-16 17:04:48,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-16 17:04:48,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 17:04:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 17:04:48,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:04:48,578 INFO L87 Difference]: Start difference. First operand 5191 states and 6440 transitions. Second operand 4 states. [2019-09-16 17:04:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:04:48,742 INFO L93 Difference]: Finished difference Result 512 states and 589 transitions. [2019-09-16 17:04:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 17:04:48,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-09-16 17:04:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:04:48,744 INFO L225 Difference]: With dead ends: 512 [2019-09-16 17:04:48,744 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:04:48,745 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:04:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:04:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:04:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:04:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:04:48,746 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 447 [2019-09-16 17:04:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:04:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:04:48,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 17:04:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:04:48,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:04:48,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:04:48 BoogieIcfgContainer [2019-09-16 17:04:48,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:04:48,757 INFO L168 Benchmark]: Toolchain (without parser) took 20396.88 ms. Allocated memory was 132.1 MB in the beginning and 1.1 GB in the end (delta: 966.8 MB). Free memory was 87.8 MB in the beginning and 857.1 MB in the end (delta: -769.3 MB). Peak memory consumption was 197.5 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,758 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,760 INFO L168 Benchmark]: CACSL2BoogieTranslator took 503.71 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.4 MB in the beginning and 172.7 MB in the end (delta: -85.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,760 INFO L168 Benchmark]: Boogie Preprocessor took 57.40 ms. Allocated memory is still 199.8 MB. Free memory was 172.7 MB in the beginning and 169.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,761 INFO L168 Benchmark]: RCFGBuilder took 811.81 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 124.5 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,762 INFO L168 Benchmark]: TraceAbstraction took 19018.74 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 899.2 MB). Free memory was 123.9 MB in the beginning and 857.1 MB in the end (delta: -733.2 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:04:48,765 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory was 106.4 MB in the beginning and 106.2 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 503.71 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 87.4 MB in the beginning and 172.7 MB in the end (delta: -85.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 57.40 ms. Allocated memory is still 199.8 MB. Free memory was 172.7 MB in the beginning and 169.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 811.81 ms. Allocated memory is still 199.8 MB. Free memory was 169.9 MB in the beginning and 124.5 MB in the end (delta: 45.4 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19018.74 ms. Allocated memory was 199.8 MB in the beginning and 1.1 GB in the end (delta: 899.2 MB). Free memory was 123.9 MB in the beginning and 857.1 MB in the end (delta: -733.2 MB). Peak memory consumption was 166.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 543]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 135 locations, 1 error locations. SAFE Result, 18.9s OverallTime, 26 OverallIterations, 18 TraceHistogramMax, 5.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5329 SDtfs, 1846 SDslu, 3099 SDs, 0 SdLazy, 2580 SolverSat, 436 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3986 GetRequests, 3932 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14517occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.2s AbstIntTime, 5 AbstIntIterations, 1 AbstIntStrong, 0.7726100658962848 AbsIntWeakeningRatio, 0.4452296819787986 AbsIntAvgWeakeningVarsNumRemoved, -1.6819787985865724 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 26 MinimizatonAttempts, 5219 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 7163 NumberOfCodeBlocks, 6895 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8937 ConstructedInterpolants, 0 QuantifiedInterpolants, 3878485 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 36 InterpolantComputations, 24 PerfectInterpolantSequences, 30533/30672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...