/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_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:23:05,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:23:05,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:23:05,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:23:05,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:23:05,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:23:05,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:23:05,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:23:05,042 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:23:05,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:23:05,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:23:05,049 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:23:05,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:23:05,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:23:05,052 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:23:05,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:23:05,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:23:05,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:23:05,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:23:05,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:23:05,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:23:05,068 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:23:05,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:23:05,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:23:05,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:23:05,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:23:05,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:23:05,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:23:05,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:23:05,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:23:05,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:23:05,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:23:05,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:23:05,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:23:05,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:23:05,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:23:05,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:23:05,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:23:05,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:23:05,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:23:05,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:23:05,081 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:23:05,095 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:23:05,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:23:05,096 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:23:05,096 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:23:05,097 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:23:05,097 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:23:05,097 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:23:05,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:23:05,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:23:05,098 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:23:05,098 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:23:05,098 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:23:05,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:23:05,098 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:23:05,099 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:23:05,099 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:23:05,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:23:05,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:23:05,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:23:05,100 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:23:05,100 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:23:05,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:23:05,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:23:05,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:23:05,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:23:05,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:23:05,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:23:05,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:23:05,101 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:23:05,380 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:23:05,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:23:05,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:23:05,399 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:23:05,399 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:23:05,400 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-06 22:23:05,472 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0503b4388/69709f1389ac436f8d32729200812698/FLAGa38796920 [2019-11-06 22:23:06,025 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:23:06,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-11-06 22:23:06,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0503b4388/69709f1389ac436f8d32729200812698/FLAGa38796920 [2019-11-06 22:23:06,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0503b4388/69709f1389ac436f8d32729200812698 [2019-11-06 22:23:06,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:23:06,317 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:23:06,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:06,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:23:06,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:23:06,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158aa3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06, skipping insertion in model container [2019-11-06 22:23:06,328 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,336 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:23:06,394 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:23:06,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:06,628 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:23:06,769 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:23:06,784 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:23:06,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06 WrapperNode [2019-11-06 22:23:06,785 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:23:06,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:23:06,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:23:06,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:23:06,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (1/1) ... [2019-11-06 22:23:06,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:23:06,845 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:23:06,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:23:06,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:23:06,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (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:23:06,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:23:06,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:23:06,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-11-06 22:23:06,914 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:23:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:23:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-06 22:23:06,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:23:06,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:23:07,094 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-06 22:23:07,758 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-06 22:23:07,759 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-06 22:23:07,764 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:23:07,764 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-06 22:23:07,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:07 BoogieIcfgContainer [2019-11-06 22:23:07,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:23:07,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:23:07,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:23:07,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:23:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:06" (1/3) ... [2019-11-06 22:23:07,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acd64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:07, skipping insertion in model container [2019-11-06 22:23:07,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:06" (2/3) ... [2019-11-06 22:23:07,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7acd64ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:07, skipping insertion in model container [2019-11-06 22:23:07,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:07" (3/3) ... [2019-11-06 22:23:07,786 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-11-06 22:23:07,796 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:23:07,804 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:23:07,815 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:23:07,843 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:23:07,844 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:23:07,844 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:23:07,844 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:23:07,844 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:23:07,844 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:23:07,844 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:23:07,845 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:23:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-11-06 22:23:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 22:23:07,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:07,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:07,883 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-11-06 22:23:07,896 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:07,896 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131255741] [2019-11-06 22:23:07,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,173 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:23:08,174 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131255741] [2019-11-06 22:23:08,175 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:08,175 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:08,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704122603] [2019-11-06 22:23:08,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:08,183 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:08,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:08,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:08,198 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-11-06 22:23:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:08,641 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-11-06 22:23:08,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:08,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-06 22:23:08,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:08,674 INFO L225 Difference]: With dead ends: 338 [2019-11-06 22:23:08,674 INFO L226 Difference]: Without dead ends: 176 [2019-11-06 22:23:08,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:08,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-11-06 22:23:08,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-11-06 22:23:08,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-06 22:23:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-11-06 22:23:08,759 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-11-06 22:23:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:08,760 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-11-06 22:23:08,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-11-06 22:23:08,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-06 22:23:08,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:08,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:08,763 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:08,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:08,763 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-11-06 22:23:08,764 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:08,764 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362183684] [2019-11-06 22:23:08,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:08,888 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:23:08,889 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362183684] [2019-11-06 22:23:08,889 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:08,889 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:08,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568324689] [2019-11-06 22:23:08,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:08,895 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:08,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:08,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:08,895 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-11-06 22:23:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:09,223 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-11-06 22:23:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:09,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-11-06 22:23:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:09,227 INFO L225 Difference]: With dead ends: 356 [2019-11-06 22:23:09,229 INFO L226 Difference]: Without dead ends: 204 [2019-11-06 22:23:09,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-06 22:23:09,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-11-06 22:23:09,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-06 22:23:09,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-11-06 22:23:09,276 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-11-06 22:23:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-11-06 22:23:09,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:09,281 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-11-06 22:23:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-06 22:23:09,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:09,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:09,287 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-11-06 22:23:09,287 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:09,288 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791541675] [2019-11-06 22:23:09,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:09,441 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:23:09,442 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791541675] [2019-11-06 22:23:09,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:09,442 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:09,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121440065] [2019-11-06 22:23:09,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:09,445 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:09,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:09,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:09,446 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-11-06 22:23:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:09,847 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-11-06 22:23:09,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:09,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-06 22:23:09,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:09,859 INFO L225 Difference]: With dead ends: 417 [2019-11-06 22:23:09,860 INFO L226 Difference]: Without dead ends: 237 [2019-11-06 22:23:09,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-06 22:23:09,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-11-06 22:23:09,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-06 22:23:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-11-06 22:23:09,896 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-11-06 22:23:09,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:09,899 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-11-06 22:23:09,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:09,899 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-11-06 22:23:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-06 22:23:09,904 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:09,904 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:09,904 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-11-06 22:23:09,905 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:09,905 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924169578] [2019-11-06 22:23:09,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,052 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:23:10,053 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924169578] [2019-11-06 22:23:10,053 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:10,053 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:10,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476935102] [2019-11-06 22:23:10,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:10,055 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:10,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:10,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:10,056 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-11-06 22:23:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:10,302 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-11-06 22:23:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:10,303 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-06 22:23:10,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:10,305 INFO L225 Difference]: With dead ends: 466 [2019-11-06 22:23:10,305 INFO L226 Difference]: Without dead ends: 248 [2019-11-06 22:23:10,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:10,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-06 22:23:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-11-06 22:23:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-06 22:23:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-11-06 22:23:10,321 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-11-06 22:23:10,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:10,322 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-11-06 22:23:10,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:10,322 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-11-06 22:23:10,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 22:23:10,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:10,325 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:23:10,325 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:10,326 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-11-06 22:23:10,326 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:10,326 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809518181] [2019-11-06 22:23:10,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:10,389 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809518181] [2019-11-06 22:23:10,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:10,390 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:10,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548068968] [2019-11-06 22:23:10,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:10,391 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:10,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:10,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:10,391 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-11-06 22:23:10,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:10,609 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-11-06 22:23:10,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:10,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-06 22:23:10,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:10,612 INFO L225 Difference]: With dead ends: 510 [2019-11-06 22:23:10,612 INFO L226 Difference]: Without dead ends: 281 [2019-11-06 22:23:10,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:10,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-06 22:23:10,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-11-06 22:23:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-06 22:23:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-11-06 22:23:10,629 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-11-06 22:23:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:10,629 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-11-06 22:23:10,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-11-06 22:23:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 22:23:10,631 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:10,631 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:23:10,632 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:10,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:10,632 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-11-06 22:23:10,632 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:10,632 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049486994] [2019-11-06 22:23:10,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:10,709 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049486994] [2019-11-06 22:23:10,710 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:10,710 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:10,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398581703] [2019-11-06 22:23:10,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:10,711 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:10,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:10,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:10,712 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-11-06 22:23:10,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:10,933 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-11-06 22:23:10,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:10,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-06 22:23:10,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:10,936 INFO L225 Difference]: With dead ends: 535 [2019-11-06 22:23:10,936 INFO L226 Difference]: Without dead ends: 281 [2019-11-06 22:23:10,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:10,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-06 22:23:10,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-11-06 22:23:10,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-06 22:23:10,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-11-06 22:23:10,951 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-11-06 22:23:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:10,952 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-11-06 22:23:10,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:10,952 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-11-06 22:23:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 22:23:10,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:10,954 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-06 22:23:10,954 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:10,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:10,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-11-06 22:23:10,955 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:10,955 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941952551] [2019-11-06 22:23:10,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:11,036 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941952551] [2019-11-06 22:23:11,036 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:11,037 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:11,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778639469] [2019-11-06 22:23:11,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:11,038 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:11,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:11,039 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-11-06 22:23:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:11,268 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-11-06 22:23:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:11,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-06 22:23:11,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:11,270 INFO L225 Difference]: With dead ends: 552 [2019-11-06 22:23:11,271 INFO L226 Difference]: Without dead ends: 298 [2019-11-06 22:23:11,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-11-06 22:23:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-11-06 22:23:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-11-06 22:23:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-11-06 22:23:11,289 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-11-06 22:23:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:11,289 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-11-06 22:23:11,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-11-06 22:23:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:11,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:11,291 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-06 22:23:11,291 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:11,291 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-11-06 22:23:11,292 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:11,292 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422511266] [2019-11-06 22:23:11,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:11,371 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422511266] [2019-11-06 22:23:11,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:11,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:11,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783292683] [2019-11-06 22:23:11,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:11,372 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:11,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:11,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:11,373 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-11-06 22:23:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:11,572 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-11-06 22:23:11,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:11,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-06 22:23:11,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:11,575 INFO L225 Difference]: With dead ends: 600 [2019-11-06 22:23:11,576 INFO L226 Difference]: Without dead ends: 315 [2019-11-06 22:23:11,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:11,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-06 22:23:11,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-11-06 22:23:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-11-06 22:23:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-11-06 22:23:11,594 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-11-06 22:23:11,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:11,594 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-11-06 22:23:11,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-11-06 22:23:11,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-06 22:23:11,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:11,596 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:11,596 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-11-06 22:23:11,597 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:11,597 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059901906] [2019-11-06 22:23:11,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:11,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059901906] [2019-11-06 22:23:11,674 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:11,674 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:11,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508278938] [2019-11-06 22:23:11,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:11,676 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:11,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:11,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:11,677 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-11-06 22:23:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:11,917 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-11-06 22:23:11,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:11,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-11-06 22:23:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:11,920 INFO L225 Difference]: With dead ends: 651 [2019-11-06 22:23:11,920 INFO L226 Difference]: Without dead ends: 351 [2019-11-06 22:23:11,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-06 22:23:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-06 22:23:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-06 22:23:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-11-06 22:23:11,939 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-11-06 22:23:11,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:11,939 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-11-06 22:23:11,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:11,939 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-11-06 22:23:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-06 22:23:11,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:11,941 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:11,941 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-11-06 22:23:11,942 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:11,942 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175837309] [2019-11-06 22:23:11,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:12,005 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175837309] [2019-11-06 22:23:12,007 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:12,008 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:12,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157306275] [2019-11-06 22:23:12,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:12,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:12,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:12,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:12,015 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-11-06 22:23:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:12,194 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-11-06 22:23:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:12,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-06 22:23:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:12,197 INFO L225 Difference]: With dead ends: 687 [2019-11-06 22:23:12,197 INFO L226 Difference]: Without dead ends: 351 [2019-11-06 22:23:12,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-06 22:23:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-06 22:23:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-06 22:23:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-11-06 22:23:12,220 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-11-06 22:23:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:12,220 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-11-06 22:23:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-11-06 22:23:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-06 22:23:12,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:12,222 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:23:12,222 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:12,225 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-11-06 22:23:12,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:12,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70049950] [2019-11-06 22:23:12,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:23:12,295 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70049950] [2019-11-06 22:23:12,295 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:12,295 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:12,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81882784] [2019-11-06 22:23:12,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:12,296 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:12,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:12,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:12,296 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-11-06 22:23:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:12,577 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-11-06 22:23:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:12,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-06 22:23:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:12,582 INFO L225 Difference]: With dead ends: 687 [2019-11-06 22:23:12,582 INFO L226 Difference]: Without dead ends: 351 [2019-11-06 22:23:12,584 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-06 22:23:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-11-06 22:23:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-11-06 22:23:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-11-06 22:23:12,607 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-11-06 22:23:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:12,607 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-11-06 22:23:12,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-11-06 22:23:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-06 22:23:12,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:12,609 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:12,610 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:12,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:12,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-11-06 22:23:12,610 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:12,610 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809555432] [2019-11-06 22:23:12,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 22:23:12,694 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809555432] [2019-11-06 22:23:12,695 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:12,695 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:12,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313992845] [2019-11-06 22:23:12,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:12,696 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:12,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:12,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:12,696 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-11-06 22:23:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:12,899 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-11-06 22:23:12,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:12,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-11-06 22:23:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:12,902 INFO L225 Difference]: With dead ends: 714 [2019-11-06 22:23:12,902 INFO L226 Difference]: Without dead ends: 378 [2019-11-06 22:23:12,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:12,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-06 22:23:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-11-06 22:23:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-06 22:23:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-11-06 22:23:12,922 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-11-06 22:23:12,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:12,923 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-11-06 22:23:12,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:12,923 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-11-06 22:23:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-06 22:23:12,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:12,924 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:12,925 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-11-06 22:23:12,925 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:12,926 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532552060] [2019-11-06 22:23:12,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-06 22:23:12,993 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532552060] [2019-11-06 22:23:12,993 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:12,994 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:12,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649900933] [2019-11-06 22:23:12,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:12,994 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:12,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:12,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:12,995 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-11-06 22:23:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:13,221 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-11-06 22:23:13,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:13,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-11-06 22:23:13,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:13,224 INFO L225 Difference]: With dead ends: 738 [2019-11-06 22:23:13,224 INFO L226 Difference]: Without dead ends: 378 [2019-11-06 22:23:13,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-11-06 22:23:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-11-06 22:23:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-11-06 22:23:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-11-06 22:23:13,248 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-11-06 22:23:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:13,248 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-11-06 22:23:13,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-11-06 22:23:13,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-06 22:23:13,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:13,250 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-11-06 22:23:13,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:13,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:13,251 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-11-06 22:23:13,251 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:13,252 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732768545] [2019-11-06 22:23:13,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-06 22:23:13,345 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732768545] [2019-11-06 22:23:13,345 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:13,346 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:13,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733606460] [2019-11-06 22:23:13,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:13,347 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:13,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:13,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:13,348 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-11-06 22:23:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:13,582 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-11-06 22:23:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:13,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-06 22:23:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:13,585 INFO L225 Difference]: With dead ends: 742 [2019-11-06 22:23:13,585 INFO L226 Difference]: Without dead ends: 382 [2019-11-06 22:23:13,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-06 22:23:13,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-11-06 22:23:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-06 22:23:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-11-06 22:23:13,605 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-11-06 22:23:13,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:13,606 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-11-06 22:23:13,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-11-06 22:23:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-06 22:23:13,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:13,608 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 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:23:13,608 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:13,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:13,608 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-11-06 22:23:13,609 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:13,609 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378243961] [2019-11-06 22:23:13,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:13,657 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378243961] [2019-11-06 22:23:13,657 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:13,657 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:13,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447137460] [2019-11-06 22:23:13,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:13,658 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:13,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:13,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:13,658 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-11-06 22:23:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:13,867 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-11-06 22:23:13,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:13,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-11-06 22:23:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:13,870 INFO L225 Difference]: With dead ends: 782 [2019-11-06 22:23:13,871 INFO L226 Difference]: Without dead ends: 413 [2019-11-06 22:23:13,872 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-06 22:23:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-11-06 22:23:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-06 22:23:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-11-06 22:23:13,892 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-11-06 22:23:13,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:13,892 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-11-06 22:23:13,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-11-06 22:23:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-06 22:23:13,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:13,894 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 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:23:13,895 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-11-06 22:23:13,895 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:13,895 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879301582] [2019-11-06 22:23:13,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:13,953 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879301582] [2019-11-06 22:23:13,955 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:13,955 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:13,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537435763] [2019-11-06 22:23:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:13,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:13,959 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-11-06 22:23:14,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:14,204 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-11-06 22:23:14,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:14,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-06 22:23:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:14,208 INFO L225 Difference]: With dead ends: 811 [2019-11-06 22:23:14,209 INFO L226 Difference]: Without dead ends: 413 [2019-11-06 22:23:14,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:14,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-11-06 22:23:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-11-06 22:23:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-06 22:23:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-11-06 22:23:14,247 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-11-06 22:23:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:14,248 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-11-06 22:23:14,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:14,248 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-11-06 22:23:14,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-06 22:23:14,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:14,252 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-06 22:23:14,252 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:14,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:14,252 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-11-06 22:23:14,253 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:14,253 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857768472] [2019-11-06 22:23:14,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-06 22:23:14,348 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857768472] [2019-11-06 22:23:14,348 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:14,348 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:14,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502103805] [2019-11-06 22:23:14,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:14,349 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:14,350 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-11-06 22:23:14,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:14,553 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-11-06 22:23:14,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:14,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-11-06 22:23:14,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:14,556 INFO L225 Difference]: With dead ends: 834 [2019-11-06 22:23:14,556 INFO L226 Difference]: Without dead ends: 436 [2019-11-06 22:23:14,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:14,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-06 22:23:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-06 22:23:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-06 22:23:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-11-06 22:23:14,581 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-11-06 22:23:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:14,581 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-11-06 22:23:14,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-11-06 22:23:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-06 22:23:14,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:14,584 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-06 22:23:14,584 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-11-06 22:23:14,584 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:14,585 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106012960] [2019-11-06 22:23:14,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-06 22:23:14,632 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106012960] [2019-11-06 22:23:14,632 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:14,632 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:14,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30298270] [2019-11-06 22:23:14,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:14,633 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:14,634 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-11-06 22:23:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:14,923 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-11-06 22:23:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:14,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-11-06 22:23:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:14,926 INFO L225 Difference]: With dead ends: 855 [2019-11-06 22:23:14,926 INFO L226 Difference]: Without dead ends: 436 [2019-11-06 22:23:14,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-06 22:23:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-11-06 22:23:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-11-06 22:23:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-11-06 22:23:14,950 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-11-06 22:23:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:14,950 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-11-06 22:23:14,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-11-06 22:23:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-06 22:23:14,952 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:14,952 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:14,952 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-11-06 22:23:14,953 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:14,953 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180042059] [2019-11-06 22:23:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:15,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180042059] [2019-11-06 22:23:15,055 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:15,055 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:15,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023340500] [2019-11-06 22:23:15,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:15,057 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:15,058 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-11-06 22:23:15,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:15,353 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-11-06 22:23:15,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:15,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-06 22:23:15,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:15,356 INFO L225 Difference]: With dead ends: 896 [2019-11-06 22:23:15,356 INFO L226 Difference]: Without dead ends: 477 [2019-11-06 22:23:15,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:15,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-11-06 22:23:15,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-11-06 22:23:15,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-06 22:23:15,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-11-06 22:23:15,399 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-11-06 22:23:15,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:15,400 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-11-06 22:23:15,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-11-06 22:23:15,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:23:15,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:15,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-06 22:23:15,404 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:15,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:15,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-11-06 22:23:15,404 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:15,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483364329] [2019-11-06 22:23:15,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-06 22:23:15,456 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483364329] [2019-11-06 22:23:15,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:15,456 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:15,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012270965] [2019-11-06 22:23:15,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:15,457 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:15,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:15,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:15,458 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-11-06 22:23:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:15,672 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-11-06 22:23:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:15,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-06 22:23:15,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:15,675 INFO L225 Difference]: With dead ends: 971 [2019-11-06 22:23:15,676 INFO L226 Difference]: Without dead ends: 510 [2019-11-06 22:23:15,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-06 22:23:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-11-06 22:23:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-11-06 22:23:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-11-06 22:23:15,701 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-11-06 22:23:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:15,702 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-11-06 22:23:15,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-11-06 22:23:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-06 22:23:15,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:15,704 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:15,704 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:15,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:15,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-11-06 22:23:15,705 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:15,705 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991308107] [2019-11-06 22:23:15,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-06 22:23:15,756 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991308107] [2019-11-06 22:23:15,757 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:15,757 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:15,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976649787] [2019-11-06 22:23:15,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:15,760 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:15,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:15,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:15,761 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-11-06 22:23:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:15,968 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-11-06 22:23:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:15,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-11-06 22:23:15,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:15,971 INFO L225 Difference]: With dead ends: 1010 [2019-11-06 22:23:15,971 INFO L226 Difference]: Without dead ends: 513 [2019-11-06 22:23:15,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-11-06 22:23:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-11-06 22:23:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-06 22:23:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-11-06 22:23:15,996 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-11-06 22:23:15,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:15,996 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-11-06 22:23:15,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-11-06 22:23:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-06 22:23:15,998 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:15,998 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:15,998 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:15,999 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-11-06 22:23:15,999 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:15,999 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166663236] [2019-11-06 22:23:15,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-06 22:23:16,048 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166663236] [2019-11-06 22:23:16,048 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:16,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:16,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832916230] [2019-11-06 22:23:16,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:16,049 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:16,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:16,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:16,050 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-11-06 22:23:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:16,270 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-11-06 22:23:16,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:16,273 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-06 22:23:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:16,276 INFO L225 Difference]: With dead ends: 1009 [2019-11-06 22:23:16,276 INFO L226 Difference]: Without dead ends: 512 [2019-11-06 22:23:16,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-06 22:23:16,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-11-06 22:23:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-11-06 22:23:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-11-06 22:23:16,313 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-11-06 22:23:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:16,313 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-11-06 22:23:16,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-11-06 22:23:16,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 22:23:16,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:16,318 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:16,334 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:16,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:16,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-11-06 22:23:16,334 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:16,335 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953537590] [2019-11-06 22:23:16,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,379 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-06 22:23:16,379 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953537590] [2019-11-06 22:23:16,379 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:16,379 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:16,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160233198] [2019-11-06 22:23:16,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:16,381 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:16,382 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-11-06 22:23:16,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:16,432 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-11-06 22:23:16,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:16,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-06 22:23:16,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:16,438 INFO L225 Difference]: With dead ends: 1497 [2019-11-06 22:23:16,438 INFO L226 Difference]: Without dead ends: 1000 [2019-11-06 22:23:16,440 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:23:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-11-06 22:23:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-11-06 22:23:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-11-06 22:23:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-11-06 22:23:16,470 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-11-06 22:23:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:16,470 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-11-06 22:23:16,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-11-06 22:23:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-06 22:23:16,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:16,472 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:16,473 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:16,473 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-11-06 22:23:16,474 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:16,474 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562582785] [2019-11-06 22:23:16,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-06 22:23:16,545 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562582785] [2019-11-06 22:23:16,545 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:16,545 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:16,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35450351] [2019-11-06 22:23:16,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:16,546 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:16,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:16,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:16,547 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-11-06 22:23:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:16,633 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-11-06 22:23:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:16,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-06 22:23:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:16,639 INFO L225 Difference]: With dead ends: 1505 [2019-11-06 22:23:16,639 INFO L226 Difference]: Without dead ends: 1007 [2019-11-06 22:23:16,640 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:23:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-06 22:23:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-11-06 22:23:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-11-06 22:23:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-11-06 22:23:16,688 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-11-06 22:23:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:16,689 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-11-06 22:23:16,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-11-06 22:23:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-06 22:23:16,691 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:16,691 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:16,692 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-11-06 22:23:16,692 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:16,692 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701844956] [2019-11-06 22:23:16,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-11-06 22:23:16,737 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701844956] [2019-11-06 22:23:16,737 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:16,738 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:16,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064737994] [2019-11-06 22:23:16,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:16,738 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:16,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:16,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:16,739 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-11-06 22:23:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:16,837 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-11-06 22:23:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:16,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-11-06 22:23:16,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:16,845 INFO L225 Difference]: With dead ends: 2499 [2019-11-06 22:23:16,845 INFO L226 Difference]: Without dead ends: 1505 [2019-11-06 22:23:16,848 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:23:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-11-06 22:23:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-11-06 22:23:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-06 22:23:16,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-11-06 22:23:16,940 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-11-06 22:23:16,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:16,941 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-11-06 22:23:16,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-11-06 22:23:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-06 22:23:16,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:16,944 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:16,944 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-11-06 22:23:16,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:16,945 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563761136] [2019-11-06 22:23:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-11-06 22:23:16,991 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563761136] [2019-11-06 22:23:16,991 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:16,991 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:16,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594621929] [2019-11-06 22:23:16,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:16,992 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:16,993 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-11-06 22:23:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:17,119 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-11-06 22:23:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:17,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-06 22:23:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:17,134 INFO L225 Difference]: With dead ends: 2003 [2019-11-06 22:23:17,134 INFO L226 Difference]: Without dead ends: 2001 [2019-11-06 22:23:17,135 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:23:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-11-06 22:23:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-11-06 22:23:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-11-06 22:23:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-11-06 22:23:17,286 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-11-06 22:23:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:17,287 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-11-06 22:23:17,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-11-06 22:23:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-06 22:23:17,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:17,294 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-06 22:23:17,294 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:17,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:17,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-11-06 22:23:17,295 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:17,295 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449737726] [2019-11-06 22:23:17,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:17,390 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-06 22:23:17,390 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449737726] [2019-11-06 22:23:17,390 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:17,391 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:17,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300047740] [2019-11-06 22:23:17,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:17,392 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:17,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:17,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:17,393 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-11-06 22:23:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:17,772 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-11-06 22:23:17,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:17,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-11-06 22:23:17,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:17,782 INFO L225 Difference]: With dead ends: 4173 [2019-11-06 22:23:17,783 INFO L226 Difference]: Without dead ends: 2187 [2019-11-06 22:23:17,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-11-06 22:23:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-11-06 22:23:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-11-06 22:23:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-11-06 22:23:17,940 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-11-06 22:23:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:17,940 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-11-06 22:23:17,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-11-06 22:23:17,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-06 22:23:17,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:17,945 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:17,945 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:17,946 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-11-06 22:23:17,946 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:17,946 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673503765] [2019-11-06 22:23:17,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-11-06 22:23:18,027 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673503765] [2019-11-06 22:23:18,027 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:18,027 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:23:18,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988617834] [2019-11-06 22:23:18,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:23:18,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:18,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:23:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:18,029 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-11-06 22:23:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:18,331 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-11-06 22:23:18,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:18,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-11-06 22:23:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:18,342 INFO L225 Difference]: With dead ends: 4337 [2019-11-06 22:23:18,342 INFO L226 Difference]: Without dead ends: 2155 [2019-11-06 22:23:18,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 22:23:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-11-06 22:23:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-11-06 22:23:18,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-06 22:23:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-11-06 22:23:18,473 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-11-06 22:23:18,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:18,474 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-11-06 22:23:18,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:23:18,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-11-06 22:23:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-06 22:23:18,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:18,483 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:18,483 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:18,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-11-06 22:23:18,484 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:18,484 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007385321] [2019-11-06 22:23:18,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-11-06 22:23:18,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007385321] [2019-11-06 22:23:18,595 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94627480] [2019-11-06 22:23:18,596 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:23:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:18,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-06 22:23:18,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-11-06 22:23:18,913 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:23:18,913 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:23:18,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716056164] [2019-11-06 22:23:18,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:18,915 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:18,915 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-11-06 22:23:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:19,093 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-11-06 22:23:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:19,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-06 22:23:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:19,107 INFO L225 Difference]: With dead ends: 4780 [2019-11-06 22:23:19,107 INFO L226 Difference]: Without dead ends: 2662 [2019-11-06 22:23:19,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 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:23:19,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-06 22:23:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-11-06 22:23:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-06 22:23:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-11-06 22:23:19,288 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-11-06 22:23:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:19,289 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-11-06 22:23:19,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-11-06 22:23:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-06 22:23:19,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:19,296 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1] [2019-11-06 22:23:19,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:19,502 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-11-06 22:23:19,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:19,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81565021] [2019-11-06 22:23:19,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-06 22:23:19,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81565021] [2019-11-06 22:23:19,578 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:19,578 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:19,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203190228] [2019-11-06 22:23:19,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:19,579 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:19,579 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-11-06 22:23:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:19,760 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-11-06 22:23:19,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:19,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-11-06 22:23:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:19,779 INFO L225 Difference]: With dead ends: 4249 [2019-11-06 22:23:19,779 INFO L226 Difference]: Without dead ends: 3189 [2019-11-06 22:23:19,785 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:23:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-11-06 22:23:19,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-11-06 22:23:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-06 22:23:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-11-06 22:23:20,000 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-11-06 22:23:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:20,000 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-11-06 22:23:20,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-11-06 22:23:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-11-06 22:23:20,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:20,010 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:20,010 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-11-06 22:23:20,011 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:20,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123558730] [2019-11-06 22:23:20,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-11-06 22:23:20,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123558730] [2019-11-06 22:23:20,103 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:20,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:20,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378644086] [2019-11-06 22:23:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:20,104 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:20,105 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-11-06 22:23:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:20,404 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-11-06 22:23:20,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:20,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-11-06 22:23:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:20,420 INFO L225 Difference]: With dead ends: 6425 [2019-11-06 22:23:20,420 INFO L226 Difference]: Without dead ends: 3249 [2019-11-06 22:23:20,427 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:23:20,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-11-06 22:23:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-11-06 22:23:20,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-06 22:23:20,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-11-06 22:23:20,585 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-11-06 22:23:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:20,586 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-11-06 22:23:20,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:20,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-11-06 22:23:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-11-06 22:23:20,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:20,595 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 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] [2019-11-06 22:23:20,596 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:20,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:20,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-11-06 22:23:20,596 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:20,596 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866250149] [2019-11-06 22:23:20,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-11-06 22:23:20,709 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866250149] [2019-11-06 22:23:20,709 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:20,709 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127450710] [2019-11-06 22:23:20,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:20,711 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:20,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:20,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:20,711 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-11-06 22:23:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:21,085 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-11-06 22:23:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:21,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-11-06 22:23:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:21,096 INFO L225 Difference]: With dead ends: 6461 [2019-11-06 22:23:21,096 INFO L226 Difference]: Without dead ends: 3285 [2019-11-06 22:23:21,104 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:23:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-11-06 22:23:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-11-06 22:23:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-11-06 22:23:21,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-11-06 22:23:21,341 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-11-06 22:23:21,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:21,342 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-11-06 22:23:21,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:21,342 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-11-06 22:23:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-11-06 22:23:21,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:21,357 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:23:21,358 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-11-06 22:23:21,358 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:21,358 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832336651] [2019-11-06 22:23:21,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-11-06 22:23:21,476 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832336651] [2019-11-06 22:23:21,476 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:21,476 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:21,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127501426] [2019-11-06 22:23:21,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:21,477 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:21,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:21,478 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-11-06 22:23:21,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:21,833 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-11-06 22:23:21,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:21,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-11-06 22:23:21,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:21,844 INFO L225 Difference]: With dead ends: 6469 [2019-11-06 22:23:21,844 INFO L226 Difference]: Without dead ends: 3293 [2019-11-06 22:23:21,854 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:23:21,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-11-06 22:23:22,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-11-06 22:23:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-11-06 22:23:22,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-11-06 22:23:22,079 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-11-06 22:23:22,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:22,080 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-11-06 22:23:22,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-11-06 22:23:22,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-06 22:23:22,095 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:22,096 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-11-06 22:23:22,096 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:22,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:22,097 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-11-06 22:23:22,097 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:22,097 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196791774] [2019-11-06 22:23:22,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-06 22:23:22,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196791774] [2019-11-06 22:23:22,268 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214875671] [2019-11-06 22:23:22,269 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:23:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:22,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:22,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:22,661 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-11-06 22:23:22,662 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 22:23:22,662 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-06 22:23:22,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109587745] [2019-11-06 22:23:22,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:22,664 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:22,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:22,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:23:22,664 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-11-06 22:23:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:23,035 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-11-06 22:23:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:23,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-06 22:23:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:23,049 INFO L225 Difference]: With dead ends: 9385 [2019-11-06 22:23:23,049 INFO L226 Difference]: Without dead ends: 6209 [2019-11-06 22:23:23,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 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:23:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-11-06 22:23:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-11-06 22:23:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-11-06 22:23:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-11-06 22:23:23,363 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-11-06 22:23:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:23,364 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-11-06 22:23:23,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:23,364 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-11-06 22:23:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-06 22:23:23,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:23,378 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 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] [2019-11-06 22:23:23,583 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:23,583 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-11-06 22:23:23,584 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:23,584 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675528433] [2019-11-06 22:23:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-06 22:23:23,758 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675528433] [2019-11-06 22:23:23,758 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962891910] [2019-11-06 22:23:23,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:23:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:23,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:23,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-11-06 22:23:24,068 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:24,068 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:24,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604635920] [2019-11-06 22:23:24,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:24,069 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:24,070 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 4 states. [2019-11-06 22:23:24,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:24,878 INFO L93 Difference]: Finished difference Result 17827 states and 23541 transitions. [2019-11-06 22:23:24,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:24,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-11-06 22:23:24,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:24,901 INFO L225 Difference]: With dead ends: 17827 [2019-11-06 22:23:24,901 INFO L226 Difference]: Without dead ends: 11483 [2019-11-06 22:23:24,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 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:23:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2019-11-06 22:23:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 6371. [2019-11-06 22:23:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6371 states. [2019-11-06 22:23:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 8489 transitions. [2019-11-06 22:23:25,308 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 8489 transitions. Word has length 294 [2019-11-06 22:23:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:25,309 INFO L462 AbstractCegarLoop]: Abstraction has 6371 states and 8489 transitions. [2019-11-06 22:23:25,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 8489 transitions. [2019-11-06 22:23:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-11-06 22:23:25,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:25,331 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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:23:25,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:25,536 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:25,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:25,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1875632044, now seen corresponding path program 1 times [2019-11-06 22:23:25,537 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:25,537 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307668398] [2019-11-06 22:23:25,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-06 22:23:25,645 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307668398] [2019-11-06 22:23:25,646 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435073671] [2019-11-06 22:23:25,646 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:23:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:25,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:25,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-06 22:23:25,812 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:25,813 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:25,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383577716] [2019-11-06 22:23:25,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:25,814 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:25,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:25,814 INFO L87 Difference]: Start difference. First operand 6371 states and 8489 transitions. Second operand 4 states. [2019-11-06 22:23:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:26,529 INFO L93 Difference]: Finished difference Result 14256 states and 18832 transitions. [2019-11-06 22:23:26,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:26,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-11-06 22:23:26,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:26,545 INFO L225 Difference]: With dead ends: 14256 [2019-11-06 22:23:26,545 INFO L226 Difference]: Without dead ends: 7894 [2019-11-06 22:23:26,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 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:23:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2019-11-06 22:23:26,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 6185. [2019-11-06 22:23:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2019-11-06 22:23:26,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 8189 transitions. [2019-11-06 22:23:26,823 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 8189 transitions. Word has length 303 [2019-11-06 22:23:26,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:26,824 INFO L462 AbstractCegarLoop]: Abstraction has 6185 states and 8189 transitions. [2019-11-06 22:23:26,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:26,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 8189 transitions. [2019-11-06 22:23:26,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-06 22:23:26,837 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:26,837 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:23:27,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:27,049 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:27,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:27,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-11-06 22:23:27,049 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:27,049 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999668966] [2019-11-06 22:23:27,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-11-06 22:23:27,135 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999668966] [2019-11-06 22:23:27,135 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:27,135 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:27,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791253772] [2019-11-06 22:23:27,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:27,136 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:27,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:27,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:27,136 INFO L87 Difference]: Start difference. First operand 6185 states and 8189 transitions. Second operand 3 states. [2019-11-06 22:23:27,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:27,583 INFO L93 Difference]: Finished difference Result 12737 states and 16878 transitions. [2019-11-06 22:23:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:27,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-11-06 22:23:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:27,597 INFO L225 Difference]: With dead ends: 12737 [2019-11-06 22:23:27,598 INFO L226 Difference]: Without dead ends: 6375 [2019-11-06 22:23:27,610 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:23:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-11-06 22:23:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6365. [2019-11-06 22:23:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2019-11-06 22:23:27,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8363 transitions. [2019-11-06 22:23:27,986 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8363 transitions. Word has length 312 [2019-11-06 22:23:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:27,986 INFO L462 AbstractCegarLoop]: Abstraction has 6365 states and 8363 transitions. [2019-11-06 22:23:27,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:27,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8363 transitions. [2019-11-06 22:23:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-11-06 22:23:28,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:28,002 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:23:28,003 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:28,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:28,003 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-11-06 22:23:28,003 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:28,003 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926743769] [2019-11-06 22:23:28,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-06 22:23:28,104 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926743769] [2019-11-06 22:23:28,104 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379116501] [2019-11-06 22:23:28,105 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:23:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:28,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:28,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-06 22:23:28,286 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:28,287 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:28,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838635818] [2019-11-06 22:23:28,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:28,288 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:28,288 INFO L87 Difference]: Start difference. First operand 6365 states and 8363 transitions. Second operand 4 states. [2019-11-06 22:23:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:28,917 INFO L93 Difference]: Finished difference Result 13086 states and 17000 transitions. [2019-11-06 22:23:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 22:23:28,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-11-06 22:23:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:28,934 INFO L225 Difference]: With dead ends: 13086 [2019-11-06 22:23:28,934 INFO L226 Difference]: Without dead ends: 6760 [2019-11-06 22:23:28,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 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:23:28,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-11-06 22:23:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 4064. [2019-11-06 22:23:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-11-06 22:23:29,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5188 transitions. [2019-11-06 22:23:29,150 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5188 transitions. Word has length 324 [2019-11-06 22:23:29,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:29,150 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5188 transitions. [2019-11-06 22:23:29,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:29,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5188 transitions. [2019-11-06 22:23:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-11-06 22:23:29,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:29,159 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:23:29,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:29,365 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:29,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:29,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-11-06 22:23:29,365 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:29,366 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804358230] [2019-11-06 22:23:29,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-11-06 22:23:29,461 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804358230] [2019-11-06 22:23:29,462 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:29,462 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:29,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035749581] [2019-11-06 22:23:29,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:29,464 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:29,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:29,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:29,464 INFO L87 Difference]: Start difference. First operand 4064 states and 5188 transitions. Second operand 3 states. [2019-11-06 22:23:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:29,760 INFO L93 Difference]: Finished difference Result 8219 states and 10471 transitions. [2019-11-06 22:23:29,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:29,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-11-06 22:23:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:29,769 INFO L225 Difference]: With dead ends: 8219 [2019-11-06 22:23:29,770 INFO L226 Difference]: Without dead ends: 4194 [2019-11-06 22:23:29,775 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:23:29,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2019-11-06 22:23:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4064. [2019-11-06 22:23:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-11-06 22:23:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5110 transitions. [2019-11-06 22:23:29,951 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5110 transitions. Word has length 327 [2019-11-06 22:23:29,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:29,951 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5110 transitions. [2019-11-06 22:23:29,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5110 transitions. [2019-11-06 22:23:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-06 22:23:29,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:29,959 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:29,959 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:29,959 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-11-06 22:23:29,959 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:29,960 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923306920] [2019-11-06 22:23:29,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-11-06 22:23:30,167 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923306920] [2019-11-06 22:23:30,167 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:30,167 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:30,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71437317] [2019-11-06 22:23:30,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:30,168 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:30,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:30,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:30,169 INFO L87 Difference]: Start difference. First operand 4064 states and 5110 transitions. Second operand 3 states. [2019-11-06 22:23:30,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:30,393 INFO L93 Difference]: Finished difference Result 7140 states and 9037 transitions. [2019-11-06 22:23:30,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:30,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-11-06 22:23:30,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:30,399 INFO L225 Difference]: With dead ends: 7140 [2019-11-06 22:23:30,399 INFO L226 Difference]: Without dead ends: 4120 [2019-11-06 22:23:30,404 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:23:30,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-11-06 22:23:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4064. [2019-11-06 22:23:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-11-06 22:23:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5104 transitions. [2019-11-06 22:23:30,582 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5104 transitions. Word has length 370 [2019-11-06 22:23:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:30,582 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5104 transitions. [2019-11-06 22:23:30,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5104 transitions. [2019-11-06 22:23:30,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-06 22:23:30,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:30,590 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-06 22:23:30,590 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:30,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-11-06 22:23:30,591 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:30,591 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107731587] [2019-11-06 22:23:30,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-11-06 22:23:30,732 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107731587] [2019-11-06 22:23:30,733 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:30,733 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:30,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181754925] [2019-11-06 22:23:30,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:30,734 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:30,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:30,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:30,735 INFO L87 Difference]: Start difference. First operand 4064 states and 5104 transitions. Second operand 3 states. [2019-11-06 22:23:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:30,984 INFO L93 Difference]: Finished difference Result 7559 states and 9508 transitions. [2019-11-06 22:23:30,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:30,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-06 22:23:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:30,989 INFO L225 Difference]: With dead ends: 7559 [2019-11-06 22:23:30,989 INFO L226 Difference]: Without dead ends: 3413 [2019-11-06 22:23:30,995 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:23:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-11-06 22:23:31,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3324. [2019-11-06 22:23:31,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-11-06 22:23:31,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4153 transitions. [2019-11-06 22:23:31,139 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4153 transitions. Word has length 393 [2019-11-06 22:23:31,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:31,139 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4153 transitions. [2019-11-06 22:23:31,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:31,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4153 transitions. [2019-11-06 22:23:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-06 22:23:31,146 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:31,146 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:31,146 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:31,146 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-11-06 22:23:31,147 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:31,147 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505237430] [2019-11-06 22:23:31,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-06 22:23:31,392 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505237430] [2019-11-06 22:23:31,392 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:23:31,392 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:23:31,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579851434] [2019-11-06 22:23:31,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:23:31,396 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:31,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:23:31,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:23:31,396 INFO L87 Difference]: Start difference. First operand 3324 states and 4153 transitions. Second operand 3 states. [2019-11-06 22:23:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:31,629 INFO L93 Difference]: Finished difference Result 6266 states and 7844 transitions. [2019-11-06 22:23:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:23:31,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-06 22:23:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:31,633 INFO L225 Difference]: With dead ends: 6266 [2019-11-06 22:23:31,634 INFO L226 Difference]: Without dead ends: 3336 [2019-11-06 22:23:31,637 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:23:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2019-11-06 22:23:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3324. [2019-11-06 22:23:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-11-06 22:23:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4147 transitions. [2019-11-06 22:23:31,776 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4147 transitions. Word has length 393 [2019-11-06 22:23:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:31,776 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4147 transitions. [2019-11-06 22:23:31,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:23:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4147 transitions. [2019-11-06 22:23:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-11-06 22:23:31,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:23:31,785 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:31,786 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:23:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:23:31,786 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-11-06 22:23:31,786 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:23:31,787 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528122945] [2019-11-06 22:23:31,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:23:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-06 22:23:31,989 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528122945] [2019-11-06 22:23:31,990 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666246094] [2019-11-06 22:23:31,990 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:23:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:23:32,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 22:23:32,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:23:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-11-06 22:23:32,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 22:23:32,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-06 22:23:32,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230634683] [2019-11-06 22:23:32,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:23:32,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:23:32,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:23:32,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:23:32,441 INFO L87 Difference]: Start difference. First operand 3324 states and 4147 transitions. Second operand 4 states. [2019-11-06 22:23:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:23:32,694 INFO L93 Difference]: Finished difference Result 5419 states and 6812 transitions. [2019-11-06 22:23:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:23:32,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-11-06 22:23:32,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:23:32,696 INFO L225 Difference]: With dead ends: 5419 [2019-11-06 22:23:32,696 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:23:32,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 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:23:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:23:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:23:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:23:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:23:32,704 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-11-06 22:23:32,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:23:32,704 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:23:32,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:23:32,704 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:23:32,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:23:32,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:23:32,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:23:33,103 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 158 [2019-11-06 22:23:33,234 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 158 [2019-11-06 22:23:33,386 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 156 [2019-11-06 22:23:35,801 WARN L191 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 669 DAG size of output: 413 [2019-11-06 22:23:36,057 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 183