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_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:44,206 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:44,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:44,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:44,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:44,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:44,233 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:44,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:44,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:44,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:44,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:44,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:44,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:44,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:44,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:44,261 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:44,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:44,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:44,265 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:44,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:44,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:44,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:44,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:44,284 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:44,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:44,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:44,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:44,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:44,291 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:44,292 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:44,292 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:44,294 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:44,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:44,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:44,297 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:44,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:44,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:44,298 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:44,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:44,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:44,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:44,302 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-10-14 23:49:44,340 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:44,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:44,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:44,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:44,346 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:44,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:44,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:44,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:44,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:44,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:44,350 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:44,351 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:44,351 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:44,351 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:44,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:44,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:44,352 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:44,352 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:44,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:44,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:44,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:44,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:44,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:44,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:44,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:44,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:44,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:44,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:44,354 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:44,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:44,703 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:44,708 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:44,710 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:44,711 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:44,712 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-14 23:49:44,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7643a044c/a8a76a24bd314717a033f38182491145/FLAGae7392364 [2019-10-14 23:49:45,370 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:45,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_3.cil.c [2019-10-14 23:49:45,384 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7643a044c/a8a76a24bd314717a033f38182491145/FLAGae7392364 [2019-10-14 23:49:45,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7643a044c/a8a76a24bd314717a033f38182491145 [2019-10-14 23:49:45,657 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:45,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:45,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:45,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:45,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:45,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:45" (1/1) ... [2019-10-14 23:49:45,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a29690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:45, skipping insertion in model container [2019-10-14 23:49:45,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:45" (1/1) ... [2019-10-14 23:49:45,680 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:45,746 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:46,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:46,027 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:46,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:46,182 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:46,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46 WrapperNode [2019-10-14 23:49:46,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:46,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:46,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:46,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:46,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,230 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... [2019-10-14 23:49:46,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:46,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:46,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:46,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:46,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:46,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:46,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:46,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:46,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:46,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:46,526 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:47,082 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:47,082 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:47,088 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:47,088 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:47,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:47 BoogieIcfgContainer [2019-10-14 23:49:47,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:47,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:47,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:47,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:47,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:45" (1/3) ... [2019-10-14 23:49:47,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748f262f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:47, skipping insertion in model container [2019-10-14 23:49:47,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:46" (2/3) ... [2019-10-14 23:49:47,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@748f262f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:47, skipping insertion in model container [2019-10-14 23:49:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:47" (3/3) ... [2019-10-14 23:49:47,113 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.cil.c [2019-10-14 23:49:47,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:47,135 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:47,147 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:47,183 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:47,184 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:47,184 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:47,184 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:47,185 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:47,185 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:47,185 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:47,185 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-14 23:49:47,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:49:47,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:47,261 INFO L380 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, 1, 1, 1] [2019-10-14 23:49:47,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:47,271 INFO L82 PathProgramCache]: Analyzing trace with hash 882212075, now seen corresponding path program 1 times [2019-10-14 23:49:47,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:47,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215977005] [2019-10-14 23:49:47,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:47,679 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215977005] [2019-10-14 23:49:47,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:47,680 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:47,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555109774] [2019-10-14 23:49:47,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:47,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:47,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:47,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:47,704 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-14 23:49:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,150 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-14 23:49:48,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:48,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-14 23:49:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,169 INFO L225 Difference]: With dead ends: 337 [2019-10-14 23:49:48,169 INFO L226 Difference]: Without dead ends: 180 [2019-10-14 23:49:48,174 INFO L600 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-10-14 23:49:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-14 23:49:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-14 23:49:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-14 23:49:48,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-14 23:49:48,241 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-14 23:49:48,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,242 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-14 23:49:48,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:48,242 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-14 23:49:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:49:48,245 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,245 INFO L380 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, 1, 1, 1, 1] [2019-10-14 23:49:48,246 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1571615886, now seen corresponding path program 1 times [2019-10-14 23:49:48,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,247 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155414815] [2019-10-14 23:49:48,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:48,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155414815] [2019-10-14 23:49:48,418 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574780062] [2019-10-14 23:49:48,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,423 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-14 23:49:48,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,788 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-14 23:49:48,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:48,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-14 23:49:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,797 INFO L225 Difference]: With dead ends: 385 [2019-10-14 23:49:48,797 INFO L226 Difference]: Without dead ends: 221 [2019-10-14 23:49:48,799 INFO L600 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-10-14 23:49:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-14 23:49:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-14 23:49:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-14 23:49:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-14 23:49:48,852 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-14 23:49:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,852 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-14 23:49:48,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-14 23:49:48,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:48,857 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,857 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:48,857 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1796709690, now seen corresponding path program 1 times [2019-10-14 23:49:48,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78200142] [2019-10-14 23:49:48,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,956 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:48,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78200142] [2019-10-14 23:49:48,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129782468] [2019-10-14 23:49:48,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,959 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-14 23:49:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,218 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-14 23:49:49,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-14 23:49:49,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,222 INFO L225 Difference]: With dead ends: 450 [2019-10-14 23:49:49,222 INFO L226 Difference]: Without dead ends: 247 [2019-10-14 23:49:49,224 INFO L600 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-10-14 23:49:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-14 23:49:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-14 23:49:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-14 23:49:49,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-14 23:49:49,248 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-14 23:49:49,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,251 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-14 23:49:49,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,251 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-14 23:49:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:49,261 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,261 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,261 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,265 INFO L82 PathProgramCache]: Analyzing trace with hash 903111100, now seen corresponding path program 1 times [2019-10-14 23:49:49,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838287915] [2019-10-14 23:49:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,393 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:49,394 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838287915] [2019-10-14 23:49:49,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,395 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414637207] [2019-10-14 23:49:49,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,398 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-14 23:49:49,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,607 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-14 23:49:49,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,608 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,611 INFO L225 Difference]: With dead ends: 498 [2019-10-14 23:49:49,611 INFO L226 Difference]: Without dead ends: 264 [2019-10-14 23:49:49,612 INFO L600 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-10-14 23:49:49,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-14 23:49:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-14 23:49:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-14 23:49:49,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-14 23:49:49,653 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-14 23:49:49,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,654 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-14 23:49:49,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,654 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-14 23:49:49,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:49,661 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,661 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,661 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,662 INFO L82 PathProgramCache]: Analyzing trace with hash -890466136, now seen corresponding path program 1 times [2019-10-14 23:49:49,662 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,662 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725301884] [2019-10-14 23:49:49,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,663 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,771 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:49,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725301884] [2019-10-14 23:49:49,772 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758350545] [2019-10-14 23:49:49,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,774 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-14 23:49:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,015 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-14 23:49:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:50,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,019 INFO L225 Difference]: With dead ends: 557 [2019-10-14 23:49:50,019 INFO L226 Difference]: Without dead ends: 308 [2019-10-14 23:49:50,020 INFO L600 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-10-14 23:49:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-14 23:49:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-14 23:49:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-14 23:49:50,035 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-14 23:49:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,035 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-14 23:49:50,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-14 23:49:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:50,038 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,038 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,038 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash -550567068, now seen corresponding path program 1 times [2019-10-14 23:49:50,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329626005] [2019-10-14 23:49:50,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:50,096 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329626005] [2019-10-14 23:49:50,096 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,096 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,096 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840894365] [2019-10-14 23:49:50,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,097 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,098 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-14 23:49:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,271 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-14 23:49:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,272 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,274 INFO L225 Difference]: With dead ends: 597 [2019-10-14 23:49:50,275 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:49:50,276 INFO L600 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-10-14 23:49:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:49:50,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-14 23:49:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-14 23:49:50,290 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-14 23:49:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,290 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-14 23:49:50,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-14 23:49:50,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:50,292 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,292 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,292 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,293 INFO L82 PathProgramCache]: Analyzing trace with hash -80048661, now seen corresponding path program 1 times [2019-10-14 23:49:50,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670194726] [2019-10-14 23:49:50,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,422 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:50,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670194726] [2019-10-14 23:49:50,422 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341875151] [2019-10-14 23:49:50,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,423 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,424 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-14 23:49:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,675 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-14 23:49:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:50,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,678 INFO L225 Difference]: With dead ends: 599 [2019-10-14 23:49:50,678 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:49:50,679 INFO L600 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-10-14 23:49:50,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:49:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-14 23:49:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-14 23:49:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-14 23:49:50,693 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-14 23:49:50,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,694 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-14 23:49:50,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-14 23:49:50,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:49:50,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,696 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,696 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,697 INFO L82 PathProgramCache]: Analyzing trace with hash 597213445, now seen corresponding path program 1 times [2019-10-14 23:49:50,697 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862354807] [2019-10-14 23:49:50,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-14 23:49:50,748 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862354807] [2019-10-14 23:49:50,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278648507] [2019-10-14 23:49:50,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,751 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-14 23:49:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,956 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-14 23:49:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:49:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,959 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:49:50,959 INFO L226 Difference]: Without dead ends: 311 [2019-10-14 23:49:50,961 INFO L600 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-10-14 23:49:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-14 23:49:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-14 23:49:50,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-14 23:49:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-14 23:49:50,979 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-14 23:49:50,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,980 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-14 23:49:50,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-14 23:49:50,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:49:50,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,982 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 301165919, now seen corresponding path program 1 times [2019-10-14 23:49:50,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642881731] [2019-10-14 23:49:50,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:51,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642881731] [2019-10-14 23:49:51,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,056 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702438615] [2019-10-14 23:49:51,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,060 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-14 23:49:51,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,305 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-14 23:49:51,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:49:51,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,310 INFO L225 Difference]: With dead ends: 640 [2019-10-14 23:49:51,310 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:51,311 INFO L600 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-10-14 23:49:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-14 23:49:51,328 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-14 23:49:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,329 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-14 23:49:51,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-14 23:49:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:49:51,342 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,342 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,343 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,343 INFO L82 PathProgramCache]: Analyzing trace with hash -283935385, now seen corresponding path program 1 times [2019-10-14 23:49:51,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55368178] [2019-10-14 23:49:51,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:51,404 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55368178] [2019-10-14 23:49:51,404 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,404 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870390922] [2019-10-14 23:49:51,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,406 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-14 23:49:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,600 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-14 23:49:51,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:49:51,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,603 INFO L225 Difference]: With dead ends: 669 [2019-10-14 23:49:51,603 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:51,605 INFO L600 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-10-14 23:49:51,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-14 23:49:51,619 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-14 23:49:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,620 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-14 23:49:51,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-14 23:49:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:49:51,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,622 INFO L380 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] [2019-10-14 23:49:51,622 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1626624529, now seen corresponding path program 1 times [2019-10-14 23:49:51,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412232040] [2019-10-14 23:49:51,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:51,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412232040] [2019-10-14 23:49:51,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430982699] [2019-10-14 23:49:51,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,686 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-14 23:49:51,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,914 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-14 23:49:51,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 23:49:51,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,917 INFO L225 Difference]: With dead ends: 702 [2019-10-14 23:49:51,917 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:51,918 INFO L600 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-10-14 23:49:51,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:51,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-14 23:49:51,934 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-14 23:49:51,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,935 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-14 23:49:51,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-14 23:49:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:51,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,937 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,937 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1291287383, now seen corresponding path program 1 times [2019-10-14 23:49:51,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392082703] [2019-10-14 23:49:51,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:51,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392082703] [2019-10-14 23:49:51,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605509087] [2019-10-14 23:49:51,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,996 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-14 23:49:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,206 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-14 23:49:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,210 INFO L225 Difference]: With dead ends: 729 [2019-10-14 23:49:52,210 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:52,211 INFO L600 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-10-14 23:49:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-14 23:49:52,228 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-14 23:49:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,229 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-14 23:49:52,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-14 23:49:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:49:52,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,231 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,231 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1329985514, now seen corresponding path program 1 times [2019-10-14 23:49:52,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136716763] [2019-10-14 23:49:52,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:52,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136716763] [2019-10-14 23:49:52,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039317474] [2019-10-14 23:49:52,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,289 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-14 23:49:52,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,605 INFO L93 Difference]: Finished difference Result 746 states and 1198 transitions. [2019-10-14 23:49:52,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-14 23:49:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,608 INFO L225 Difference]: With dead ends: 746 [2019-10-14 23:49:52,608 INFO L226 Difference]: Without dead ends: 392 [2019-10-14 23:49:52,609 INFO L600 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-10-14 23:49:52,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-14 23:49:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-14 23:49:52,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:52,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-14 23:49:52,628 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-14 23:49:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,628 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-14 23:49:52,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,628 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-14 23:49:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:49:52,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,631 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,631 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1711185522, now seen corresponding path program 1 times [2019-10-14 23:49:52,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896342005] [2019-10-14 23:49:52,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:52,698 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896342005] [2019-10-14 23:49:52,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,699 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885830841] [2019-10-14 23:49:52,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,700 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,700 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-14 23:49:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,938 INFO L93 Difference]: Finished difference Result 767 states and 1221 transitions. [2019-10-14 23:49:52,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-14 23:49:52,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,941 INFO L225 Difference]: With dead ends: 767 [2019-10-14 23:49:52,941 INFO L226 Difference]: Without dead ends: 392 [2019-10-14 23:49:52,943 INFO L600 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-10-14 23:49:52,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-10-14 23:49:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-10-14 23:49:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:52,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-14 23:49:52,961 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-14 23:49:52,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,961 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-14 23:49:52,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-14 23:49:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-14 23:49:52,964 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,964 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:52,964 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1344904457, now seen corresponding path program 1 times [2019-10-14 23:49:52,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616544602] [2019-10-14 23:49:52,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-14 23:49:53,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616544602] [2019-10-14 23:49:53,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:53,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290788884] [2019-10-14 23:49:53,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:53,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:53,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,020 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-14 23:49:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,069 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-14 23:49:53,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:53,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-14 23:49:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,074 INFO L225 Difference]: With dead ends: 763 [2019-10-14 23:49:53,075 INFO L226 Difference]: Without dead ends: 761 [2019-10-14 23:49:53,077 INFO L600 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-10-14 23:49:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-14 23:49:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-14 23:49:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-14 23:49:53,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-14 23:49:53,109 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-14 23:49:53,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,109 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-14 23:49:53,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-14 23:49:53,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:53,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,112 INFO L380 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, 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] [2019-10-14 23:49:53,113 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,113 INFO L82 PathProgramCache]: Analyzing trace with hash -773137702, now seen corresponding path program 1 times [2019-10-14 23:49:53,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566772829] [2019-10-14 23:49:53,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,184 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:53,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566772829] [2019-10-14 23:49:53,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,191 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,191 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677615184] [2019-10-14 23:49:53,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,192 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,192 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 5 states. [2019-10-14 23:49:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,450 INFO L93 Difference]: Finished difference Result 1593 states and 2521 transitions. [2019-10-14 23:49:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-14 23:49:53,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,456 INFO L225 Difference]: With dead ends: 1593 [2019-10-14 23:49:53,456 INFO L226 Difference]: Without dead ends: 845 [2019-10-14 23:49:53,459 INFO L600 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-10-14 23:49:53,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2019-10-14 23:49:53,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2019-10-14 23:49:53,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-10-14 23:49:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1319 transitions. [2019-10-14 23:49:53,514 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1319 transitions. Word has length 127 [2019-10-14 23:49:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,515 INFO L462 AbstractCegarLoop]: Abstraction has 837 states and 1319 transitions. [2019-10-14 23:49:53,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1319 transitions. [2019-10-14 23:49:53,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-14 23:49:53,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,520 INFO L380 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, 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] [2019-10-14 23:49:53,521 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,521 INFO L82 PathProgramCache]: Analyzing trace with hash -260517251, now seen corresponding path program 1 times [2019-10-14 23:49:53,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438670074] [2019-10-14 23:49:53,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,624 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:53,625 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438670074] [2019-10-14 23:49:53,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,625 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,626 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664790768] [2019-10-14 23:49:53,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,627 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,627 INFO L87 Difference]: Start difference. First operand 837 states and 1319 transitions. Second operand 5 states. [2019-10-14 23:49:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,978 INFO L93 Difference]: Finished difference Result 1669 states and 2633 transitions. [2019-10-14 23:49:53,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-14 23:49:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,985 INFO L225 Difference]: With dead ends: 1669 [2019-10-14 23:49:53,985 INFO L226 Difference]: Without dead ends: 841 [2019-10-14 23:49:53,988 INFO L600 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-10-14 23:49:53,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2019-10-14 23:49:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 833. [2019-10-14 23:49:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 833 states. [2019-10-14 23:49:54,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1307 transitions. [2019-10-14 23:49:54,030 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1307 transitions. Word has length 128 [2019-10-14 23:49:54,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,030 INFO L462 AbstractCegarLoop]: Abstraction has 833 states and 1307 transitions. [2019-10-14 23:49:54,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1307 transitions. [2019-10-14 23:49:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-14 23:49:54,034 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,034 INFO L380 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,035 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1086305590, now seen corresponding path program 1 times [2019-10-14 23:49:54,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793286139] [2019-10-14 23:49:54,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-14 23:49:54,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793286139] [2019-10-14 23:49:54,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544657585] [2019-10-14 23:49:54,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,106 INFO L87 Difference]: Start difference. First operand 833 states and 1307 transitions. Second operand 5 states. [2019-10-14 23:49:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,370 INFO L93 Difference]: Finished difference Result 1729 states and 2717 transitions. [2019-10-14 23:49:54,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-14 23:49:54,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,375 INFO L225 Difference]: With dead ends: 1729 [2019-10-14 23:49:54,375 INFO L226 Difference]: Without dead ends: 909 [2019-10-14 23:49:54,377 INFO L600 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-10-14 23:49:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-10-14 23:49:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 905. [2019-10-14 23:49:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-14 23:49:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1415 transitions. [2019-10-14 23:49:54,415 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1415 transitions. Word has length 160 [2019-10-14 23:49:54,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,416 INFO L462 AbstractCegarLoop]: Abstraction has 905 states and 1415 transitions. [2019-10-14 23:49:54,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,416 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1415 transitions. [2019-10-14 23:49:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-14 23:49:54,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,419 INFO L380 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, 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] [2019-10-14 23:49:54,420 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,420 INFO L82 PathProgramCache]: Analyzing trace with hash -643380505, now seen corresponding path program 1 times [2019-10-14 23:49:54,420 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,420 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22811624] [2019-10-14 23:49:54,420 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,479 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-14 23:49:54,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22811624] [2019-10-14 23:49:54,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,480 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,480 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363970478] [2019-10-14 23:49:54,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,482 INFO L87 Difference]: Start difference. First operand 905 states and 1415 transitions. Second operand 5 states. [2019-10-14 23:49:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,784 INFO L93 Difference]: Finished difference Result 1801 states and 2817 transitions. [2019-10-14 23:49:54,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-14 23:49:54,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,791 INFO L225 Difference]: With dead ends: 1801 [2019-10-14 23:49:54,791 INFO L226 Difference]: Without dead ends: 905 [2019-10-14 23:49:54,793 INFO L600 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-10-14 23:49:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-10-14 23:49:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 901. [2019-10-14 23:49:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-14 23:49:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1401 transitions. [2019-10-14 23:49:54,847 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1401 transitions. Word has length 161 [2019-10-14 23:49:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,848 INFO L462 AbstractCegarLoop]: Abstraction has 901 states and 1401 transitions. [2019-10-14 23:49:54,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1401 transitions. [2019-10-14 23:49:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-14 23:49:54,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,854 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,855 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,855 INFO L82 PathProgramCache]: Analyzing trace with hash -306607681, now seen corresponding path program 1 times [2019-10-14 23:49:54,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034439008] [2019-10-14 23:49:54,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-14 23:49:54,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034439008] [2019-10-14 23:49:54,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418346882] [2019-10-14 23:49:54,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,960 INFO L87 Difference]: Start difference. First operand 901 states and 1401 transitions. Second operand 5 states. [2019-10-14 23:49:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,210 INFO L93 Difference]: Finished difference Result 1861 states and 2897 transitions. [2019-10-14 23:49:55,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-10-14 23:49:55,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,216 INFO L225 Difference]: With dead ends: 1861 [2019-10-14 23:49:55,216 INFO L226 Difference]: Without dead ends: 973 [2019-10-14 23:49:55,218 INFO L600 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-10-14 23:49:55,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-10-14 23:49:55,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 969. [2019-10-14 23:49:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-10-14 23:49:55,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1499 transitions. [2019-10-14 23:49:55,261 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1499 transitions. Word has length 191 [2019-10-14 23:49:55,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,261 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 1499 transitions. [2019-10-14 23:49:55,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,261 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1499 transitions. [2019-10-14 23:49:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 23:49:55,266 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,266 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,266 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1259797154, now seen corresponding path program 1 times [2019-10-14 23:49:55,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70637483] [2019-10-14 23:49:55,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,361 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2019-10-14 23:49:55,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70637483] [2019-10-14 23:49:55,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971448832] [2019-10-14 23:49:55,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,371 INFO L87 Difference]: Start difference. First operand 969 states and 1499 transitions. Second operand 5 states. [2019-10-14 23:49:55,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,699 INFO L93 Difference]: Finished difference Result 1929 states and 2985 transitions. [2019-10-14 23:49:55,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-14 23:49:55,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,707 INFO L225 Difference]: With dead ends: 1929 [2019-10-14 23:49:55,707 INFO L226 Difference]: Without dead ends: 969 [2019-10-14 23:49:55,711 INFO L600 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-10-14 23:49:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2019-10-14 23:49:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 965. [2019-10-14 23:49:55,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-10-14 23:49:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1483 transitions. [2019-10-14 23:49:55,779 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1483 transitions. Word has length 192 [2019-10-14 23:49:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,779 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1483 transitions. [2019-10-14 23:49:55,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1483 transitions. [2019-10-14 23:49:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-14 23:49:55,786 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,786 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1] [2019-10-14 23:49:55,787 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,787 INFO L82 PathProgramCache]: Analyzing trace with hash 637510067, now seen corresponding path program 1 times [2019-10-14 23:49:55,788 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709484332] [2019-10-14 23:49:55,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,788 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-14 23:49:55,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709484332] [2019-10-14 23:49:55,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375822020] [2019-10-14 23:49:55,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,920 INFO L87 Difference]: Start difference. First operand 965 states and 1483 transitions. Second operand 5 states. [2019-10-14 23:49:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,168 INFO L93 Difference]: Finished difference Result 1993 states and 3073 transitions. [2019-10-14 23:49:56,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 209 [2019-10-14 23:49:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,174 INFO L225 Difference]: With dead ends: 1993 [2019-10-14 23:49:56,175 INFO L226 Difference]: Without dead ends: 1041 [2019-10-14 23:49:56,179 INFO L600 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-10-14 23:49:56,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-14 23:49:56,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-14 23:49:56,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-14 23:49:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1547 transitions. [2019-10-14 23:49:56,226 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1547 transitions. Word has length 209 [2019-10-14 23:49:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,226 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1547 transitions. [2019-10-14 23:49:56,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1547 transitions. [2019-10-14 23:49:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-14 23:49:56,230 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,231 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1] [2019-10-14 23:49:56,231 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1262219653, now seen corresponding path program 1 times [2019-10-14 23:49:56,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448230825] [2019-10-14 23:49:56,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-14 23:49:56,333 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448230825] [2019-10-14 23:49:56,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,334 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765367709] [2019-10-14 23:49:56,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,336 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,337 INFO L87 Difference]: Start difference. First operand 1015 states and 1547 transitions. Second operand 5 states. [2019-10-14 23:49:56,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,570 INFO L93 Difference]: Finished difference Result 2043 states and 3119 transitions. [2019-10-14 23:49:56,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-10-14 23:49:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,576 INFO L225 Difference]: With dead ends: 2043 [2019-10-14 23:49:56,576 INFO L226 Difference]: Without dead ends: 1041 [2019-10-14 23:49:56,579 INFO L600 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-10-14 23:49:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-10-14 23:49:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1015. [2019-10-14 23:49:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-14 23:49:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1529 transitions. [2019-10-14 23:49:56,625 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1529 transitions. Word has length 210 [2019-10-14 23:49:56,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,626 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1529 transitions. [2019-10-14 23:49:56,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1529 transitions. [2019-10-14 23:49:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-14 23:49:56,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,631 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,631 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1315202570, now seen corresponding path program 1 times [2019-10-14 23:49:56,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887546871] [2019-10-14 23:49:56,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-14 23:49:56,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887546871] [2019-10-14 23:49:56,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302927702] [2019-10-14 23:49:56,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,774 INFO L87 Difference]: Start difference. First operand 1015 states and 1529 transitions. Second operand 5 states. [2019-10-14 23:49:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,080 INFO L93 Difference]: Finished difference Result 2025 states and 3051 transitions. [2019-10-14 23:49:57,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-10-14 23:49:57,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,087 INFO L225 Difference]: With dead ends: 2025 [2019-10-14 23:49:57,087 INFO L226 Difference]: Without dead ends: 1023 [2019-10-14 23:49:57,092 INFO L600 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-10-14 23:49:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-10-14 23:49:57,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1015. [2019-10-14 23:49:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1015 states. [2019-10-14 23:49:57,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1517 transitions. [2019-10-14 23:49:57,144 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1517 transitions. Word has length 222 [2019-10-14 23:49:57,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,145 INFO L462 AbstractCegarLoop]: Abstraction has 1015 states and 1517 transitions. [2019-10-14 23:49:57,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1517 transitions. [2019-10-14 23:49:57,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-14 23:49:57,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,150 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,150 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1975125977, now seen corresponding path program 1 times [2019-10-14 23:49:57,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174531385] [2019-10-14 23:49:57,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2019-10-14 23:49:57,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174531385] [2019-10-14 23:49:57,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211019724] [2019-10-14 23:49:57,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,248 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,248 INFO L87 Difference]: Start difference. First operand 1015 states and 1517 transitions. Second operand 5 states. [2019-10-14 23:49:57,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,497 INFO L93 Difference]: Finished difference Result 2025 states and 3027 transitions. [2019-10-14 23:49:57,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2019-10-14 23:49:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,503 INFO L225 Difference]: With dead ends: 2025 [2019-10-14 23:49:57,503 INFO L226 Difference]: Without dead ends: 1005 [2019-10-14 23:49:57,506 INFO L600 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-10-14 23:49:57,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-10-14 23:49:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 997. [2019-10-14 23:49:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-10-14 23:49:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1479 transitions. [2019-10-14 23:49:57,565 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1479 transitions. Word has length 223 [2019-10-14 23:49:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,565 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1479 transitions. [2019-10-14 23:49:57,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1479 transitions. [2019-10-14 23:49:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-14 23:49:57,571 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,571 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,571 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1054088717, now seen corresponding path program 1 times [2019-10-14 23:49:57,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363151437] [2019-10-14 23:49:57,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-14 23:49:57,681 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363151437] [2019-10-14 23:49:57,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678709313] [2019-10-14 23:49:57,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,683 INFO L87 Difference]: Start difference. First operand 997 states and 1479 transitions. Second operand 5 states. [2019-10-14 23:49:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,903 INFO L93 Difference]: Finished difference Result 2035 states and 3025 transitions. [2019-10-14 23:49:57,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 230 [2019-10-14 23:49:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,910 INFO L225 Difference]: With dead ends: 2035 [2019-10-14 23:49:57,910 INFO L226 Difference]: Without dead ends: 1051 [2019-10-14 23:49:57,913 INFO L600 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-10-14 23:49:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-10-14 23:49:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1043. [2019-10-14 23:49:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-10-14 23:49:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1533 transitions. [2019-10-14 23:49:57,963 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1533 transitions. Word has length 230 [2019-10-14 23:49:57,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,963 INFO L462 AbstractCegarLoop]: Abstraction has 1043 states and 1533 transitions. [2019-10-14 23:49:57,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1533 transitions. [2019-10-14 23:49:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-14 23:49:57,968 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,968 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,968 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash 364858085, now seen corresponding path program 1 times [2019-10-14 23:49:57,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475820985] [2019-10-14 23:49:57,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,042 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 367 trivial. 0 not checked. [2019-10-14 23:49:58,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475820985] [2019-10-14 23:49:58,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725603593] [2019-10-14 23:49:58,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,044 INFO L87 Difference]: Start difference. First operand 1043 states and 1533 transitions. Second operand 5 states. [2019-10-14 23:49:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,257 INFO L93 Difference]: Finished difference Result 2081 states and 3059 transitions. [2019-10-14 23:49:58,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-10-14 23:49:58,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,263 INFO L225 Difference]: With dead ends: 2081 [2019-10-14 23:49:58,263 INFO L226 Difference]: Without dead ends: 1043 [2019-10-14 23:49:58,266 INFO L600 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-10-14 23:49:58,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-10-14 23:49:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1035. [2019-10-14 23:49:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-10-14 23:49:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1501 transitions. [2019-10-14 23:49:58,334 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1501 transitions. Word has length 231 [2019-10-14 23:49:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,334 INFO L462 AbstractCegarLoop]: Abstraction has 1035 states and 1501 transitions. [2019-10-14 23:49:58,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1501 transitions. [2019-10-14 23:49:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-14 23:49:58,339 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,340 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,340 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -567208800, now seen corresponding path program 1 times [2019-10-14 23:49:58,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836960691] [2019-10-14 23:49:58,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 466 proven. 26 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-14 23:49:58,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836960691] [2019-10-14 23:49:58,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267119664] [2019-10-14 23:49:58,437 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-10-14 23:49:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:49:58,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:58,699 INFO L134 CoverageAnalysis]: Checked inductivity of 675 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-14 23:49:58,699 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:58,699 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:58,700 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632925491] [2019-10-14 23:49:58,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:58,701 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:58,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,701 INFO L87 Difference]: Start difference. First operand 1035 states and 1501 transitions. Second operand 3 states. [2019-10-14 23:49:58,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,815 INFO L93 Difference]: Finished difference Result 2567 states and 3726 transitions. [2019-10-14 23:49:58,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:58,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 267 [2019-10-14 23:49:58,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,824 INFO L225 Difference]: With dead ends: 2567 [2019-10-14 23:49:58,824 INFO L226 Difference]: Without dead ends: 1545 [2019-10-14 23:49:58,827 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2019-10-14 23:49:58,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1545. [2019-10-14 23:49:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1545 states. [2019-10-14 23:49:58,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2241 transitions. [2019-10-14 23:49:58,938 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2241 transitions. Word has length 267 [2019-10-14 23:49:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,939 INFO L462 AbstractCegarLoop]: Abstraction has 1545 states and 2241 transitions. [2019-10-14 23:49:58,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:58,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2241 transitions. [2019-10-14 23:49:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-14 23:49:58,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,946 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:59,162 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 767374129, now seen corresponding path program 1 times [2019-10-14 23:49:59,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697884192] [2019-10-14 23:49:59,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-10-14 23:49:59,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697884192] [2019-10-14 23:49:59,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686689252] [2019-10-14 23:49:59,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,401 INFO L87 Difference]: Start difference. First operand 1545 states and 2241 transitions. Second operand 3 states. [2019-10-14 23:49:59,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,554 INFO L93 Difference]: Finished difference Result 4528 states and 6569 transitions. [2019-10-14 23:49:59,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-14 23:49:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,570 INFO L225 Difference]: With dead ends: 4528 [2019-10-14 23:49:59,570 INFO L226 Difference]: Without dead ends: 2996 [2019-10-14 23:49:59,576 INFO L600 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-10-14 23:49:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-10-14 23:49:59,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2994. [2019-10-14 23:49:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2994 states. [2019-10-14 23:49:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 4335 transitions. [2019-10-14 23:49:59,744 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 4335 transitions. Word has length 274 [2019-10-14 23:49:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,745 INFO L462 AbstractCegarLoop]: Abstraction has 2994 states and 4335 transitions. [2019-10-14 23:49:59,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 4335 transitions. [2019-10-14 23:49:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-14 23:49:59,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,755 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,756 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1658002288, now seen corresponding path program 1 times [2019-10-14 23:49:59,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671519295] [2019-10-14 23:49:59,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2019-10-14 23:49:59,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671519295] [2019-10-14 23:49:59,889 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,889 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,889 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157187323] [2019-10-14 23:49:59,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,890 INFO L87 Difference]: Start difference. First operand 2994 states and 4335 transitions. Second operand 3 states. [2019-10-14 23:50:00,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,237 INFO L93 Difference]: Finished difference Result 6095 states and 8845 transitions. [2019-10-14 23:50:00,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 311 [2019-10-14 23:50:00,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,251 INFO L225 Difference]: With dead ends: 6095 [2019-10-14 23:50:00,251 INFO L226 Difference]: Without dead ends: 1997 [2019-10-14 23:50:00,263 INFO L600 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-10-14 23:50:00,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-10-14 23:50:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1977. [2019-10-14 23:50:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1977 states. [2019-10-14 23:50:00,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2813 transitions. [2019-10-14 23:50:00,405 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2813 transitions. Word has length 311 [2019-10-14 23:50:00,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,405 INFO L462 AbstractCegarLoop]: Abstraction has 1977 states and 2813 transitions. [2019-10-14 23:50:00,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2813 transitions. [2019-10-14 23:50:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-10-14 23:50:00,414 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,414 INFO L380 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2019-10-14 23:50:00,415 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -872859034, now seen corresponding path program 1 times [2019-10-14 23:50:00,416 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,416 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571774975] [2019-10-14 23:50:00,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-14 23:50:00,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571774975] [2019-10-14 23:50:00,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694997766] [2019-10-14 23:50:00,728 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-10-14 23:50:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:00,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 905 proven. 26 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-10-14 23:50:01,014 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:01,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:01,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640384776] [2019-10-14 23:50:01,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:01,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:01,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:01,020 INFO L87 Difference]: Start difference. First operand 1977 states and 2813 transitions. Second operand 4 states. [2019-10-14 23:50:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,481 INFO L93 Difference]: Finished difference Result 4590 states and 6521 transitions. [2019-10-14 23:50:01,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:01,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-10-14 23:50:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,498 INFO L225 Difference]: With dead ends: 4590 [2019-10-14 23:50:01,498 INFO L226 Difference]: Without dead ends: 2582 [2019-10-14 23:50:01,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 381 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-10-14 23:50:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2582 states. [2019-10-14 23:50:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2582 to 1954. [2019-10-14 23:50:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-14 23:50:01,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-14 23:50:01,659 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 377 [2019-10-14 23:50:01,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,660 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-14 23:50:01,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:01,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-14 23:50:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-10-14 23:50:01,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,671 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 16, 16, 15, 15, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:01,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:01,880 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1790317548, now seen corresponding path program 1 times [2019-10-14 23:50:01,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,882 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216947413] [2019-10-14 23:50:01,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-14 23:50:02,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216947413] [2019-10-14 23:50:02,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633275166] [2019-10-14 23:50:02,285 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-10-14 23:50:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:02,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4010 backedges. 2316 proven. 26 refuted. 0 times theorem prover too weak. 1668 trivial. 0 not checked. [2019-10-14 23:50:02,812 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:02,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:02,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171393871] [2019-10-14 23:50:02,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:02,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:02,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:02,817 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 4 states. [2019-10-14 23:50:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,160 INFO L93 Difference]: Finished difference Result 4809 states and 6669 transitions. [2019-10-14 23:50:03,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:50:03,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-10-14 23:50:03,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,183 INFO L225 Difference]: With dead ends: 4809 [2019-10-14 23:50:03,183 INFO L226 Difference]: Without dead ends: 2736 [2019-10-14 23:50:03,190 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 609 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-10-14 23:50:03,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2019-10-14 23:50:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1954. [2019-10-14 23:50:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-14 23:50:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2698 transitions. [2019-10-14 23:50:03,300 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2698 transitions. Word has length 605 [2019-10-14 23:50:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,301 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2698 transitions. [2019-10-14 23:50:03,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:03,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2698 transitions. [2019-10-14 23:50:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-10-14 23:50:03,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,312 INFO L380 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:03,518 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1901319823, now seen corresponding path program 1 times [2019-10-14 23:50:03,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813990212] [2019-10-14 23:50:03,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,519 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5249 backedges. 2922 proven. 0 refuted. 0 times theorem prover too weak. 2327 trivial. 0 not checked. [2019-10-14 23:50:03,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813990212] [2019-10-14 23:50:03,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320205120] [2019-10-14 23:50:03,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,932 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,932 INFO L87 Difference]: Start difference. First operand 1954 states and 2698 transitions. Second operand 3 states. [2019-10-14 23:50:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,173 INFO L93 Difference]: Finished difference Result 3929 states and 5418 transitions. [2019-10-14 23:50:04,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 675 [2019-10-14 23:50:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,179 INFO L225 Difference]: With dead ends: 3929 [2019-10-14 23:50:04,179 INFO L226 Difference]: Without dead ends: 1994 [2019-10-14 23:50:04,185 INFO L600 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-10-14 23:50:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2019-10-14 23:50:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1954. [2019-10-14 23:50:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1954 states. [2019-10-14 23:50:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1954 states to 1954 states and 2678 transitions. [2019-10-14 23:50:04,304 INFO L78 Accepts]: Start accepts. Automaton has 1954 states and 2678 transitions. Word has length 675 [2019-10-14 23:50:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,306 INFO L462 AbstractCegarLoop]: Abstraction has 1954 states and 2678 transitions. [2019-10-14 23:50:04,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1954 states and 2678 transitions. [2019-10-14 23:50:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2019-10-14 23:50:04,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,315 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,315 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash -554544010, now seen corresponding path program 1 times [2019-10-14 23:50:04,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084029920] [2019-10-14 23:50:04,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,316 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5385 backedges. 2915 proven. 0 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2019-10-14 23:50:04,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084029920] [2019-10-14 23:50:04,641 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953817210] [2019-10-14 23:50:04,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,642 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,643 INFO L87 Difference]: Start difference. First operand 1954 states and 2678 transitions. Second operand 3 states. [2019-10-14 23:50:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,858 INFO L93 Difference]: Finished difference Result 3921 states and 5369 transitions. [2019-10-14 23:50:04,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 689 [2019-10-14 23:50:04,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,864 INFO L225 Difference]: With dead ends: 3921 [2019-10-14 23:50:04,865 INFO L226 Difference]: Without dead ends: 1986 [2019-10-14 23:50:04,869 INFO L600 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-10-14 23:50:04,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2019-10-14 23:50:04,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1941. [2019-10-14 23:50:04,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2019-10-14 23:50:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2619 transitions. [2019-10-14 23:50:04,962 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2619 transitions. Word has length 689 [2019-10-14 23:50:04,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,963 INFO L462 AbstractCegarLoop]: Abstraction has 1941 states and 2619 transitions. [2019-10-14 23:50:04,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2619 transitions. [2019-10-14 23:50:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-10-14 23:50:04,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,973 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,973 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1850705057, now seen corresponding path program 1 times [2019-10-14 23:50:04,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574947451] [2019-10-14 23:50:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5826 backedges. 3231 proven. 0 refuted. 0 times theorem prover too weak. 2595 trivial. 0 not checked. [2019-10-14 23:50:05,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574947451] [2019-10-14 23:50:05,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:05,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:05,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091647374] [2019-10-14 23:50:05,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:05,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:05,365 INFO L87 Difference]: Start difference. First operand 1941 states and 2619 transitions. Second operand 3 states. [2019-10-14 23:50:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,582 INFO L93 Difference]: Finished difference Result 3943 states and 5323 transitions. [2019-10-14 23:50:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-10-14 23:50:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,587 INFO L225 Difference]: With dead ends: 3943 [2019-10-14 23:50:05,587 INFO L226 Difference]: Without dead ends: 2003 [2019-10-14 23:50:05,592 INFO L600 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-10-14 23:50:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2003 states. [2019-10-14 23:50:05,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2003 to 1983. [2019-10-14 23:50:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2019-10-14 23:50:05,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2664 transitions. [2019-10-14 23:50:05,679 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2664 transitions. Word has length 717 [2019-10-14 23:50:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,680 INFO L462 AbstractCegarLoop]: Abstraction has 1983 states and 2664 transitions. [2019-10-14 23:50:05,680 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2664 transitions. [2019-10-14 23:50:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2019-10-14 23:50:05,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,689 INFO L380 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 22, 22, 22, 20, 20, 18, 18, 16, 16, 14, 14, 14, 14, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,689 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1896110854, now seen corresponding path program 1 times [2019-10-14 23:50:05,690 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,690 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036770731] [2019-10-14 23:50:05,690 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5992 backedges. 3254 proven. 0 refuted. 0 times theorem prover too weak. 2738 trivial. 0 not checked. [2019-10-14 23:50:06,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036770731] [2019-10-14 23:50:06,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:06,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38709378] [2019-10-14 23:50:06,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:06,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:06,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:06,213 INFO L87 Difference]: Start difference. First operand 1983 states and 2664 transitions. Second operand 3 states. [2019-10-14 23:50:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:06,374 INFO L93 Difference]: Finished difference Result 2548 states and 3406 transitions. [2019-10-14 23:50:06,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:06,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 732 [2019-10-14 23:50:06,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:06,375 INFO L225 Difference]: With dead ends: 2548 [2019-10-14 23:50:06,375 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:06,380 INFO L600 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-10-14 23:50:06,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:06,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:06,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:06,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:06,381 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 732 [2019-10-14 23:50:06,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,381 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:06,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:06,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:06,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:06,500 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 153 [2019-10-14 23:50:07,416 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 176 [2019-10-14 23:50:07,805 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 159 [2019-10-14 23:50:08,113 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 175 [2019-10-14 23:50:09,537 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-14 23:50:10,387 WARN L191 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 118 [2019-10-14 23:50:11,148 WARN L191 SmtUtils]: Spent 758.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 120 [2019-10-14 23:50:12,183 WARN L191 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 150 DAG size of output: 123 [2019-10-14 23:50:12,621 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 108 [2019-10-14 23:50:13,383 WARN L191 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 117 [2019-10-14 23:50:14,162 WARN L191 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2019-10-14 23:50:15,468 WARN L191 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 151 DAG size of output: 117 [2019-10-14 23:50:16,603 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 157 DAG size of output: 120