/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:22:25,063 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:22:25,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:22:25,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:22:25,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:22:25,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:22:25,082 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:22:25,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:22:25,086 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:22:25,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:22:25,088 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:22:25,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:22:25,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:22:25,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:22:25,091 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:22:25,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:22:25,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:22:25,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:22:25,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:22:25,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:22:25,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:22:25,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:22:25,101 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:22:25,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:22:25,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:22:25,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:22:25,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:22:25,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:22:25,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:22:25,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:22:25,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:22:25,108 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:22:25,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:22:25,109 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:22:25,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:22:25,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:22:25,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:22:25,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:22:25,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:22:25,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:22:25,113 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:22:25,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:22:25,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:22:25,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:22:25,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:22:25,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:22:25,137 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:22:25,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:22:25,138 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:22:25,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:22:25,138 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:22:25,138 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:22:25,138 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:22:25,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:22:25,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:22:25,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:22:25,141 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:22:25,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:22:25,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:22:25,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:22:25,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:22:25,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:22:25,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:22:25,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:22:25,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:22:25,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:22:25,411 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:22:25,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:22:25,428 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:22:25,429 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:22:25,430 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:22:25,430 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-3.c [2019-11-06 22:22:25,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26b9cd67/d555c7254f804528a2d92cc9b850ccc4/FLAGb0434fb22 [2019-11-06 22:22:26,055 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:22:26,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-06 22:22:26,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26b9cd67/d555c7254f804528a2d92cc9b850ccc4/FLAGb0434fb22 [2019-11-06 22:22:26,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b26b9cd67/d555c7254f804528a2d92cc9b850ccc4 [2019-11-06 22:22:26,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:22:26,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:22:26,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:26,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:22:26,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:22:26,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecbca02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26, skipping insertion in model container [2019-11-06 22:22:26,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,387 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:22:26,430 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:22:26,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:26,667 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:22:26,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:22:26,844 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:22:26,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26 WrapperNode [2019-11-06 22:22:26,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:22:26,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:22:26,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:22:26,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:22:26,855 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (1/1) ... [2019-11-06 22:22:26,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:22:26,902 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:22:26,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:22:26,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:22:26,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (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-11-06 22:22:26,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:22:26,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:22:26,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2019-11-06 22:22:26,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:22:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:22:26,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:22:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:22:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:22:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:22:26,961 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_connect [2019-11-06 22:22:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:22:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:22:26,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:22:27,213 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:22:27,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-06 22:22:27,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-06 22:22:27,768 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:22:27,768 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:22:27,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:27 BoogieIcfgContainer [2019-11-06 22:22:27,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:22:27,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:22:27,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:22:27,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:22:27,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:26" (1/3) ... [2019-11-06 22:22:27,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54adf5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:27, skipping insertion in model container [2019-11-06 22:22:27,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:26" (2/3) ... [2019-11-06 22:22:27,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54adf5d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:27, skipping insertion in model container [2019-11-06 22:22:27,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:27" (3/3) ... [2019-11-06 22:22:27,779 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-06 22:22:27,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:22:27,798 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:22:27,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:22:27,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:22:27,839 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:22:27,839 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:22:27,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:22:27,840 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:22:27,840 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:22:27,840 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:22:27,840 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:22:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-11-06 22:22:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 22:22:27,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:27,871 INFO L410 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-11-06 22:22:27,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:27,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 173387410, now seen corresponding path program 1 times [2019-11-06 22:22:27,885 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:27,886 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311549716] [2019-11-06 22:22:27,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:28,123 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311549716] [2019-11-06 22:22:28,124 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:28,124 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:28,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277643342] [2019-11-06 22:22:28,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:28,133 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:28,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:28,149 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-11-06 22:22:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:28,264 INFO L93 Difference]: Finished difference Result 377 states and 634 transitions. [2019-11-06 22:22:28,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:28,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-06 22:22:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:28,284 INFO L225 Difference]: With dead ends: 377 [2019-11-06 22:22:28,284 INFO L226 Difference]: Without dead ends: 220 [2019-11-06 22:22:28,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-06 22:22:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2019-11-06 22:22:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-11-06 22:22:28,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 326 transitions. [2019-11-06 22:22:28,427 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 326 transitions. Word has length 29 [2019-11-06 22:22:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:28,429 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 326 transitions. [2019-11-06 22:22:28,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:28,430 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 326 transitions. [2019-11-06 22:22:28,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 22:22:28,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:28,437 INFO L410 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-11-06 22:22:28,437 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:28,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1098416379, now seen corresponding path program 1 times [2019-11-06 22:22:28,438 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:28,438 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061949129] [2019-11-06 22:22:28,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:22:28,605 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061949129] [2019-11-06 22:22:28,605 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:28,623 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:28,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635216740] [2019-11-06 22:22:28,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:28,625 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:28,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:28,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:28,626 INFO L87 Difference]: Start difference. First operand 220 states and 326 transitions. Second operand 3 states. [2019-11-06 22:22:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:28,832 INFO L93 Difference]: Finished difference Result 472 states and 710 transitions. [2019-11-06 22:22:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:28,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-06 22:22:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:28,836 INFO L225 Difference]: With dead ends: 472 [2019-11-06 22:22:28,836 INFO L226 Difference]: Without dead ends: 264 [2019-11-06 22:22:28,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-11-06 22:22:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 254. [2019-11-06 22:22:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-06 22:22:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2019-11-06 22:22:28,859 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 43 [2019-11-06 22:22:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:28,860 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2019-11-06 22:22:28,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:28,860 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2019-11-06 22:22:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:28,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:28,863 INFO L410 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-11-06 22:22:28,863 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:28,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:28,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1571737336, now seen corresponding path program 1 times [2019-11-06 22:22:28,864 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:28,864 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435908464] [2019-11-06 22:22:28,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:28,976 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435908464] [2019-11-06 22:22:28,976 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:28,976 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:28,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800549514] [2019-11-06 22:22:28,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:28,977 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:28,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:28,978 INFO L87 Difference]: Start difference. First operand 254 states and 370 transitions. Second operand 3 states. [2019-11-06 22:22:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,211 INFO L93 Difference]: Finished difference Result 598 states and 902 transitions. [2019-11-06 22:22:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,216 INFO L225 Difference]: With dead ends: 598 [2019-11-06 22:22:29,216 INFO L226 Difference]: Without dead ends: 354 [2019-11-06 22:22:29,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:29,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-06 22:22:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 336. [2019-11-06 22:22:29,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-11-06 22:22:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 470 transitions. [2019-11-06 22:22:29,247 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 470 transitions. Word has length 60 [2019-11-06 22:22:29,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,248 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 470 transitions. [2019-11-06 22:22:29,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,248 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 470 transitions. [2019-11-06 22:22:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 22:22:29,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,256 INFO L410 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-11-06 22:22:29,256 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,256 INFO L82 PathProgramCache]: Analyzing trace with hash -233700998, now seen corresponding path program 1 times [2019-11-06 22:22:29,257 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,257 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091619859] [2019-11-06 22:22:29,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:29,336 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091619859] [2019-11-06 22:22:29,336 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,337 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141843862] [2019-11-06 22:22:29,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,338 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,338 INFO L87 Difference]: Start difference. First operand 336 states and 470 transitions. Second operand 3 states. [2019-11-06 22:22:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,506 INFO L93 Difference]: Finished difference Result 708 states and 1005 transitions. [2019-11-06 22:22:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-06 22:22:29,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,513 INFO L225 Difference]: With dead ends: 708 [2019-11-06 22:22:29,513 INFO L226 Difference]: Without dead ends: 384 [2019-11-06 22:22:29,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-11-06 22:22:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 374. [2019-11-06 22:22:29,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-11-06 22:22:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 518 transitions. [2019-11-06 22:22:29,536 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 518 transitions. Word has length 60 [2019-11-06 22:22:29,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,536 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 518 transitions. [2019-11-06 22:22:29,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 518 transitions. [2019-11-06 22:22:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-06 22:22:29,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,541 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:22:29,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,542 INFO L82 PathProgramCache]: Analyzing trace with hash -343872958, now seen corresponding path program 1 times [2019-11-06 22:22:29,542 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,543 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994257559] [2019-11-06 22:22:29,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 22:22:29,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994257559] [2019-11-06 22:22:29,642 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,642 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806211463] [2019-11-06 22:22:29,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,646 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,647 INFO L87 Difference]: Start difference. First operand 374 states and 518 transitions. Second operand 3 states. [2019-11-06 22:22:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:29,862 INFO L93 Difference]: Finished difference Result 842 states and 1204 transitions. [2019-11-06 22:22:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:29,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-06 22:22:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:29,866 INFO L225 Difference]: With dead ends: 842 [2019-11-06 22:22:29,866 INFO L226 Difference]: Without dead ends: 478 [2019-11-06 22:22:29,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-11-06 22:22:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 452. [2019-11-06 22:22:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-11-06 22:22:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 652 transitions. [2019-11-06 22:22:29,883 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 652 transitions. Word has length 73 [2019-11-06 22:22:29,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:29,883 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 652 transitions. [2019-11-06 22:22:29,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:29,884 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 652 transitions. [2019-11-06 22:22:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-06 22:22:29,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:29,885 INFO L410 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, 1] [2019-11-06 22:22:29,886 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1570407527, now seen corresponding path program 1 times [2019-11-06 22:22:29,886 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:29,887 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231606812] [2019-11-06 22:22:29,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-06 22:22:29,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231606812] [2019-11-06 22:22:29,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:29,942 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:29,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270087580] [2019-11-06 22:22:29,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:29,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:29,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:29,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:29,945 INFO L87 Difference]: Start difference. First operand 452 states and 652 transitions. Second operand 3 states. [2019-11-06 22:22:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,090 INFO L93 Difference]: Finished difference Result 940 states and 1365 transitions. [2019-11-06 22:22:30,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-06 22:22:30,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,095 INFO L225 Difference]: With dead ends: 940 [2019-11-06 22:22:30,095 INFO L226 Difference]: Without dead ends: 500 [2019-11-06 22:22:30,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-06 22:22:30,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 494. [2019-11-06 22:22:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-11-06 22:22:30,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 704 transitions. [2019-11-06 22:22:30,112 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 704 transitions. Word has length 77 [2019-11-06 22:22:30,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,112 INFO L462 AbstractCegarLoop]: Abstraction has 494 states and 704 transitions. [2019-11-06 22:22:30,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 704 transitions. [2019-11-06 22:22:30,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-06 22:22:30,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,115 INFO L410 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] [2019-11-06 22:22:30,115 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1356861727, now seen corresponding path program 1 times [2019-11-06 22:22:30,116 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,116 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821680609] [2019-11-06 22:22:30,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:22:30,180 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821680609] [2019-11-06 22:22:30,180 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,181 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220656885] [2019-11-06 22:22:30,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,182 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,183 INFO L87 Difference]: Start difference. First operand 494 states and 704 transitions. Second operand 3 states. [2019-11-06 22:22:30,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,237 INFO L93 Difference]: Finished difference Result 976 states and 1397 transitions. [2019-11-06 22:22:30,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-06 22:22:30,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,242 INFO L225 Difference]: With dead ends: 976 [2019-11-06 22:22:30,242 INFO L226 Difference]: Without dead ends: 734 [2019-11-06 22:22:30,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:30,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-11-06 22:22:30,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2019-11-06 22:22:30,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-11-06 22:22:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1047 transitions. [2019-11-06 22:22:30,266 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1047 transitions. Word has length 97 [2019-11-06 22:22:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,266 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1047 transitions. [2019-11-06 22:22:30,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,266 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1047 transitions. [2019-11-06 22:22:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-06 22:22:30,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,269 INFO L410 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, 1] [2019-11-06 22:22:30,269 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1774863991, now seen corresponding path program 1 times [2019-11-06 22:22:30,270 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,270 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793794583] [2019-11-06 22:22:30,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-06 22:22:30,360 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793794583] [2019-11-06 22:22:30,360 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,360 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788830627] [2019-11-06 22:22:30,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,361 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,362 INFO L87 Difference]: Start difference. First operand 734 states and 1047 transitions. Second operand 3 states. [2019-11-06 22:22:30,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,416 INFO L93 Difference]: Finished difference Result 976 states and 1394 transitions. [2019-11-06 22:22:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-06 22:22:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,422 INFO L225 Difference]: With dead ends: 976 [2019-11-06 22:22:30,422 INFO L226 Difference]: Without dead ends: 974 [2019-11-06 22:22:30,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:30,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-11-06 22:22:30,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2019-11-06 22:22:30,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-06 22:22:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1392 transitions. [2019-11-06 22:22:30,449 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1392 transitions. Word has length 99 [2019-11-06 22:22:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,449 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1392 transitions. [2019-11-06 22:22:30,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1392 transitions. [2019-11-06 22:22:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-06 22:22:30,453 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,453 INFO L410 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, 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-11-06 22:22:30,453 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,454 INFO L82 PathProgramCache]: Analyzing trace with hash 600728947, now seen corresponding path program 1 times [2019-11-06 22:22:30,454 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,454 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753174954] [2019-11-06 22:22:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,521 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-06 22:22:30,521 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753174954] [2019-11-06 22:22:30,522 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,522 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699135787] [2019-11-06 22:22:30,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,523 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,524 INFO L87 Difference]: Start difference. First operand 974 states and 1392 transitions. Second operand 3 states. [2019-11-06 22:22:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,702 INFO L93 Difference]: Finished difference Result 2140 states and 3108 transitions. [2019-11-06 22:22:30,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-06 22:22:30,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,710 INFO L225 Difference]: With dead ends: 2140 [2019-11-06 22:22:30,710 INFO L226 Difference]: Without dead ends: 1170 [2019-11-06 22:22:30,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-11-06 22:22:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1130. [2019-11-06 22:22:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-11-06 22:22:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1632 transitions. [2019-11-06 22:22:30,745 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1632 transitions. Word has length 154 [2019-11-06 22:22:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:30,745 INFO L462 AbstractCegarLoop]: Abstraction has 1130 states and 1632 transitions. [2019-11-06 22:22:30,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1632 transitions. [2019-11-06 22:22:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-06 22:22:30,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:30,750 INFO L410 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, 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-11-06 22:22:30,750 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:30,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1176011842, now seen corresponding path program 1 times [2019-11-06 22:22:30,751 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:30,751 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897107792] [2019-11-06 22:22:30,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-06 22:22:30,826 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897107792] [2019-11-06 22:22:30,826 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:30,827 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:30,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326119349] [2019-11-06 22:22:30,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:30,828 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:30,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:30,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:30,829 INFO L87 Difference]: Start difference. First operand 1130 states and 1632 transitions. Second operand 3 states. [2019-11-06 22:22:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:30,962 INFO L93 Difference]: Finished difference Result 2354 states and 3378 transitions. [2019-11-06 22:22:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:30,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-11-06 22:22:30,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:30,970 INFO L225 Difference]: With dead ends: 2354 [2019-11-06 22:22:30,971 INFO L226 Difference]: Without dead ends: 1236 [2019-11-06 22:22:30,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:30,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2019-11-06 22:22:31,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1222. [2019-11-06 22:22:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-11-06 22:22:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1744 transitions. [2019-11-06 22:22:31,011 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1744 transitions. Word has length 190 [2019-11-06 22:22:31,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,012 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 1744 transitions. [2019-11-06 22:22:31,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1744 transitions. [2019-11-06 22:22:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-11-06 22:22:31,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,017 INFO L410 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, 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-11-06 22:22:31,017 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -717257595, now seen corresponding path program 1 times [2019-11-06 22:22:31,018 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,018 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667199905] [2019-11-06 22:22:31,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-06 22:22:31,082 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667199905] [2019-11-06 22:22:31,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,082 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885092244] [2019-11-06 22:22:31,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,083 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,084 INFO L87 Difference]: Start difference. First operand 1222 states and 1744 transitions. Second operand 3 states. [2019-11-06 22:22:31,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,231 INFO L93 Difference]: Finished difference Result 2544 states and 3620 transitions. [2019-11-06 22:22:31,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-11-06 22:22:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,239 INFO L225 Difference]: With dead ends: 2544 [2019-11-06 22:22:31,239 INFO L226 Difference]: Without dead ends: 1334 [2019-11-06 22:22:31,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-11-06 22:22:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1322. [2019-11-06 22:22:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states. [2019-11-06 22:22:31,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1864 transitions. [2019-11-06 22:22:31,330 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1864 transitions. Word has length 211 [2019-11-06 22:22:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,331 INFO L462 AbstractCegarLoop]: Abstraction has 1322 states and 1864 transitions. [2019-11-06 22:22:31,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1864 transitions. [2019-11-06 22:22:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-06 22:22:31,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,336 INFO L410 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, 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-11-06 22:22:31,337 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1079909240, now seen corresponding path program 1 times [2019-11-06 22:22:31,337 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,338 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106810745] [2019-11-06 22:22:31,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-06 22:22:31,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106810745] [2019-11-06 22:22:31,429 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,430 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995867574] [2019-11-06 22:22:31,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,431 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,432 INFO L87 Difference]: Start difference. First operand 1322 states and 1864 transitions. Second operand 3 states. [2019-11-06 22:22:31,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,579 INFO L93 Difference]: Finished difference Result 2752 states and 3872 transitions. [2019-11-06 22:22:31,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-06 22:22:31,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,587 INFO L225 Difference]: With dead ends: 2752 [2019-11-06 22:22:31,588 INFO L226 Difference]: Without dead ends: 1442 [2019-11-06 22:22:31,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2019-11-06 22:22:31,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 1434. [2019-11-06 22:22:31,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1434 states. [2019-11-06 22:22:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1996 transitions. [2019-11-06 22:22:31,626 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1996 transitions. Word has length 235 [2019-11-06 22:22:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,627 INFO L462 AbstractCegarLoop]: Abstraction has 1434 states and 1996 transitions. [2019-11-06 22:22:31,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1996 transitions. [2019-11-06 22:22:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-06 22:22:31,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,633 INFO L410 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, 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-11-06 22:22:31,633 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1213171786, now seen corresponding path program 1 times [2019-11-06 22:22:31,634 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,634 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029777323] [2019-11-06 22:22:31,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 734 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-06 22:22:31,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029777323] [2019-11-06 22:22:31,741 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:31,741 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:31,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715398674] [2019-11-06 22:22:31,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:31,742 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:31,743 INFO L87 Difference]: Start difference. First operand 1434 states and 1996 transitions. Second operand 3 states. [2019-11-06 22:22:31,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:31,896 INFO L93 Difference]: Finished difference Result 2992 states and 4172 transitions. [2019-11-06 22:22:31,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:31,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-06 22:22:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:31,905 INFO L225 Difference]: With dead ends: 2992 [2019-11-06 22:22:31,906 INFO L226 Difference]: Without dead ends: 1570 [2019-11-06 22:22:31,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-11-06 22:22:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1558. [2019-11-06 22:22:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1558 states. [2019-11-06 22:22:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 2140 transitions. [2019-11-06 22:22:31,958 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 2140 transitions. Word has length 235 [2019-11-06 22:22:31,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:31,958 INFO L462 AbstractCegarLoop]: Abstraction has 1558 states and 2140 transitions. [2019-11-06 22:22:31,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 2140 transitions. [2019-11-06 22:22:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-06 22:22:31,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:31,965 INFO L410 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, 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-11-06 22:22:31,965 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:31,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:31,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1569112328, now seen corresponding path program 1 times [2019-11-06 22:22:31,965 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:31,966 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533349309] [2019-11-06 22:22:31,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-11-06 22:22:32,081 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533349309] [2019-11-06 22:22:32,082 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:32,082 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:32,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670588519] [2019-11-06 22:22:32,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:32,084 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:32,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:32,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:32,085 INFO L87 Difference]: Start difference. First operand 1558 states and 2140 transitions. Second operand 3 states. [2019-11-06 22:22:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:32,162 INFO L93 Difference]: Finished difference Result 4646 states and 6384 transitions. [2019-11-06 22:22:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:32,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-06 22:22:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:32,182 INFO L225 Difference]: With dead ends: 4646 [2019-11-06 22:22:32,183 INFO L226 Difference]: Without dead ends: 3100 [2019-11-06 22:22:32,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:32,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2019-11-06 22:22:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 3098. [2019-11-06 22:22:32,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3098 states. [2019-11-06 22:22:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 4255 transitions. [2019-11-06 22:22:32,311 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 4255 transitions. Word has length 265 [2019-11-06 22:22:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:32,312 INFO L462 AbstractCegarLoop]: Abstraction has 3098 states and 4255 transitions. [2019-11-06 22:22:32,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 4255 transitions. [2019-11-06 22:22:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-11-06 22:22:32,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:32,327 INFO L410 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, 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-11-06 22:22:32,328 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:32,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:32,329 INFO L82 PathProgramCache]: Analyzing trace with hash 432773942, now seen corresponding path program 1 times [2019-11-06 22:22:32,329 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:32,329 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349778934] [2019-11-06 22:22:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 908 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-11-06 22:22:32,527 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349778934] [2019-11-06 22:22:32,528 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:32,528 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:32,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563945831] [2019-11-06 22:22:32,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:32,529 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:32,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:32,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:32,530 INFO L87 Difference]: Start difference. First operand 3098 states and 4255 transitions. Second operand 3 states. [2019-11-06 22:22:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:32,692 INFO L93 Difference]: Finished difference Result 6484 states and 8938 transitions. [2019-11-06 22:22:32,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:32,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-11-06 22:22:32,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:32,708 INFO L225 Difference]: With dead ends: 6484 [2019-11-06 22:22:32,709 INFO L226 Difference]: Without dead ends: 3398 [2019-11-06 22:22:32,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:32,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-11-06 22:22:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3382. [2019-11-06 22:22:32,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-06 22:22:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4579 transitions. [2019-11-06 22:22:32,812 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4579 transitions. Word has length 265 [2019-11-06 22:22:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:32,812 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4579 transitions. [2019-11-06 22:22:32,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4579 transitions. [2019-11-06 22:22:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-11-06 22:22:32,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:32,823 INFO L410 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, 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-11-06 22:22:32,824 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:32,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:32,824 INFO L82 PathProgramCache]: Analyzing trace with hash -764797682, now seen corresponding path program 1 times [2019-11-06 22:22:32,824 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:32,824 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568833840] [2019-11-06 22:22:32,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 642 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-11-06 22:22:32,947 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568833840] [2019-11-06 22:22:32,949 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:32,949 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:32,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058929353] [2019-11-06 22:22:32,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:32,950 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:32,950 INFO L87 Difference]: Start difference. First operand 3382 states and 4579 transitions. Second operand 3 states. [2019-11-06 22:22:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:33,138 INFO L93 Difference]: Finished difference Result 6900 states and 9354 transitions. [2019-11-06 22:22:33,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:33,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-11-06 22:22:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:33,159 INFO L225 Difference]: With dead ends: 6900 [2019-11-06 22:22:33,159 INFO L226 Difference]: Without dead ends: 3530 [2019-11-06 22:22:33,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3530 states. [2019-11-06 22:22:33,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3530 to 3514. [2019-11-06 22:22:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-11-06 22:22:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 4731 transitions. [2019-11-06 22:22:33,280 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 4731 transitions. Word has length 289 [2019-11-06 22:22:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:33,280 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 4731 transitions. [2019-11-06 22:22:33,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 4731 transitions. [2019-11-06 22:22:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-11-06 22:22:33,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:33,295 INFO L410 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, 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-11-06 22:22:33,296 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:33,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:33,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2053251468, now seen corresponding path program 1 times [2019-11-06 22:22:33,296 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:33,297 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108969736] [2019-11-06 22:22:33,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 542 proven. 0 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-06 22:22:33,401 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108969736] [2019-11-06 22:22:33,402 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:33,402 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:33,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032468960] [2019-11-06 22:22:33,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:33,403 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:33,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:33,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:33,404 INFO L87 Difference]: Start difference. First operand 3514 states and 4731 transitions. Second operand 3 states. [2019-11-06 22:22:33,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:33,609 INFO L93 Difference]: Finished difference Result 7416 states and 10118 transitions. [2019-11-06 22:22:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:33,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-11-06 22:22:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:33,627 INFO L225 Difference]: With dead ends: 7416 [2019-11-06 22:22:33,628 INFO L226 Difference]: Without dead ends: 3914 [2019-11-06 22:22:33,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3914 states. [2019-11-06 22:22:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3914 to 3826. [2019-11-06 22:22:33,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2019-11-06 22:22:33,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5099 transitions. [2019-11-06 22:22:33,748 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5099 transitions. Word has length 300 [2019-11-06 22:22:33,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:33,749 INFO L462 AbstractCegarLoop]: Abstraction has 3826 states and 5099 transitions. [2019-11-06 22:22:33,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:33,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5099 transitions. [2019-11-06 22:22:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-11-06 22:22:33,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:33,761 INFO L410 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, 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-11-06 22:22:33,761 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 816481962, now seen corresponding path program 1 times [2019-11-06 22:22:33,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:33,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145046699] [2019-11-06 22:22:33,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-06 22:22:33,899 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145046699] [2019-11-06 22:22:33,899 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:33,900 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:33,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501585278] [2019-11-06 22:22:33,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:33,901 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:33,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:33,902 INFO L87 Difference]: Start difference. First operand 3826 states and 5099 transitions. Second operand 3 states. [2019-11-06 22:22:34,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:34,098 INFO L93 Difference]: Finished difference Result 8048 states and 10662 transitions. [2019-11-06 22:22:34,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:34,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-11-06 22:22:34,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:34,124 INFO L225 Difference]: With dead ends: 8048 [2019-11-06 22:22:34,125 INFO L226 Difference]: Without dead ends: 4234 [2019-11-06 22:22:34,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4234 states. [2019-11-06 22:22:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4234 to 3946. [2019-11-06 22:22:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3946 states. [2019-11-06 22:22:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5243 transitions. [2019-11-06 22:22:34,207 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5243 transitions. Word has length 314 [2019-11-06 22:22:34,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:34,207 INFO L462 AbstractCegarLoop]: Abstraction has 3946 states and 5243 transitions. [2019-11-06 22:22:34,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5243 transitions. [2019-11-06 22:22:34,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-06 22:22:34,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:34,218 INFO L410 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, 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-11-06 22:22:34,218 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:34,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:34,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1006853977, now seen corresponding path program 1 times [2019-11-06 22:22:34,219 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:34,219 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895967768] [2019-11-06 22:22:34,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 707 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-06 22:22:34,384 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895967768] [2019-11-06 22:22:34,385 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:34,385 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:34,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007853721] [2019-11-06 22:22:34,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:34,386 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:34,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:34,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:34,386 INFO L87 Difference]: Start difference. First operand 3946 states and 5243 transitions. Second operand 3 states. [2019-11-06 22:22:34,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:34,466 INFO L93 Difference]: Finished difference Result 11310 states and 15105 transitions. [2019-11-06 22:22:34,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:34,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 315 [2019-11-06 22:22:34,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:34,488 INFO L225 Difference]: With dead ends: 11310 [2019-11-06 22:22:34,488 INFO L226 Difference]: Without dead ends: 7376 [2019-11-06 22:22:34,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:34,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2019-11-06 22:22:34,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7374. [2019-11-06 22:22:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7374 states. [2019-11-06 22:22:34,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7374 states to 7374 states and 9853 transitions. [2019-11-06 22:22:34,624 INFO L78 Accepts]: Start accepts. Automaton has 7374 states and 9853 transitions. Word has length 315 [2019-11-06 22:22:34,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:34,625 INFO L462 AbstractCegarLoop]: Abstraction has 7374 states and 9853 transitions. [2019-11-06 22:22:34,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:34,625 INFO L276 IsEmpty]: Start isEmpty. Operand 7374 states and 9853 transitions. [2019-11-06 22:22:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-06 22:22:34,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:34,637 INFO L410 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, 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] [2019-11-06 22:22:34,637 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 999089455, now seen corresponding path program 1 times [2019-11-06 22:22:34,638 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:34,638 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182102037] [2019-11-06 22:22:34,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1201 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-11-06 22:22:34,770 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182102037] [2019-11-06 22:22:34,770 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:34,771 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:34,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852460369] [2019-11-06 22:22:34,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:34,772 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:34,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:34,772 INFO L87 Difference]: Start difference. First operand 7374 states and 9853 transitions. Second operand 3 states. [2019-11-06 22:22:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:35,051 INFO L93 Difference]: Finished difference Result 14744 states and 19682 transitions. [2019-11-06 22:22:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:35,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 316 [2019-11-06 22:22:35,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:35,070 INFO L225 Difference]: With dead ends: 14744 [2019-11-06 22:22:35,070 INFO L226 Difference]: Without dead ends: 7382 [2019-11-06 22:22:35,088 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-11-06 22:22:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7350. [2019-11-06 22:22:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7350 states. [2019-11-06 22:22:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7350 states to 7350 states and 9573 transitions. [2019-11-06 22:22:35,306 INFO L78 Accepts]: Start accepts. Automaton has 7350 states and 9573 transitions. Word has length 316 [2019-11-06 22:22:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:35,306 INFO L462 AbstractCegarLoop]: Abstraction has 7350 states and 9573 transitions. [2019-11-06 22:22:35,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7350 states and 9573 transitions. [2019-11-06 22:22:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-06 22:22:35,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:35,320 INFO L410 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, 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-11-06 22:22:35,320 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:35,320 INFO L82 PathProgramCache]: Analyzing trace with hash -901585188, now seen corresponding path program 1 times [2019-11-06 22:22:35,321 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:35,321 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608310461] [2019-11-06 22:22:35,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 766 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2019-11-06 22:22:35,436 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608310461] [2019-11-06 22:22:35,436 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597675332] [2019-11-06 22:22:35,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:35,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 22:22:35,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 1244 trivial. 0 not checked. [2019-11-06 22:22:35,755 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:35,756 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2019-11-06 22:22:35,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886502029] [2019-11-06 22:22:35,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:22:35,757 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:35,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:22:35,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:22:35,757 INFO L87 Difference]: Start difference. First operand 7350 states and 9573 transitions. Second operand 5 states. [2019-11-06 22:22:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:36,165 INFO L93 Difference]: Finished difference Result 14866 states and 19371 transitions. [2019-11-06 22:22:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:36,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2019-11-06 22:22:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:36,183 INFO L225 Difference]: With dead ends: 14866 [2019-11-06 22:22:36,183 INFO L226 Difference]: Without dead ends: 7500 [2019-11-06 22:22:36,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:22:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7500 states. [2019-11-06 22:22:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7500 to 7356. [2019-11-06 22:22:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7356 states. [2019-11-06 22:22:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7356 states to 7356 states and 9581 transitions. [2019-11-06 22:22:36,363 INFO L78 Accepts]: Start accepts. Automaton has 7356 states and 9581 transitions. Word has length 339 [2019-11-06 22:22:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:36,363 INFO L462 AbstractCegarLoop]: Abstraction has 7356 states and 9581 transitions. [2019-11-06 22:22:36,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:22:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7356 states and 9581 transitions. [2019-11-06 22:22:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-06 22:22:36,374 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:36,375 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-06 22:22:36,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:36,579 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:36,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:36,579 INFO L82 PathProgramCache]: Analyzing trace with hash 998396082, now seen corresponding path program 1 times [2019-11-06 22:22:36,579 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:36,579 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286705884] [2019-11-06 22:22:36,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-06 22:22:36,846 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286705884] [2019-11-06 22:22:36,846 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016323957] [2019-11-06 22:22:36,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:37,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:37,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-06 22:22:37,193 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:37,194 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:37,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716920619] [2019-11-06 22:22:37,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:37,196 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:37,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:37,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:37,197 INFO L87 Difference]: Start difference. First operand 7356 states and 9581 transitions. Second operand 4 states. [2019-11-06 22:22:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:37,731 INFO L93 Difference]: Finished difference Result 14624 states and 19043 transitions. [2019-11-06 22:22:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:22:37,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 352 [2019-11-06 22:22:37,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:37,752 INFO L225 Difference]: With dead ends: 14624 [2019-11-06 22:22:37,752 INFO L226 Difference]: Without dead ends: 11034 [2019-11-06 22:22:37,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11034 states. [2019-11-06 22:22:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11034 to 8460. [2019-11-06 22:22:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8460 states. [2019-11-06 22:22:37,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8460 states to 8460 states and 11077 transitions. [2019-11-06 22:22:37,955 INFO L78 Accepts]: Start accepts. Automaton has 8460 states and 11077 transitions. Word has length 352 [2019-11-06 22:22:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:37,956 INFO L462 AbstractCegarLoop]: Abstraction has 8460 states and 11077 transitions. [2019-11-06 22:22:37,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 8460 states and 11077 transitions. [2019-11-06 22:22:37,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-11-06 22:22:37,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:37,974 INFO L410 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, 1, 1, 1] [2019-11-06 22:22:38,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:38,180 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:38,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:38,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2002133556, now seen corresponding path program 2 times [2019-11-06 22:22:38,181 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:38,181 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860201427] [2019-11-06 22:22:38,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 843 proven. 5 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2019-11-06 22:22:38,352 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860201427] [2019-11-06 22:22:38,352 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559938332] [2019-11-06 22:22:38,353 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:38,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 22:22:38,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 22:22:38,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1497 backedges. 636 proven. 0 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-11-06 22:22:38,683 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:38,683 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:38,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330012617] [2019-11-06 22:22:38,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:38,684 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:38,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:38,685 INFO L87 Difference]: Start difference. First operand 8460 states and 11077 transitions. Second operand 3 states. [2019-11-06 22:22:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:39,155 INFO L93 Difference]: Finished difference Result 16374 states and 21042 transitions. [2019-11-06 22:22:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:39,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-11-06 22:22:39,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:39,172 INFO L225 Difference]: With dead ends: 16374 [2019-11-06 22:22:39,172 INFO L226 Difference]: Without dead ends: 7932 [2019-11-06 22:22:39,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 367 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-11-06 22:22:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2019-11-06 22:22:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7684. [2019-11-06 22:22:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-11-06 22:22:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 9645 transitions. [2019-11-06 22:22:39,321 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 9645 transitions. Word has length 365 [2019-11-06 22:22:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:39,322 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 9645 transitions. [2019-11-06 22:22:39,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 9645 transitions. [2019-11-06 22:22:39,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-06 22:22:39,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:39,334 INFO L410 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, 1, 1, 1] [2019-11-06 22:22:39,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:39,539 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:39,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:39,539 INFO L82 PathProgramCache]: Analyzing trace with hash 776946245, now seen corresponding path program 1 times [2019-11-06 22:22:39,539 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:39,540 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282198451] [2019-11-06 22:22:39,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-06 22:22:39,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282198451] [2019-11-06 22:22:39,706 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055474759] [2019-11-06 22:22:39,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:39,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 759 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:40,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-06 22:22:40,017 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:40,018 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:40,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879841714] [2019-11-06 22:22:40,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:40,021 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:40,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:40,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:40,021 INFO L87 Difference]: Start difference. First operand 7684 states and 9645 transitions. Second operand 4 states. [2019-11-06 22:22:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:40,444 INFO L93 Difference]: Finished difference Result 17152 states and 21441 transitions. [2019-11-06 22:22:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:40,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-06 22:22:40,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:40,465 INFO L225 Difference]: With dead ends: 17152 [2019-11-06 22:22:40,465 INFO L226 Difference]: Without dead ends: 9478 [2019-11-06 22:22:40,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:40,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-11-06 22:22:40,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7985. [2019-11-06 22:22:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7985 states. [2019-11-06 22:22:40,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7985 states to 7985 states and 9973 transitions. [2019-11-06 22:22:40,715 INFO L78 Accepts]: Start accepts. Automaton has 7985 states and 9973 transitions. Word has length 379 [2019-11-06 22:22:40,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:40,715 INFO L462 AbstractCegarLoop]: Abstraction has 7985 states and 9973 transitions. [2019-11-06 22:22:40,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7985 states and 9973 transitions. [2019-11-06 22:22:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-11-06 22:22:40,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:40,727 INFO L410 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, 1, 1, 1] [2019-11-06 22:22:40,939 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:40,939 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:40,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:40,940 INFO L82 PathProgramCache]: Analyzing trace with hash -885260259, now seen corresponding path program 1 times [2019-11-06 22:22:40,940 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:40,940 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191065181] [2019-11-06 22:22:40,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-06 22:22:41,081 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191065181] [2019-11-06 22:22:41,081 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:22:41,081 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:22:41,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265708405] [2019-11-06 22:22:41,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:41,082 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:41,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:41,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:22:41,084 INFO L87 Difference]: Start difference. First operand 7985 states and 9973 transitions. Second operand 3 states. [2019-11-06 22:22:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:41,292 INFO L93 Difference]: Finished difference Result 15351 states and 18826 transitions. [2019-11-06 22:22:41,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:41,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 418 [2019-11-06 22:22:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:41,300 INFO L225 Difference]: With dead ends: 15351 [2019-11-06 22:22:41,301 INFO L226 Difference]: Without dead ends: 3759 [2019-11-06 22:22:41,310 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11-06 22:22:41,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2019-11-06 22:22:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3524. [2019-11-06 22:22:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-11-06 22:22:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4353 transitions. [2019-11-06 22:22:41,363 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4353 transitions. Word has length 418 [2019-11-06 22:22:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:41,364 INFO L462 AbstractCegarLoop]: Abstraction has 3524 states and 4353 transitions. [2019-11-06 22:22:41,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:41,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4353 transitions. [2019-11-06 22:22:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2019-11-06 22:22:41,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:41,371 INFO L410 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, 1, 1, 1] [2019-11-06 22:22:41,371 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:41,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1596843861, now seen corresponding path program 1 times [2019-11-06 22:22:41,372 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:41,372 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499821653] [2019-11-06 22:22:41,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-11-06 22:22:41,598 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499821653] [2019-11-06 22:22:41,599 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717028094] [2019-11-06 22:22:41,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:41,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:41,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:41,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-11-06 22:22:42,066 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:22:42,067 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:22:42,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013790445] [2019-11-06 22:22:42,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:22:42,068 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:42,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:22:42,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:42,069 INFO L87 Difference]: Start difference. First operand 3524 states and 4353 transitions. Second operand 3 states. [2019-11-06 22:22:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:42,108 INFO L93 Difference]: Finished difference Result 3600 states and 4449 transitions. [2019-11-06 22:22:42,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:22:42,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 502 [2019-11-06 22:22:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:42,117 INFO L225 Difference]: With dead ends: 3600 [2019-11-06 22:22:42,118 INFO L226 Difference]: Without dead ends: 3523 [2019-11-06 22:22:42,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 504 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-11-06 22:22:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2019-11-06 22:22:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3449. [2019-11-06 22:22:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3449 states. [2019-11-06 22:22:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 4260 transitions. [2019-11-06 22:22:42,187 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 4260 transitions. Word has length 502 [2019-11-06 22:22:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:42,188 INFO L462 AbstractCegarLoop]: Abstraction has 3449 states and 4260 transitions. [2019-11-06 22:22:42,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:22:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 4260 transitions. [2019-11-06 22:22:42,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2019-11-06 22:22:42,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:22:42,200 INFO L410 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, 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, 1, 1] [2019-11-06 22:22:42,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:42,414 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:22:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:22:42,414 INFO L82 PathProgramCache]: Analyzing trace with hash -234514290, now seen corresponding path program 1 times [2019-11-06 22:22:42,414 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:22:42,414 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75194810] [2019-11-06 22:22:42,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:22:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-06 22:22:42,879 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75194810] [2019-11-06 22:22:42,880 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676255598] [2019-11-06 22:22:42,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:22:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:22:43,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:22:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-06 22:22:43,232 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:22:43,232 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:22:43,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873027253] [2019-11-06 22:22:43,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:22:43,234 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:22:43,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:22:43,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:22:43,234 INFO L87 Difference]: Start difference. First operand 3449 states and 4260 transitions. Second operand 4 states. [2019-11-06 22:22:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:22:43,392 INFO L93 Difference]: Finished difference Result 3947 states and 4887 transitions. [2019-11-06 22:22:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:22:43,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 614 [2019-11-06 22:22:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:22:43,393 INFO L225 Difference]: With dead ends: 3947 [2019-11-06 22:22:43,393 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:22:43,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 618 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:22:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:22:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:22:43,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:22:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:22:43,399 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 614 [2019-11-06 22:22:43,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:22:43,399 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:22:43,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:22:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:22:43,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:22:43,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:22:43,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:22:44,187 WARN L191 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 417 DAG size of output: 102 [2019-11-06 22:22:45,622 WARN L191 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-06 22:22:45,629 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-06 22:22:45,629 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:45,629 INFO L446 ceAbstractionStarter]: At program point L564(lines 107 565) the Hoare annotation is: true [2019-11-06 22:22:45,630 INFO L443 ceAbstractionStarter]: For program point L201(lines 201 514) no Hoare annotation was computed. [2019-11-06 22:22:45,630 INFO L443 ceAbstractionStarter]: For program point L168(lines 168 525) no Hoare annotation was computed. [2019-11-06 22:22:45,630 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 536) no Hoare annotation was computed. [2019-11-06 22:22:45,630 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 106) no Hoare annotation was computed. [2019-11-06 22:22:45,630 INFO L439 ceAbstractionStarter]: At program point L202(lines 198 515) the Hoare annotation is: (let ((.cse0 (<= 4560 ssl3_connect_~s__state~0)) (.cse2 (<= ssl3_connect_~s__state~0 4560)) (.cse1 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse2 (not .cse1)))) [2019-11-06 22:22:45,630 INFO L439 ceAbstractionStarter]: At program point L136(lines 132 537) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 2) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-11-06 22:22:45,630 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 105) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L236(lines 236 252) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L236-2(lines 211 509) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 480) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L435(lines 435 449) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 435 449) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 480) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 339) no Hoare annotation was computed. [2019-11-06 22:22:45,631 INFO L443 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L443 ceAbstractionStarter]: For program point L204(lines 204 513) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L443 ceAbstractionStarter]: For program point L270-2(lines 211 509) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L443 ceAbstractionStarter]: For program point L171(lines 171 524) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L443 ceAbstractionStarter]: For program point L138(lines 138 535) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 504) no Hoare annotation was computed. [2019-11-06 22:22:45,632 INFO L439 ceAbstractionStarter]: At program point L205(lines 204 513) the Hoare annotation is: (let ((.cse0 (<= ssl3_connect_~s__state~0 4352)) (.cse1 (<= 4352 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 .cse1 .cse2 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (and (<= ssl3_connect_~blastFlag~0 2) (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse0 .cse1 (not .cse2)))) [2019-11-06 22:22:45,632 INFO L439 ceAbstractionStarter]: At program point L172(lines 162 527) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (<= ssl3_connect_~s__state~0 4560)) (.cse2 (= ssl3_connect_~s__hit~0 0))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 571) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L569-2(lines 569 571) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 373) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 407) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L207(lines 207 512) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L174(lines 174 523) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L141(lines 141 534) no Hoare annotation was computed. [2019-11-06 22:22:45,633 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 85 575) no Hoare annotation was computed. [2019-11-06 22:22:45,634 INFO L443 ceAbstractionStarter]: For program point ssl3_connectErr0ASSERT_VIOLATIONERROR_FUNCTION(line 573) no Hoare annotation was computed. [2019-11-06 22:22:45,634 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 445) no Hoare annotation was computed. [2019-11-06 22:22:45,634 INFO L446 ceAbstractionStarter]: At program point L208(lines 207 512) the Hoare annotation is: true [2019-11-06 22:22:45,634 INFO L439 ceAbstractionStarter]: At program point L142(lines 138 535) the Hoare annotation is: (let ((.cse0 (<= 4352 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-06 22:22:45,634 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-06 22:22:45,634 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 245) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 477) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L446 ceAbstractionStarter]: At program point L210(lines 209 512) the Hoare annotation is: true [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L177(lines 177 522) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 533) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L111(lines 111 544) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 320) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L443 ceAbstractionStarter]: For program point L310-2(lines 310 320) no Hoare annotation was computed. [2019-11-06 22:22:45,635 INFO L439 ceAbstractionStarter]: At program point L178(lines 174 523) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-11-06 22:22:45,636 INFO L439 ceAbstractionStarter]: At program point L112(lines 111 544) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 12292 ssl3_connect_~s__state~0))) [2019-11-06 22:22:45,636 INFO L443 ceAbstractionStarter]: For program point L344(lines 344 346) no Hoare annotation was computed. [2019-11-06 22:22:45,636 INFO L439 ceAbstractionStarter]: At program point L510(lines 108 563) the Hoare annotation is: (let ((.cse1 (= ssl3_connect_~s__hit~0 0))) (let ((.cse9 (not .cse1)) (.cse5 (= ssl3_connect_~s__state~0 4512)) (.cse7 (<= 4560 ssl3_connect_~s__state~0)) (.cse8 (<= ssl3_connect_~s__state~0 4560)) (.cse12 (<= ssl3_connect_~s__state~0 3)) (.cse2 (= ssl3_connect_~s__state~0 4480)) (.cse13 (= 4464 ssl3_connect_~s__state~0)) (.cse14 (= ssl3_connect_~s__state~0 4528)) (.cse6 (<= ssl3_connect_~blastFlag~0 2)) (.cse16 (= 4400 ssl3_connect_~s__state~0)) (.cse3 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse10 (<= ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ssl3_connect_~s__state~0)) (.cse15 (<= 4560 ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse4 (= ssl3_connect_~s__state~0 4496)) (.cse0 (<= ssl3_connect_~blastFlag~0 4)) (.cse17 (= 4448 ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse1) (and .cse3 .cse5 .cse1) (and .cse6 .cse7 .cse8 .cse9) (and .cse6 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse10 .cse11 .cse9) (and .cse5 .cse0 .cse1) (and .cse12 .cse6 .cse1) (and .cse3 .cse13 .cse1) (and .cse6 .cse5) (and .cse3 .cse14 .cse1) (and .cse3 .cse7 .cse1 .cse8 .cse15) (and (<= ssl3_connect_~blastFlag~0 0) (= ssl3_connect_~s__state~0 4368)) (and .cse12 .cse3) (and .cse6 (= 4384 ssl3_connect_~s__state~0)) (and .cse3 .cse1 .cse2) (and .cse13 .cse0 .cse1) (and .cse3 .cse0 .cse16 .cse1) (and .cse6 .cse14) (and (= ssl3_connect_~s__state~0 4432) .cse0 .cse1) (and .cse14 .cse0 .cse1) (and .cse3 .cse1 .cse17) (and .cse6 .cse16 .cse1) (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse3 .cse10 .cse11 .cse1 .cse15) (and .cse4 .cse0 .cse1) (and .cse0 .cse1 (= 4416 ssl3_connect_~s__state~0)) (and .cse0 .cse1 .cse17)))) [2019-11-06 22:22:45,636 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 415) no Hoare annotation was computed. [2019-11-06 22:22:45,636 INFO L439 ceAbstractionStarter]: At program point L345(lines 85 575) the Hoare annotation is: (not (<= 12292 |ssl3_connect_#in~initial_state|)) [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L411-2(lines 211 509) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 521) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L147(lines 147 532) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 543) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 250) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L439 ceAbstractionStarter]: At program point L148(lines 144 533) the Hoare annotation is: (or (and (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (= ssl3_connect_~s__hit~0 0) (<= ssl3_connect_~s__state~0 4560)) (not (<= 12292 |ssl3_connect_#in~initial_state|))) [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L545(lines 545 561) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 382) no Hoare annotation was computed. [2019-11-06 22:22:45,637 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 349) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 283) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L314-2(lines 312 320) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 560) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L439 ceAbstractionStarter]: At program point L216(lines 114 543) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (<= ssl3_connect_~blastFlag~0 0)) [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L183(lines 183 520) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L150(lines 150 531) no Hoare annotation was computed. [2019-11-06 22:22:45,638 INFO L443 ceAbstractionStarter]: For program point L117(lines 117 542) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L446 ceAbstractionStarter]: At program point ssl3_connectENTRY(lines 11 576) the Hoare annotation is: true [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 552) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 546 560) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L439 ceAbstractionStarter]: At program point L184(lines 180 521) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 389) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L384-2(lines 384 389) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 519) no Hoare annotation was computed. [2019-11-06 22:22:45,639 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 530) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L120(lines 120 541) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L439 ceAbstractionStarter]: At program point L154(lines 150 531) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= 4432 ssl3_connect_~s__state~0) (<= ssl3_connect_~blastFlag~0 4) (<= ssl3_connect_~s__state~0 4560) (= ssl3_connect_~s__hit~0 0))) [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L485-1(lines 485 487) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 223) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L221-2(lines 221 223) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 423) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 518) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L156(lines 156 529) no Hoare annotation was computed. [2019-11-06 22:22:45,640 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 540) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L289(lines 289 295) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L439 ceAbstractionStarter]: At program point L190(lines 186 519) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 457) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 358) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point ssl3_connectEXIT(lines 11 576) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 261) no Hoare annotation was computed. [2019-11-06 22:22:45,641 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 517) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 528) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 539) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point ssl3_connectFINAL(lines 11 576) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L226(lines 226 229) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L292-2(lines 211 509) no Hoare annotation was computed. [2019-11-06 22:22:45,642 INFO L439 ceAbstractionStarter]: At program point L160(lines 156 529) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse1 (= ssl3_connect_~s__hit~0 0)) (.cse2 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse1 .cse2) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse1 .cse2))) [2019-11-06 22:22:45,642 INFO L443 ceAbstractionStarter]: For program point L94(lines 94 100) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 493) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 462) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L491-2(lines 491 493) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L458-2(lines 458 462) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 363) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L359-2(lines 359 363) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L195(lines 195 516) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L162(lines 162 527) no Hoare annotation was computed. [2019-11-06 22:22:45,643 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 538) no Hoare annotation was computed. [2019-11-06 22:22:45,644 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 330) no Hoare annotation was computed. [2019-11-06 22:22:45,644 INFO L443 ceAbstractionStarter]: For program point L328-2(lines 211 509) no Hoare annotation was computed. [2019-11-06 22:22:45,644 INFO L439 ceAbstractionStarter]: At program point L196(lines 192 517) the Hoare annotation is: (let ((.cse0 (<= 4432 ssl3_connect_~s__state~0)) (.cse2 (= ssl3_connect_~s__hit~0 0)) (.cse1 (<= ssl3_connect_~s__state~0 4560))) (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and .cse0 (<= ssl3_connect_~blastFlag~0 2) .cse1) (and .cse0 (<= ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2 .cse1) (and .cse0 (<= ssl3_connect_~blastFlag~0 4) .cse2 .cse1))) [2019-11-06 22:22:45,644 INFO L439 ceAbstractionStarter]: At program point L130(lines 126 539) the Hoare annotation is: (or (not (<= 12292 |ssl3_connect_#in~initial_state|)) (and (<= ssl3_connect_~blastFlag~0 0) (<= 4352 ssl3_connect_~s__state~0) (<= ssl3_connect_~s__state~0 4560))) [2019-11-06 22:22:45,644 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 99) no Hoare annotation was computed. [2019-11-06 22:22:45,644 INFO L443 ceAbstractionStarter]: For program point L97-2(lines 94 100) no Hoare annotation was computed. [2019-11-06 22:22:45,644 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 430) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L395(lines 395 397) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 515) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 526) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L132(lines 132 537) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 499) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L497-2(lines 497 499) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 303) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point L299-2(lines 299 303) no Hoare annotation was computed. [2019-11-06 22:22:45,645 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:22:45,646 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:22:45,646 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:22:45,646 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:22:45,646 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 577 587) the Hoare annotation is: true [2019-11-06 22:22:45,646 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 577 587) no Hoare annotation was computed. [2019-11-06 22:22:45,646 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 577 587) no Hoare annotation was computed. [2019-11-06 22:22:45,646 INFO L439 ceAbstractionStarter]: At program point L583(line 583) the Hoare annotation is: (<= 12292 main_~s~0) [2019-11-06 22:22:45,646 INFO L443 ceAbstractionStarter]: For program point L583-1(line 583) no Hoare annotation was computed. [2019-11-06 22:22:45,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:22:45 BoogieIcfgContainer [2019-11-06 22:22:45,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:22:45,671 INFO L168 Benchmark]: Toolchain (without parser) took 19301.15 ms. Allocated memory was 137.4 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 101.5 MB in the beginning and 902.8 MB in the end (delta: -801.3 MB). Peak memory consumption was 850.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,671 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.98 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 177.4 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,672 INFO L168 Benchmark]: Boogie Preprocessor took 56.62 ms. Allocated memory is still 202.4 MB. Free memory was 177.4 MB in the beginning and 175.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,673 INFO L168 Benchmark]: RCFGBuilder took 867.93 ms. Allocated memory is still 202.4 MB. Free memory was 175.3 MB in the beginning and 128.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,674 INFO L168 Benchmark]: TraceAbstraction took 17898.02 ms. Allocated memory was 202.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 127.3 MB in the beginning and 902.8 MB in the end (delta: -775.5 MB). Peak memory consumption was 811.6 MB. Max. memory is 7.1 GB. [2019-11-06 22:22:45,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 473.98 ms. Allocated memory was 137.4 MB in the beginning and 202.4 MB in the end (delta: 65.0 MB). Free memory was 101.3 MB in the beginning and 177.4 MB in the end (delta: -76.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.62 ms. Allocated memory is still 202.4 MB. Free memory was 177.4 MB in the beginning and 175.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 867.93 ms. Allocated memory is still 202.4 MB. Free memory was 175.3 MB in the beginning and 128.0 MB in the end (delta: 47.3 MB). Peak memory consumption was 47.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17898.02 ms. Allocated memory was 202.4 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 127.3 MB in the beginning and 902.8 MB in the end (delta: -775.5 MB). Peak memory consumption was 811.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 573]: 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 - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__state <= 4560) && s__hit == 0)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 198]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0)) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4352 <= s__state) && blastFlag <= 4) && s__hit == 0) && s__state <= 4560)) || (((blastFlag <= 2 && 4352 <= s__state) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 192]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 204]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0)) - InvariantResult [Line: 126]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 0 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || blastFlag <= 0 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (blastFlag <= 0 && 12292 <= s__state) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || (((4432 <= s__state && blastFlag <= 4) && s__state <= 4560) && s__hit == 0) - InvariantResult [Line: 207]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 144]: Loop Invariant Derived loop invariant: (((4352 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) || !(12292 <= \old(initial_state)) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((blastFlag <= 4 && s__hit == 0) && s__state == 4480) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4496) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4512) && s__hit == 0)) || (((blastFlag <= 2 && 4560 <= s__state) && s__state <= 4560) && !(s__hit == 0))) || ((((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 3) && s__state <= 4352) && 4352 <= s__state) && !(s__hit == 0))) || ((s__state == 4512 && blastFlag <= 4) && s__hit == 0)) || ((s__state <= 3 && blastFlag <= 2) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && 4464 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4512)) || ((s__s3__tmp__next_state___0 <= 4560 && s__state == 4528) && s__hit == 0)) || ((((s__s3__tmp__next_state___0 <= 4560 && 4560 <= s__state) && s__hit == 0) && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0)) || (blastFlag <= 0 && s__state == 4368)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (blastFlag <= 2 && 4384 == s__state)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && s__state == 4480)) || ((4464 == s__state && blastFlag <= 4) && s__hit == 0)) || (((s__s3__tmp__next_state___0 <= 4560 && blastFlag <= 4) && 4400 == s__state) && s__hit == 0)) || (blastFlag <= 2 && s__state == 4528)) || ((s__state == 4432 && blastFlag <= 4) && s__hit == 0)) || ((s__state == 4528 && blastFlag <= 4) && s__hit == 0)) || ((s__s3__tmp__next_state___0 <= 4560 && s__hit == 0) && 4448 == s__state)) || ((blastFlag <= 2 && 4400 == s__state) && s__hit == 0)) || !(12292 <= \old(initial_state))) || ((((s__s3__tmp__next_state___0 <= 4560 && s__state <= 4352) && 4352 <= s__state) && s__hit == 0) && 4560 <= s__s3__tmp__next_state___0)) || ((s__state == 4496 && blastFlag <= 4) && s__hit == 0)) || ((blastFlag <= 4 && s__hit == 0) && 4416 == s__state)) || ((blastFlag <= 4 && s__hit == 0) && 4448 == s__state) - InvariantResult [Line: 186]: Loop Invariant Derived loop invariant: ((!(12292 <= \old(initial_state)) || ((4432 <= s__state && blastFlag <= 2) && s__state <= 4560)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: !(12292 <= \old(initial_state)) || ((blastFlag <= 2 && 4352 <= s__state) && s__state <= 4560) - InvariantResult [Line: 174]: Loop Invariant Derived loop invariant: (!(12292 <= \old(initial_state)) || (((4432 <= s__state && s__s3__tmp__next_state___0 <= 4560) && s__hit == 0) && s__state <= 4560)) || (((4432 <= s__state && blastFlag <= 4) && s__hit == 0) && s__state <= 4560) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 136 locations, 1 error locations. Result: SAFE, OverallTime: 17.8s, OverallIterations: 27, TraceHistogramMax: 21, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 5438 SDtfs, 1928 SDslu, 3156 SDs, 0 SdLazy, 2637 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2693 GetRequests, 2651 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8460occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 5368 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 26 PreInvPairs, 240 NumberOfFragments, 690 HoareAnnotationTreeSize, 26 FomulaSimplifications, 21559 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 26 FomulaSimplificationsInter, 2257 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 9147 NumberOfCodeBlocks, 9147 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 9114 ConstructedInterpolants, 0 QuantifiedInterpolants, 4588776 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4745 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 33 InterpolantComputations, 24 PerfectInterpolantSequences, 37853/37946 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...