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_3.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:08:29,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:08:29,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:08:29,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:08:29,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:08:29,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:08:29,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:08:29,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:08:29,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:08:29,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:08:29,685 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:08:29,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:08:29,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:08:29,687 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:08:29,688 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:08:29,689 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:08:29,690 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:08:29,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:08:29,693 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:08:29,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:08:29,696 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:08:29,697 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:08:29,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:08:29,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:08:29,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:08:29,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:08:29,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:08:29,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:08:29,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:08:29,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:08:29,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:08:29,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:08:29,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:08:29,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:08:29,710 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:08:29,710 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:08:29,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:08:29,711 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:08:29,711 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:08:29,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:08:29,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:08:29,715 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-10-03 04:08:29,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:08:29,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:08:29,745 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:08:29,746 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:08:29,747 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:08:29,747 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:08:29,747 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:08:29,748 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:08:29,748 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:08:29,748 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:08:29,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:08:29,750 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:08:29,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:08:29,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:08:29,751 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:08:29,751 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:08:29,751 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:08:29,751 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:08:29,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:08:29,752 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:08:29,752 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:08:29,752 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:08:29,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:08:29,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:08:29,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:08:29,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:08:29,753 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:08:29,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:08:29,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:08:29,754 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:08:29,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:08:29,819 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:08:29,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:08:29,823 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:08:29,823 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:08:29,824 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-03 04:08:29,881 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2ebd2d5/a54c0d6843a64f308f1ade6beca2c723/FLAGdddfebd65 [2019-10-03 04:08:30,285 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:08:30,286 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-1.c [2019-10-03 04:08:30,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2ebd2d5/a54c0d6843a64f308f1ade6beca2c723/FLAGdddfebd65 [2019-10-03 04:08:30,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a2ebd2d5/a54c0d6843a64f308f1ade6beca2c723 [2019-10-03 04:08:30,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:08:30,649 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:08:30,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:08:30,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:08:30,654 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:08:30,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:08:30" (1/1) ... [2019-10-03 04:08:30,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31959f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:30, skipping insertion in model container [2019-10-03 04:08:30,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:08:30" (1/1) ... [2019-10-03 04:08:30,665 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:08:30,724 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:08:30,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:08:30,976 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:08:31,119 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:08:31,133 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:08:31,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31 WrapperNode [2019-10-03 04:08:31,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:08:31,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:08:31,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:08:31,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:08:31,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (1/1) ... [2019-10-03 04:08:31,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:08:31,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:08:31,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:08:31,203 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:08:31,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (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-10-03 04:08:31,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:08:31,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:08:31,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-10-03 04:08:31,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:08:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:08:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:08:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-10-03 04:08:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:08:31,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:08:31,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:08:31,386 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-03 04:08:31,835 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-03 04:08:31,835 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-03 04:08:31,850 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:08:31,851 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 04:08:31,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:08:31 BoogieIcfgContainer [2019-10-03 04:08:31,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:08:31,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:08:31,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:08:31,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:08:31,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:08:30" (1/3) ... [2019-10-03 04:08:31,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765d820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:08:31, skipping insertion in model container [2019-10-03 04:08:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:08:31" (2/3) ... [2019-10-03 04:08:31,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765d820d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:08:31, skipping insertion in model container [2019-10-03 04:08:31,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:08:31" (3/3) ... [2019-10-03 04:08:31,869 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-10-03 04:08:31,879 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:08:31,894 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:08:31,912 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:08:31,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:08:31,944 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:08:31,945 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:08:31,945 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:08:31,945 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:08:31,945 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:08:31,945 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:08:31,946 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:08:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2019-10-03 04:08:31,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-03 04:08:31,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:31,979 INFO L411 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-10-03 04:08:31,981 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:31,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2007307722, now seen corresponding path program 1 times [2019-10-03 04:08:31,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:32,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:08:32,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:32,180 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:32,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:32,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:32,203 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2019-10-03 04:08:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:32,293 INFO L93 Difference]: Finished difference Result 245 states and 408 transitions. [2019-10-03 04:08:32,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:32,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-03 04:08:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:32,308 INFO L225 Difference]: With dead ends: 245 [2019-10-03 04:08:32,310 INFO L226 Difference]: Without dead ends: 214 [2019-10-03 04:08:32,313 INFO L640 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-10-03 04:08:32,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-03 04:08:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2019-10-03 04:08:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-10-03 04:08:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 320 transitions. [2019-10-03 04:08:32,371 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 320 transitions. Word has length 29 [2019-10-03 04:08:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:32,372 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-10-03 04:08:32,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 320 transitions. [2019-10-03 04:08:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-03 04:08:32,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:32,376 INFO L411 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-10-03 04:08:32,376 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1381474291, now seen corresponding path program 1 times [2019-10-03 04:08:32,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:32,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:08:32,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:32,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:32,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:32,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:32,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:32,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:32,455 INFO L87 Difference]: Start difference. First operand 214 states and 320 transitions. Second operand 3 states. [2019-10-03 04:08:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:32,669 INFO L93 Difference]: Finished difference Result 258 states and 378 transitions. [2019-10-03 04:08:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:32,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-03 04:08:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:32,674 INFO L225 Difference]: With dead ends: 258 [2019-10-03 04:08:32,690 INFO L226 Difference]: Without dead ends: 258 [2019-10-03 04:08:32,691 INFO L640 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-10-03 04:08:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-03 04:08:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2019-10-03 04:08:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-10-03 04:08:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 364 transitions. [2019-10-03 04:08:32,727 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 364 transitions. Word has length 43 [2019-10-03 04:08:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:32,728 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 364 transitions. [2019-10-03 04:08:32,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:32,728 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 364 transitions. [2019-10-03 04:08:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:08:32,734 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:32,734 INFO L411 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-10-03 04:08:32,734 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:32,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash 632602009, now seen corresponding path program 1 times [2019-10-03 04:08:32,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:32,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:32,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:32,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:08:32,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:32,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:32,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:32,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:32,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:32,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:32,831 INFO L87 Difference]: Start difference. First operand 248 states and 364 transitions. Second operand 3 states. [2019-10-03 04:08:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,030 INFO L93 Difference]: Finished difference Result 348 states and 486 transitions. [2019-10-03 04:08:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:08:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,036 INFO L225 Difference]: With dead ends: 348 [2019-10-03 04:08:33,036 INFO L226 Difference]: Without dead ends: 346 [2019-10-03 04:08:33,037 INFO L640 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-10-03 04:08:33,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-10-03 04:08:33,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 330. [2019-10-03 04:08:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-10-03 04:08:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 464 transitions. [2019-10-03 04:08:33,073 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 464 transitions. Word has length 60 [2019-10-03 04:08:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,074 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 464 transitions. [2019-10-03 04:08:33,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 464 transitions. [2019-10-03 04:08:33,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-03 04:08:33,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,081 INFO L411 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-10-03 04:08:33,081 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1172836325, now seen corresponding path program 1 times [2019-10-03 04:08:33,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:08:33,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:33,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:33,177 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:33,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:33,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:33,179 INFO L87 Difference]: Start difference. First operand 330 states and 464 transitions. Second operand 3 states. [2019-10-03 04:08:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,317 INFO L93 Difference]: Finished difference Result 376 states and 523 transitions. [2019-10-03 04:08:33,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-10-03 04:08:33,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,320 INFO L225 Difference]: With dead ends: 376 [2019-10-03 04:08:33,320 INFO L226 Difference]: Without dead ends: 376 [2019-10-03 04:08:33,320 INFO L640 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-10-03 04:08:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-10-03 04:08:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 368. [2019-10-03 04:08:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-10-03 04:08:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 512 transitions. [2019-10-03 04:08:33,334 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 512 transitions. Word has length 60 [2019-10-03 04:08:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,334 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 512 transitions. [2019-10-03 04:08:33,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 512 transitions. [2019-10-03 04:08:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-03 04:08:33,337 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,337 INFO L411 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] [2019-10-03 04:08:33,338 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash 244907033, now seen corresponding path program 1 times [2019-10-03 04:08:33,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:33,403 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-03 04:08:33,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:33,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:33,404 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:33,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:33,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:33,405 INFO L87 Difference]: Start difference. First operand 368 states and 512 transitions. Second operand 3 states. [2019-10-03 04:08:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,588 INFO L93 Difference]: Finished difference Result 472 states and 678 transitions. [2019-10-03 04:08:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-10-03 04:08:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,594 INFO L225 Difference]: With dead ends: 472 [2019-10-03 04:08:33,594 INFO L226 Difference]: Without dead ends: 470 [2019-10-03 04:08:33,594 INFO L640 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-10-03 04:08:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-03 04:08:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 446. [2019-10-03 04:08:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-03 04:08:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 646 transitions. [2019-10-03 04:08:33,609 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 646 transitions. Word has length 72 [2019-10-03 04:08:33,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,610 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 646 transitions. [2019-10-03 04:08:33,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 646 transitions. [2019-10-03 04:08:33,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-03 04:08:33,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,612 INFO L411 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-10-03 04:08:33,612 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,613 INFO L82 PathProgramCache]: Analyzing trace with hash -834546447, now seen corresponding path program 1 times [2019-10-03 04:08:33,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-03 04:08:33,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:33,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:33,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:33,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:33,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:33,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:33,677 INFO L87 Difference]: Start difference. First operand 446 states and 646 transitions. Second operand 3 states. [2019-10-03 04:08:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,812 INFO L93 Difference]: Finished difference Result 494 states and 705 transitions. [2019-10-03 04:08:33,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-10-03 04:08:33,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,816 INFO L225 Difference]: With dead ends: 494 [2019-10-03 04:08:33,817 INFO L226 Difference]: Without dead ends: 494 [2019-10-03 04:08:33,817 INFO L640 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-10-03 04:08:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-03 04:08:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2019-10-03 04:08:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-10-03 04:08:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 698 transitions. [2019-10-03 04:08:33,829 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 698 transitions. Word has length 76 [2019-10-03 04:08:33,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,829 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 698 transitions. [2019-10-03 04:08:33,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 698 transitions. [2019-10-03 04:08:33,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-03 04:08:33,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,832 INFO L411 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-10-03 04:08:33,832 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash -532111447, now seen corresponding path program 1 times [2019-10-03 04:08:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:33,892 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-03 04:08:33,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:33,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:33,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:33,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:33,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:33,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:33,895 INFO L87 Difference]: Start difference. First operand 488 states and 698 transitions. Second operand 3 states. [2019-10-03 04:08:33,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:33,930 INFO L93 Difference]: Finished difference Result 725 states and 1038 transitions. [2019-10-03 04:08:33,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:33,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-03 04:08:33,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:33,934 INFO L225 Difference]: With dead ends: 725 [2019-10-03 04:08:33,934 INFO L226 Difference]: Without dead ends: 725 [2019-10-03 04:08:33,935 INFO L640 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-10-03 04:08:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-10-03 04:08:33,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2019-10-03 04:08:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-10-03 04:08:33,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1038 transitions. [2019-10-03 04:08:33,952 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1038 transitions. Word has length 96 [2019-10-03 04:08:33,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:33,952 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 1038 transitions. [2019-10-03 04:08:33,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1038 transitions. [2019-10-03 04:08:33,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-03 04:08:33,962 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:33,963 INFO L411 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-10-03 04:08:33,963 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:33,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:33,963 INFO L82 PathProgramCache]: Analyzing trace with hash 2130642131, now seen corresponding path program 1 times [2019-10-03 04:08:33,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:33,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:33,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-03 04:08:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:34,067 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:34,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:34,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:34,068 INFO L87 Difference]: Start difference. First operand 725 states and 1038 transitions. Second operand 3 states. [2019-10-03 04:08:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:34,100 INFO L93 Difference]: Finished difference Result 962 states and 1380 transitions. [2019-10-03 04:08:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:34,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-10-03 04:08:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:34,105 INFO L225 Difference]: With dead ends: 962 [2019-10-03 04:08:34,105 INFO L226 Difference]: Without dead ends: 962 [2019-10-03 04:08:34,106 INFO L640 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-10-03 04:08:34,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2019-10-03 04:08:34,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2019-10-03 04:08:34,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-10-03 04:08:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2019-10-03 04:08:34,126 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 98 [2019-10-03 04:08:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:34,126 INFO L475 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2019-10-03 04:08:34,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2019-10-03 04:08:34,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-03 04:08:34,130 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:34,130 INFO L411 BasicCegarLoop]: trace histogram [8, 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, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:34,130 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:34,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:34,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1135672730, now seen corresponding path program 1 times [2019-10-03 04:08:34,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:34,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,220 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-03 04:08:34,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:34,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:34,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:34,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:34,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:34,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:34,222 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand 3 states. [2019-10-03 04:08:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:34,408 INFO L93 Difference]: Finished difference Result 1162 states and 1672 transitions. [2019-10-03 04:08:34,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:34,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-03 04:08:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:34,414 INFO L225 Difference]: With dead ends: 1162 [2019-10-03 04:08:34,414 INFO L226 Difference]: Without dead ends: 1154 [2019-10-03 04:08:34,415 INFO L640 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-10-03 04:08:34,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2019-10-03 04:08:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2019-10-03 04:08:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2019-10-03 04:08:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1620 transitions. [2019-10-03 04:08:34,440 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1620 transitions. Word has length 152 [2019-10-03 04:08:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:34,441 INFO L475 AbstractCegarLoop]: Abstraction has 1118 states and 1620 transitions. [2019-10-03 04:08:34,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:34,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1620 transitions. [2019-10-03 04:08:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-03 04:08:34,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:34,445 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:08:34,445 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash -862106901, now seen corresponding path program 1 times [2019-10-03 04:08:34,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:34,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:34,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,511 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-03 04:08:34,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:34,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:34,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:34,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:34,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:34,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:34,513 INFO L87 Difference]: Start difference. First operand 1118 states and 1620 transitions. Second operand 3 states. [2019-10-03 04:08:34,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:34,665 INFO L93 Difference]: Finished difference Result 1224 states and 1746 transitions. [2019-10-03 04:08:34,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:34,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-03 04:08:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:34,677 INFO L225 Difference]: With dead ends: 1224 [2019-10-03 04:08:34,677 INFO L226 Difference]: Without dead ends: 1224 [2019-10-03 04:08:34,677 INFO L640 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-10-03 04:08:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2019-10-03 04:08:34,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1210. [2019-10-03 04:08:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1210 states. [2019-10-03 04:08:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1732 transitions. [2019-10-03 04:08:34,721 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1732 transitions. Word has length 188 [2019-10-03 04:08:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:34,721 INFO L475 AbstractCegarLoop]: Abstraction has 1210 states and 1732 transitions. [2019-10-03 04:08:34,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1732 transitions. [2019-10-03 04:08:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-03 04:08:34,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:34,730 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 7, 7, 5, 5, 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] [2019-10-03 04:08:34,730 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:34,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2139251602, now seen corresponding path program 1 times [2019-10-03 04:08:34,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:34,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:34,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-03 04:08:34,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:34,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:34,831 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:34,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:34,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:34,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:34,832 INFO L87 Difference]: Start difference. First operand 1210 states and 1732 transitions. Second operand 3 states. [2019-10-03 04:08:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:34,982 INFO L93 Difference]: Finished difference Result 1322 states and 1868 transitions. [2019-10-03 04:08:34,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:34,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-10-03 04:08:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:34,989 INFO L225 Difference]: With dead ends: 1322 [2019-10-03 04:08:34,989 INFO L226 Difference]: Without dead ends: 1322 [2019-10-03 04:08:34,991 INFO L640 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-10-03 04:08:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-10-03 04:08:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1310. [2019-10-03 04:08:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-10-03 04:08:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1852 transitions. [2019-10-03 04:08:35,018 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1852 transitions. Word has length 209 [2019-10-03 04:08:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:35,018 INFO L475 AbstractCegarLoop]: Abstraction has 1310 states and 1852 transitions. [2019-10-03 04:08:35,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1852 transitions. [2019-10-03 04:08:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 04:08:35,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:35,023 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:35,023 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:35,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1924345883, now seen corresponding path program 1 times [2019-10-03 04:08:35,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:35,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:35,110 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-03 04:08:35,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:35,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:35,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:35,112 INFO L87 Difference]: Start difference. First operand 1310 states and 1852 transitions. Second operand 3 states. [2019-10-03 04:08:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:35,229 INFO L93 Difference]: Finished difference Result 1430 states and 1992 transitions. [2019-10-03 04:08:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:35,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-03 04:08:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:35,236 INFO L225 Difference]: With dead ends: 1430 [2019-10-03 04:08:35,236 INFO L226 Difference]: Without dead ends: 1430 [2019-10-03 04:08:35,236 INFO L640 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-10-03 04:08:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-10-03 04:08:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1422. [2019-10-03 04:08:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1422 states. [2019-10-03 04:08:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 1984 transitions. [2019-10-03 04:08:35,264 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 1984 transitions. Word has length 233 [2019-10-03 04:08:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:35,265 INFO L475 AbstractCegarLoop]: Abstraction has 1422 states and 1984 transitions. [2019-10-03 04:08:35,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 1984 transitions. [2019-10-03 04:08:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-03 04:08:35,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:35,270 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:35,270 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:35,271 INFO L82 PathProgramCache]: Analyzing trace with hash -643476451, now seen corresponding path program 1 times [2019-10-03 04:08:35,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:35,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:35,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-10-03 04:08:35,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:35,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:35,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:35,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:35,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:35,387 INFO L87 Difference]: Start difference. First operand 1422 states and 1984 transitions. Second operand 3 states. [2019-10-03 04:08:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:35,519 INFO L93 Difference]: Finished difference Result 1558 states and 2144 transitions. [2019-10-03 04:08:35,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:35,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-10-03 04:08:35,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:35,527 INFO L225 Difference]: With dead ends: 1558 [2019-10-03 04:08:35,527 INFO L226 Difference]: Without dead ends: 1558 [2019-10-03 04:08:35,527 INFO L640 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-10-03 04:08:35,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2019-10-03 04:08:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1546. [2019-10-03 04:08:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2019-10-03 04:08:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2128 transitions. [2019-10-03 04:08:35,572 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2128 transitions. Word has length 233 [2019-10-03 04:08:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:35,572 INFO L475 AbstractCegarLoop]: Abstraction has 1546 states and 2128 transitions. [2019-10-03 04:08:35,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2128 transitions. [2019-10-03 04:08:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-03 04:08:35,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:35,578 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:35,581 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:35,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1388986723, now seen corresponding path program 1 times [2019-10-03 04:08:35,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:35,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-10-03 04:08:35,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:35,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:35,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:35,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:35,673 INFO L87 Difference]: Start difference. First operand 1546 states and 2128 transitions. Second operand 3 states. [2019-10-03 04:08:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:35,797 INFO L93 Difference]: Finished difference Result 1698 states and 2300 transitions. [2019-10-03 04:08:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:35,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-03 04:08:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:35,804 INFO L225 Difference]: With dead ends: 1698 [2019-10-03 04:08:35,805 INFO L226 Difference]: Without dead ends: 1698 [2019-10-03 04:08:35,805 INFO L640 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-10-03 04:08:35,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-03 04:08:35,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1690. [2019-10-03 04:08:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1690 states. [2019-10-03 04:08:35,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2292 transitions. [2019-10-03 04:08:35,833 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2292 transitions. Word has length 263 [2019-10-03 04:08:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:35,834 INFO L475 AbstractCegarLoop]: Abstraction has 1690 states and 2292 transitions. [2019-10-03 04:08:35,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2292 transitions. [2019-10-03 04:08:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-03 04:08:35,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:35,840 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:35,840 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:35,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:35,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1178835611, now seen corresponding path program 1 times [2019-10-03 04:08:35,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:35,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:35,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:35,923 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-10-03 04:08:35,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:35,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:35,943 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:35,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:35,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:35,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:35,947 INFO L87 Difference]: Start difference. First operand 1690 states and 2292 transitions. Second operand 3 states. [2019-10-03 04:08:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:35,978 INFO L93 Difference]: Finished difference Result 3360 states and 4556 transitions. [2019-10-03 04:08:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:35,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-10-03 04:08:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:35,998 INFO L225 Difference]: With dead ends: 3360 [2019-10-03 04:08:35,999 INFO L226 Difference]: Without dead ends: 3360 [2019-10-03 04:08:35,999 INFO L640 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-10-03 04:08:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3360 states. [2019-10-03 04:08:36,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3360 to 3358. [2019-10-03 04:08:36,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3358 states. [2019-10-03 04:08:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 4555 transitions. [2019-10-03 04:08:36,086 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 4555 transitions. Word has length 263 [2019-10-03 04:08:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:36,087 INFO L475 AbstractCegarLoop]: Abstraction has 3358 states and 4555 transitions. [2019-10-03 04:08:36,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 4555 transitions. [2019-10-03 04:08:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-03 04:08:36,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:36,103 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:36,103 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 554282629, now seen corresponding path program 1 times [2019-10-03 04:08:36,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:36,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:36,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:36,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:36,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:36,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-03 04:08:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:36,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:36,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:36,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:36,267 INFO L87 Difference]: Start difference. First operand 3358 states and 4555 transitions. Second operand 3 states. [2019-10-03 04:08:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:36,473 INFO L93 Difference]: Finished difference Result 3506 states and 4723 transitions. [2019-10-03 04:08:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:36,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-03 04:08:36,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:36,490 INFO L225 Difference]: With dead ends: 3506 [2019-10-03 04:08:36,490 INFO L226 Difference]: Without dead ends: 3506 [2019-10-03 04:08:36,490 INFO L640 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-10-03 04:08:36,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-10-03 04:08:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3490. [2019-10-03 04:08:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-10-03 04:08:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4707 transitions. [2019-10-03 04:08:36,592 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4707 transitions. Word has length 287 [2019-10-03 04:08:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:36,593 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4707 transitions. [2019-10-03 04:08:36,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4707 transitions. [2019-10-03 04:08:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-03 04:08:36,610 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:36,610 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:36,611 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:36,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:36,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1163110431, now seen corresponding path program 1 times [2019-10-03 04:08:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:36,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:36,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:36,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-03 04:08:36,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:36,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:36,851 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:36,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:36,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:36,853 INFO L87 Difference]: Start difference. First operand 3490 states and 4707 transitions. Second operand 3 states. [2019-10-03 04:08:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:37,043 INFO L93 Difference]: Finished difference Result 3882 states and 5171 transitions. [2019-10-03 04:08:37,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:37,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-10-03 04:08:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:37,060 INFO L225 Difference]: With dead ends: 3882 [2019-10-03 04:08:37,060 INFO L226 Difference]: Without dead ends: 3882 [2019-10-03 04:08:37,061 INFO L640 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-10-03 04:08:37,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2019-10-03 04:08:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3802. [2019-10-03 04:08:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3802 states. [2019-10-03 04:08:37,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3802 states to 3802 states and 5075 transitions. [2019-10-03 04:08:37,127 INFO L78 Accepts]: Start accepts. Automaton has 3802 states and 5075 transitions. Word has length 298 [2019-10-03 04:08:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:37,128 INFO L475 AbstractCegarLoop]: Abstraction has 3802 states and 5075 transitions. [2019-10-03 04:08:37,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:37,128 INFO L276 IsEmpty]: Start isEmpty. Operand 3802 states and 5075 transitions. [2019-10-03 04:08:37,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-03 04:08:37,138 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:37,139 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:37,139 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:37,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:37,140 INFO L82 PathProgramCache]: Analyzing trace with hash -121210371, now seen corresponding path program 1 times [2019-10-03 04:08:37,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:37,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-03 04:08:37,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:37,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:37,239 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:37,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:37,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:37,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:37,240 INFO L87 Difference]: Start difference. First operand 3802 states and 5075 transitions. Second operand 3 states. [2019-10-03 04:08:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:37,408 INFO L93 Difference]: Finished difference Result 4202 states and 5515 transitions. [2019-10-03 04:08:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:37,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-03 04:08:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:37,450 INFO L225 Difference]: With dead ends: 4202 [2019-10-03 04:08:37,450 INFO L226 Difference]: Without dead ends: 4202 [2019-10-03 04:08:37,451 INFO L640 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-10-03 04:08:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2019-10-03 04:08:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 3922. [2019-10-03 04:08:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-03 04:08:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5219 transitions. [2019-10-03 04:08:37,525 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5219 transitions. Word has length 311 [2019-10-03 04:08:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:37,526 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5219 transitions. [2019-10-03 04:08:37,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5219 transitions. [2019-10-03 04:08:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-03 04:08:37,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:37,536 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:37,536 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:37,536 INFO L82 PathProgramCache]: Analyzing trace with hash -828607418, now seen corresponding path program 1 times [2019-10-03 04:08:37,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:37,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:37,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 706 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-10-03 04:08:37,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:37,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:37,732 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:37,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:37,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:37,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:37,734 INFO L87 Difference]: Start difference. First operand 3922 states and 5219 transitions. Second operand 3 states. [2019-10-03 04:08:37,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:37,762 INFO L93 Difference]: Finished difference Result 7328 states and 9806 transitions. [2019-10-03 04:08:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:37,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-03 04:08:37,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:37,778 INFO L225 Difference]: With dead ends: 7328 [2019-10-03 04:08:37,778 INFO L226 Difference]: Without dead ends: 7328 [2019-10-03 04:08:37,779 INFO L640 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-10-03 04:08:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7328 states. [2019-10-03 04:08:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7328 to 7326. [2019-10-03 04:08:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7326 states. [2019-10-03 04:08:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7326 states to 7326 states and 9805 transitions. [2019-10-03 04:08:37,885 INFO L78 Accepts]: Start accepts. Automaton has 7326 states and 9805 transitions. Word has length 312 [2019-10-03 04:08:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:37,886 INFO L475 AbstractCegarLoop]: Abstraction has 7326 states and 9805 transitions. [2019-10-03 04:08:37,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7326 states and 9805 transitions. [2019-10-03 04:08:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-03 04:08:37,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:37,910 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:37,910 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -935849662, now seen corresponding path program 1 times [2019-10-03 04:08:37,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:37,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 710 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-10-03 04:08:38,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:38,069 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:38,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:38,071 INFO L87 Difference]: Start difference. First operand 7326 states and 9805 transitions. Second operand 3 states. [2019-10-03 04:08:38,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:38,286 INFO L93 Difference]: Finished difference Result 7334 states and 9557 transitions. [2019-10-03 04:08:38,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:38,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-10-03 04:08:38,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:38,311 INFO L225 Difference]: With dead ends: 7334 [2019-10-03 04:08:38,311 INFO L226 Difference]: Without dead ends: 7334 [2019-10-03 04:08:38,312 INFO L640 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-10-03 04:08:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-10-03 04:08:38,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 7302. [2019-10-03 04:08:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7302 states. [2019-10-03 04:08:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9525 transitions. [2019-10-03 04:08:38,516 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9525 transitions. Word has length 313 [2019-10-03 04:08:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:38,517 INFO L475 AbstractCegarLoop]: Abstraction has 7302 states and 9525 transitions. [2019-10-03 04:08:38,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9525 transitions. [2019-10-03 04:08:38,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-03 04:08:38,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:38,533 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:38,533 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:38,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:38,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1555626477, now seen corresponding path program 1 times [2019-10-03 04:08:38,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:38,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:38,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:38,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 765 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-10-03 04:08:38,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:38,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:38,657 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 337 with the following transitions: [2019-10-03 04:08:38,659 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], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [290], [292], [295], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:38,703 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:38,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:38,798 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:08:38,799 INFO L272 AbstractInterpreter]: Visited 13 different actions 13 times. Never merged. Never widened. Performed 37 root evaluator evaluations with a maximum evaluation depth of 5. Performed 37 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Never found a fixpoint. Largest state had 69 variables. [2019-10-03 04:08:38,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:38,803 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:08:38,985 INFO L227 lantSequenceWeakener]: Weakened 45 states. On average, predicates are now at 86.9% of their original sizes. [2019-10-03 04:08:38,985 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:08:39,036 INFO L420 sIntCurrentIteration]: We unified 335 AI predicates to 335 [2019-10-03 04:08:39,037 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:08:39,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2019-10-03 04:08:39,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:39,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 04:08:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 04:08:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-03 04:08:39,042 INFO L87 Difference]: Start difference. First operand 7302 states and 9525 transitions. Second operand 8 states. [2019-10-03 04:08:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:39,568 INFO L93 Difference]: Finished difference Result 7306 states and 9529 transitions. [2019-10-03 04:08:39,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:08:39,568 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 336 [2019-10-03 04:08:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:39,580 INFO L225 Difference]: With dead ends: 7306 [2019-10-03 04:08:39,580 INFO L226 Difference]: Without dead ends: 7306 [2019-10-03 04:08:39,580 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-03 04:08:39,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2019-10-03 04:08:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7305. [2019-10-03 04:08:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7305 states. [2019-10-03 04:08:39,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9528 transitions. [2019-10-03 04:08:39,677 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9528 transitions. Word has length 336 [2019-10-03 04:08:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:39,677 INFO L475 AbstractCegarLoop]: Abstraction has 7305 states and 9528 transitions. [2019-10-03 04:08:39,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 04:08:39,678 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9528 transitions. [2019-10-03 04:08:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-03 04:08:39,689 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:39,689 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:39,689 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:39,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash 923098349, now seen corresponding path program 1 times [2019-10-03 04:08:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:39,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-03 04:08:39,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:39,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:39,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 349 with the following transitions: [2019-10-03 04:08:39,927 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], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [290], [292], [295], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:39,931 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:39,931 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:39,940 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:08:41,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:41,297 INFO L272 AbstractInterpreter]: Visited 108 different actions 2263 times. Merged at 98 different actions 1816 times. Widened at 22 different actions 233 times. Performed 5747 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5747 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 324 fixpoints after 32 different actions. Largest state had 69 variables. [2019-10-03 04:08:41,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:41,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:41,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:41,299 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-10-03 04:08:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:41,336 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-10-03 04:08:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:41,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:08:41,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-10-03 04:08:41,640 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-10-03 04:08:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:41,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:08:41,868 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:41,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:41,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:41,869 INFO L87 Difference]: Start difference. First operand 7305 states and 9528 transitions. Second operand 3 states. [2019-10-03 04:08:41,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:41,946 INFO L93 Difference]: Finished difference Result 10933 states and 14232 transitions. [2019-10-03 04:08:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:41,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-10-03 04:08:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:41,965 INFO L225 Difference]: With dead ends: 10933 [2019-10-03 04:08:41,966 INFO L226 Difference]: Without dead ends: 10933 [2019-10-03 04:08:41,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 695 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10933 states. [2019-10-03 04:08:42,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10933 to 10933. [2019-10-03 04:08:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2019-10-03 04:08:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 14232 transitions. [2019-10-03 04:08:42,207 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 14232 transitions. Word has length 348 [2019-10-03 04:08:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:42,208 INFO L475 AbstractCegarLoop]: Abstraction has 10933 states and 14232 transitions. [2019-10-03 04:08:42,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 14232 transitions. [2019-10-03 04:08:42,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-03 04:08:42,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:42,237 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:42,237 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:42,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:42,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1817523371, now seen corresponding path program 1 times [2019-10-03 04:08:42,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:42,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:42,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:42,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-03 04:08:42,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:42,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:42,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 351 with the following transitions: [2019-10-03 04:08:42,391 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], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:42,401 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:42,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:42,409 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:08:43,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:43,610 INFO L272 AbstractInterpreter]: Visited 108 different actions 2264 times. Merged at 98 different actions 1824 times. Widened at 22 different actions 227 times. Performed 5663 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5663 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 317 fixpoints after 34 different actions. Largest state had 69 variables. [2019-10-03 04:08:43,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:43,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:43,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:43,611 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-10-03 04:08:43,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:43,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:43,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:43,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-03 04:08:44,028 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-10-03 04:08:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:44,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:44,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:44,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:44,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:44,145 INFO L87 Difference]: Start difference. First operand 10933 states and 14232 transitions. Second operand 4 states. [2019-10-03 04:08:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:44,493 INFO L93 Difference]: Finished difference Result 16381 states and 20991 transitions. [2019-10-03 04:08:44,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:08:44,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 350 [2019-10-03 04:08:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:44,521 INFO L225 Difference]: With dead ends: 16381 [2019-10-03 04:08:44,521 INFO L226 Difference]: Without dead ends: 16369 [2019-10-03 04:08:44,522 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 700 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-10-03 04:08:44,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16369 states. [2019-10-03 04:08:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16369 to 12565. [2019-10-03 04:08:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12565 states. [2019-10-03 04:08:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12565 states to 12565 states and 16452 transitions. [2019-10-03 04:08:44,699 INFO L78 Accepts]: Start accepts. Automaton has 12565 states and 16452 transitions. Word has length 350 [2019-10-03 04:08:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:44,699 INFO L475 AbstractCegarLoop]: Abstraction has 12565 states and 16452 transitions. [2019-10-03 04:08:44,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:44,699 INFO L276 IsEmpty]: Start isEmpty. Operand 12565 states and 16452 transitions. [2019-10-03 04:08:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-10-03 04:08:44,719 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:44,720 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:44,720 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:44,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:44,720 INFO L82 PathProgramCache]: Analyzing trace with hash -299155883, now seen corresponding path program 2 times [2019-10-03 04:08:44,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:44,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:44,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:44,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-10-03 04:08:45,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:45,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:45,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 04:08:45,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 04:08:45,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:45,246 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-10-03 04:08:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 04:08:45,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 04:08:45,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-03 04:08:45,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 04:08:45,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:45,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-03 04:08:45,403 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:45,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-03 04:08:45,474 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:45,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:08:45,476 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:45,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:45,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:45,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:45,477 INFO L87 Difference]: Start difference. First operand 12565 states and 16452 transitions. Second operand 3 states. [2019-10-03 04:08:45,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:45,593 INFO L93 Difference]: Finished difference Result 11773 states and 14784 transitions. [2019-10-03 04:08:45,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:45,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2019-10-03 04:08:45,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:45,613 INFO L225 Difference]: With dead ends: 11773 [2019-10-03 04:08:45,613 INFO L226 Difference]: Without dead ends: 11773 [2019-10-03 04:08:45,614 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 724 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-10-03 04:08:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11773 states. [2019-10-03 04:08:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11773 to 11413. [2019-10-03 04:08:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11413 states. [2019-10-03 04:08:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11413 states to 11413 states and 14316 transitions. [2019-10-03 04:08:45,757 INFO L78 Accepts]: Start accepts. Automaton has 11413 states and 14316 transitions. Word has length 362 [2019-10-03 04:08:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:45,758 INFO L475 AbstractCegarLoop]: Abstraction has 11413 states and 14316 transitions. [2019-10-03 04:08:45,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 11413 states and 14316 transitions. [2019-10-03 04:08:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-10-03 04:08:45,772 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:45,772 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:45,772 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:45,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -2019228612, now seen corresponding path program 1 times [2019-10-03 04:08:45,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:45,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 04:08:45,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:45,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:45,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:45,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:45,938 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 377 with the following transitions: [2019-10-03 04:08:45,939 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], [216], [231], [237], [242], [244], [247], [249], [255], [258], [263], [266], [268], [271], [279], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [418], [420], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:45,940 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:45,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:45,948 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:08:47,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:47,049 INFO L272 AbstractInterpreter]: Visited 109 different actions 2348 times. Merged at 99 different actions 1872 times. Widened at 21 different actions 224 times. Performed 5894 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5894 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 351 fixpoints after 34 different actions. Largest state had 69 variables. [2019-10-03 04:08:47,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:47,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:47,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:47,049 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-10-03 04:08:47,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:47,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:47,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:47,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:47,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:47,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-10-03 04:08:47,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:47,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:47,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:47,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:47,344 INFO L87 Difference]: Start difference. First operand 11413 states and 14316 transitions. Second operand 4 states. [2019-10-03 04:08:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:47,620 INFO L93 Difference]: Finished difference Result 13943 states and 17191 transitions. [2019-10-03 04:08:47,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:08:47,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-10-03 04:08:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:47,645 INFO L225 Difference]: With dead ends: 13943 [2019-10-03 04:08:47,645 INFO L226 Difference]: Without dead ends: 13931 [2019-10-03 04:08:47,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 752 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-10-03 04:08:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13931 states. [2019-10-03 04:08:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13931 to 11691. [2019-10-03 04:08:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11691 states. [2019-10-03 04:08:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11691 states to 11691 states and 14573 transitions. [2019-10-03 04:08:47,837 INFO L78 Accepts]: Start accepts. Automaton has 11691 states and 14573 transitions. Word has length 376 [2019-10-03 04:08:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:47,838 INFO L475 AbstractCegarLoop]: Abstraction has 11691 states and 14573 transitions. [2019-10-03 04:08:47,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 11691 states and 14573 transitions. [2019-10-03 04:08:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-10-03 04:08:47,847 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:47,848 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:47,848 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:47,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1965718292, now seen corresponding path program 1 times [2019-10-03 04:08:47,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:47,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:47,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:47,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-10-03 04:08:47,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:08:47,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:08:47,991 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:47,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:47,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:08:47,992 INFO L87 Difference]: Start difference. First operand 11691 states and 14573 transitions. Second operand 3 states. [2019-10-03 04:08:48,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:48,173 INFO L93 Difference]: Finished difference Result 11105 states and 13223 transitions. [2019-10-03 04:08:48,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:48,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 415 [2019-10-03 04:08:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:48,187 INFO L225 Difference]: With dead ends: 11105 [2019-10-03 04:08:48,187 INFO L226 Difference]: Without dead ends: 5423 [2019-10-03 04:08:48,187 INFO L640 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-10-03 04:08:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2019-10-03 04:08:48,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 5190. [2019-10-03 04:08:48,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5190 states. [2019-10-03 04:08:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 6402 transitions. [2019-10-03 04:08:48,261 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 6402 transitions. Word has length 415 [2019-10-03 04:08:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:48,262 INFO L475 AbstractCegarLoop]: Abstraction has 5190 states and 6402 transitions. [2019-10-03 04:08:48,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 6402 transitions. [2019-10-03 04:08:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2019-10-03 04:08:48,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:48,270 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:48,270 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:48,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1027355828, now seen corresponding path program 1 times [2019-10-03 04:08:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:48,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:48,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:48,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-03 04:08:48,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:48,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:48,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 500 with the following transitions: [2019-10-03 04:08:48,486 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], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [282], [284], [286], [292], [295], [297], [303], [305], [307], [310], [312], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [410], [415], [420], [422], [427], [430], [434], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:48,488 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:48,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:48,494 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:08:49,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:49,686 INFO L272 AbstractInterpreter]: Visited 115 different actions 2371 times. Merged at 103 different actions 1898 times. Widened at 22 different actions 239 times. Performed 5925 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5925 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 343 fixpoints after 37 different actions. Largest state had 70 variables. [2019-10-03 04:08:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:49,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:49,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:49,687 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) [2019-10-03 04:08:49,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:49,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:49,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:50,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-03 04:08:50,012 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-10-03 04:08:50,201 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:08:50,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2019-10-03 04:08:50,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:08:50,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:08:50,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:08:50,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:08:50,203 INFO L87 Difference]: Start difference. First operand 5190 states and 6402 transitions. Second operand 3 states. [2019-10-03 04:08:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:50,223 INFO L93 Difference]: Finished difference Result 5189 states and 6405 transitions. [2019-10-03 04:08:50,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:08:50,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 499 [2019-10-03 04:08:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:50,234 INFO L225 Difference]: With dead ends: 5189 [2019-10-03 04:08:50,234 INFO L226 Difference]: Without dead ends: 5189 [2019-10-03 04:08:50,235 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1001 GetRequests, 998 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-10-03 04:08:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2019-10-03 04:08:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5116. [2019-10-03 04:08:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5116 states. [2019-10-03 04:08:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 6311 transitions. [2019-10-03 04:08:50,308 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 6311 transitions. Word has length 499 [2019-10-03 04:08:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:50,309 INFO L475 AbstractCegarLoop]: Abstraction has 5116 states and 6311 transitions. [2019-10-03 04:08:50,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:08:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 6311 transitions. [2019-10-03 04:08:50,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2019-10-03 04:08:50,317 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:08:50,318 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-03 04:08:50,318 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:08:50,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:50,318 INFO L82 PathProgramCache]: Analyzing trace with hash -241116614, now seen corresponding path program 1 times [2019-10-03 04:08:50,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:08:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:50,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:50,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:08:50,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:08:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-03 04:08:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:50,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:08:50,573 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 610 with the following transitions: [2019-10-03 04:08:50,573 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], [216], [231], [237], [242], [244], [247], [255], [258], [263], [266], [268], [271], [279], [282], [286], [292], [295], [303], [305], [307], [310], [318], [323], [325], [328], [330], [335], [337], [342], [347], [349], [358], [363], [368], [370], [379], [384], [387], [395], [400], [402], [407], [410], [415], [420], [422], [427], [430], [434], [445], [447], [513], [515], [527], [533], [537], [538], [539], [541] [2019-10-03 04:08:50,575 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:08:50,575 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:08:50,581 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 04:08:51,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:08:51,406 INFO L272 AbstractInterpreter]: Visited 112 different actions 2199 times. Merged at 98 different actions 1789 times. Widened at 20 different actions 235 times. Performed 5544 root evaluator evaluations with a maximum evaluation depth of 6. Performed 5544 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 283 fixpoints after 34 different actions. Largest state had 70 variables. [2019-10-03 04:08:51,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:08:51,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:08:51,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:08:51,406 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 04:08:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:08:51,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:08:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:08:51,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-03 04:08:51,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:08:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-03 04:08:51,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:08:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-10-03 04:08:52,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 04:08:52,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-10-03 04:08:52,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 04:08:52,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:08:52,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:08:52,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:08:52,027 INFO L87 Difference]: Start difference. First operand 5116 states and 6311 transitions. Second operand 4 states. [2019-10-03 04:08:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:08:52,187 INFO L93 Difference]: Finished difference Result 511 states and 588 transitions. [2019-10-03 04:08:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:08:52,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 609 [2019-10-03 04:08:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:08:52,189 INFO L225 Difference]: With dead ends: 511 [2019-10-03 04:08:52,189 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 04:08:52,189 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1223 GetRequests, 1218 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-10-03 04:08:52,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 04:08:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 04:08:52,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 04:08:52,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 04:08:52,190 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 609 [2019-10-03 04:08:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:08:52,190 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 04:08:52,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:08:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 04:08:52,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 04:08:52,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 04:08:52 BoogieIcfgContainer [2019-10-03 04:08:52,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 04:08:52,199 INFO L168 Benchmark]: Toolchain (without parser) took 21547.78 ms. Allocated memory was 137.9 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 84.8 MB in the beginning and 580.3 MB in the end (delta: -495.5 MB). Peak memory consumption was 709.8 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,203 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 483.39 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 84.6 MB in the beginning and 173.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,206 INFO L168 Benchmark]: Boogie Preprocessor took 66.96 ms. Allocated memory is still 198.2 MB. Free memory was 173.4 MB in the beginning and 170.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,206 INFO L168 Benchmark]: RCFGBuilder took 650.81 ms. Allocated memory is still 198.2 MB. Free memory was 170.8 MB in the beginning and 128.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,207 INFO L168 Benchmark]: TraceAbstraction took 20340.88 ms. Allocated memory was 198.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 128.8 MB in the beginning and 580.3 MB in the end (delta: -451.5 MB). Peak memory consumption was 693.5 MB. Max. memory is 7.1 GB. [2019-10-03 04:08:52,212 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.21 ms. Allocated memory is still 137.9 MB. Free memory was 103.9 MB in the beginning and 103.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 483.39 ms. Allocated memory was 137.9 MB in the beginning and 198.2 MB in the end (delta: 60.3 MB). Free memory was 84.6 MB in the beginning and 173.4 MB in the end (delta: -88.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.96 ms. Allocated memory is still 198.2 MB. Free memory was 173.4 MB in the beginning and 170.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.81 ms. Allocated memory is still 198.2 MB. Free memory was 170.8 MB in the beginning and 128.8 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20340.88 ms. Allocated memory was 198.2 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 128.8 MB in the beginning and 580.3 MB in the end (delta: -451.5 MB). Peak memory consumption was 693.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: 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, 132 locations, 1 error locations. SAFE Result, 20.2s OverallTime, 28 OverallIterations, 21 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5663 SDtfs, 1902 SDslu, 3297 SDs, 0 SdLazy, 2598 SolverSat, 449 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5512 GetRequests, 5458 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12565occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 5.8s AbstIntTime, 6 AbstIntIterations, 1 AbstIntStrong, 0.8389925373134328 AbsIntWeakeningRatio, 0.3761194029850746 AbsIntAvgWeakeningVarsNumRemoved, -0.1044776119402985 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 7277 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 9435 NumberOfCodeBlocks, 9182 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 11939 ConstructedInterpolants, 0 QuantifiedInterpolants, 7523619 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3733 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 40 InterpolantComputations, 27 PerfectInterpolantSequences, 51889/52025 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...