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_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:49,104 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:49,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:49,121 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:49,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:49,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:49,125 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:49,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:49,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:49,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:49,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:49,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:49,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:49,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:49,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:49,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:49,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:49,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:49,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:49,147 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:49,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:49,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:49,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:49,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:49,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:49,162 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:49,162 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:49,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:49,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:49,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:49,168 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:49,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:49,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:49,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:49,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:49,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:49,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:49,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:49,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:49,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:49,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:49,183 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:49,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:49,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:49,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:49,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:49,209 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:49,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:49,209 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:49,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:49,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:49,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:49,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:49,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:49,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:49,212 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:49,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:49,212 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:49,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:49,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:49,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:49,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:49,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:49,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:49,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:49,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:49,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:49,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:49,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:49,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:49,215 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:49,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:49,546 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:49,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:49,552 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:49,552 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:49,553 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-14 23:49:49,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c5ad07f5/26318b1f11864a788995844c4528cff5/FLAG18dcd6547 [2019-10-14 23:49:50,110 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:50,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_8.cil.c [2019-10-14 23:49:50,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c5ad07f5/26318b1f11864a788995844c4528cff5/FLAG18dcd6547 [2019-10-14 23:49:50,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c5ad07f5/26318b1f11864a788995844c4528cff5 [2019-10-14 23:49:50,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:50,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:50,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:50,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:50,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:50,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f33695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50, skipping insertion in model container [2019-10-14 23:49:50,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,488 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:50,547 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:50,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:50,931 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:51,085 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:51,107 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:51,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:51 WrapperNode [2019-10-14 23:49:51,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:51,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:51,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:51,110 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:51,123 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:51" (1/1) ... [2019-10-14 23:49:51,124 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:51" (1/1) ... [2019-10-14 23:49:51,134 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:51" (1/1) ... [2019-10-14 23:49:51,134 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:51" (1/1) ... [2019-10-14 23:49:51,150 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:51" (1/1) ... [2019-10-14 23:49:51,173 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:51" (1/1) ... [2019-10-14 23:49:51,181 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:51" (1/1) ... [2019-10-14 23:49:51,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:51,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:51,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:51,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:51,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:51" (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:51,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:51,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:51,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:51,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:51,254 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:51,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:51,495 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:52,120 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:52,120 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:52,129 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:52,130 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:52,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:52 BoogieIcfgContainer [2019-10-14 23:49:52,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:52,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:52,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:52,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:52,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:50" (1/3) ... [2019-10-14 23:49:52,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:52, skipping insertion in model container [2019-10-14 23:49:52,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:51" (2/3) ... [2019-10-14 23:49:52,143 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f6ccee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:52, skipping insertion in model container [2019-10-14 23:49:52,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:52" (3/3) ... [2019-10-14 23:49:52,160 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2019-10-14 23:49:52,172 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:52,184 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:52,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:52,229 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:52,229 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:52,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:52,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:52,230 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:52,230 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:52,230 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:52,230 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-10-14 23:49:52,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-14 23:49:52,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,263 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] [2019-10-14 23:49:52,264 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -617772913, now seen corresponding path program 1 times [2019-10-14 23:49:52,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895654758] [2019-10-14 23:49:52,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,661 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:52,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895654758] [2019-10-14 23:49:52,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,664 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942054083] [2019-10-14 23:49:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,672 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,693 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-10-14 23:49:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,140 INFO L93 Difference]: Finished difference Result 348 states and 596 transitions. [2019-10-14 23:49:53,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-14 23:49:53,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,159 INFO L225 Difference]: With dead ends: 348 [2019-10-14 23:49:53,160 INFO L226 Difference]: Without dead ends: 185 [2019-10-14 23:49:53,165 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,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-14 23:49:53,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-14 23:49:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-14 23:49:53,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2019-10-14 23:49:53,277 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 47 [2019-10-14 23:49:53,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,278 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2019-10-14 23:49:53,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2019-10-14 23:49:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-14 23:49:53,284 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,285 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] [2019-10-14 23:49:53,285 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 401544370, now seen corresponding path program 1 times [2019-10-14 23:49:53,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136633876] [2019-10-14 23:49:53,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,466 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:53,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136633876] [2019-10-14 23:49:53,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660026060] [2019-10-14 23:49:53,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,473 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand 5 states. [2019-10-14 23:49:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,775 INFO L93 Difference]: Finished difference Result 388 states and 636 transitions. [2019-10-14 23:49:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-10-14 23:49:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,778 INFO L225 Difference]: With dead ends: 388 [2019-10-14 23:49:53,778 INFO L226 Difference]: Without dead ends: 224 [2019-10-14 23:49:53,780 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,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-14 23:49:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2019-10-14 23:49:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-14 23:49:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-14 23:49:53,799 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 48 [2019-10-14 23:49:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,800 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-14 23:49:53,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,800 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-14 23:49:53,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-14 23:49:53,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,804 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] [2019-10-14 23:49:53,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,805 INFO L82 PathProgramCache]: Analyzing trace with hash 353705226, now seen corresponding path program 1 times [2019-10-14 23:49:53,805 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,805 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754936525] [2019-10-14 23:49:53,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,806 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,950 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:53,950 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754936525] [2019-10-14 23:49:53,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,951 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,951 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444995464] [2019-10-14 23:49:53,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,959 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-14 23:49:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,221 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-14 23:49:54,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-10-14 23:49:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,225 INFO L225 Difference]: With dead ends: 450 [2019-10-14 23:49:54,225 INFO L226 Difference]: Without dead ends: 247 [2019-10-14 23:49:54,229 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,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-14 23:49:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-14 23:49:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-14 23:49:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-14 23:49:54,274 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 75 [2019-10-14 23:49:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,277 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-14 23:49:54,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-14 23:49:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-14 23:49:54,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,286 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, 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,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -668843297, now seen corresponding path program 1 times [2019-10-14 23:49:54,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151564828] [2019-10-14 23:49:54,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:54,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151564828] [2019-10-14 23:49:54,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562421946] [2019-10-14 23:49:54,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,411 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-14 23:49:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,654 INFO L93 Difference]: Finished difference Result 519 states and 878 transitions. [2019-10-14 23:49:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-10-14 23:49:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,658 INFO L225 Difference]: With dead ends: 519 [2019-10-14 23:49:54,658 INFO L226 Difference]: Without dead ends: 285 [2019-10-14 23:49:54,659 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,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-14 23:49:54,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-14 23:49:54,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-14 23:49:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 478 transitions. [2019-10-14 23:49:54,685 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 478 transitions. Word has length 80 [2019-10-14 23:49:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,686 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 478 transitions. [2019-10-14 23:49:54,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 478 transitions. [2019-10-14 23:49:54,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-14 23:49:54,692 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,692 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, 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,693 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,693 INFO L82 PathProgramCache]: Analyzing trace with hash 293568124, now seen corresponding path program 1 times [2019-10-14 23:49:54,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,694 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308169574] [2019-10-14 23:49:54,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:54,784 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308169574] [2019-10-14 23:49:54,785 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,785 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,785 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845378528] [2019-10-14 23:49:54,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,788 INFO L87 Difference]: Start difference. First operand 283 states and 478 transitions. Second operand 5 states. [2019-10-14 23:49:55,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,031 INFO L93 Difference]: Finished difference Result 555 states and 941 transitions. [2019-10-14 23:49:55,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-10-14 23:49:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,034 INFO L225 Difference]: With dead ends: 555 [2019-10-14 23:49:55,034 INFO L226 Difference]: Without dead ends: 285 [2019-10-14 23:49:55,035 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,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-10-14 23:49:55,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2019-10-14 23:49:55,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-10-14 23:49:55,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 476 transitions. [2019-10-14 23:49:55,048 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 476 transitions. Word has length 81 [2019-10-14 23:49:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,049 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 476 transitions. [2019-10-14 23:49:55,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,049 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 476 transitions. [2019-10-14 23:49:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-14 23:49:55,051 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,051 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] [2019-10-14 23:49:55,052 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash -95009440, now seen corresponding path program 1 times [2019-10-14 23:49:55,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,053 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091804929] [2019-10-14 23:49:55,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,115 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:55,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091804929] [2019-10-14 23:49:55,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657633703] [2019-10-14 23:49:55,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,118 INFO L87 Difference]: Start difference. First operand 283 states and 476 transitions. Second operand 5 states. [2019-10-14 23:49:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,291 INFO L93 Difference]: Finished difference Result 570 states and 963 transitions. [2019-10-14 23:49:55,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-10-14 23:49:55,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,294 INFO L225 Difference]: With dead ends: 570 [2019-10-14 23:49:55,294 INFO L226 Difference]: Without dead ends: 300 [2019-10-14 23:49:55,295 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,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-14 23:49:55,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-14 23:49:55,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-14 23:49:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-14 23:49:55,309 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 87 [2019-10-14 23:49:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,309 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-14 23:49:55,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-14 23:49:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-14 23:49:55,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,311 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] [2019-10-14 23:49:55,312 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1081604216, now seen corresponding path program 1 times [2019-10-14 23:49:55,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165886036] [2019-10-14 23:49:55,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,413 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:55,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165886036] [2019-10-14 23:49:55,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342346977] [2019-10-14 23:49:55,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,415 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 5 states. [2019-10-14 23:49:55,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,591 INFO L93 Difference]: Finished difference Result 585 states and 981 transitions. [2019-10-14 23:49:55,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-10-14 23:49:55,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,594 INFO L225 Difference]: With dead ends: 585 [2019-10-14 23:49:55,594 INFO L226 Difference]: Without dead ends: 300 [2019-10-14 23:49:55,595 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,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-14 23:49:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-14 23:49:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-14 23:49:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 494 transitions. [2019-10-14 23:49:55,609 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 494 transitions. Word has length 88 [2019-10-14 23:49:55,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,609 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 494 transitions. [2019-10-14 23:49:55,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,609 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 494 transitions. [2019-10-14 23:49:55,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-14 23:49:55,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,611 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] [2019-10-14 23:49:55,611 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2001210697, now seen corresponding path program 1 times [2019-10-14 23:49:55,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85252137] [2019-10-14 23:49:55,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,700 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:55,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85252137] [2019-10-14 23:49:55,701 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558822887] [2019-10-14 23:49:55,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,702 INFO L87 Difference]: Start difference. First operand 298 states and 494 transitions. Second operand 5 states. [2019-10-14 23:49:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,924 INFO L93 Difference]: Finished difference Result 592 states and 983 transitions. [2019-10-14 23:49:55,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-14 23:49:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,929 INFO L225 Difference]: With dead ends: 592 [2019-10-14 23:49:55,929 INFO L226 Difference]: Without dead ends: 307 [2019-10-14 23:49:55,931 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-14 23:49:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-14 23:49:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-14 23:49:55,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 500 transitions. [2019-10-14 23:49:55,952 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 500 transitions. Word has length 100 [2019-10-14 23:49:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,953 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 500 transitions. [2019-10-14 23:49:55,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 500 transitions. [2019-10-14 23:49:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-14 23:49:55,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,956 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] [2019-10-14 23:49:55,956 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1192129085, now seen corresponding path program 1 times [2019-10-14 23:49:55,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121398921] [2019-10-14 23:49:55,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,038 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:56,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121398921] [2019-10-14 23:49:56,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131302683] [2019-10-14 23:49:56,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,043 INFO L87 Difference]: Start difference. First operand 307 states and 500 transitions. Second operand 5 states. [2019-10-14 23:49:56,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,258 INFO L93 Difference]: Finished difference Result 632 states and 1036 transitions. [2019-10-14 23:49:56,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2019-10-14 23:49:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,262 INFO L225 Difference]: With dead ends: 632 [2019-10-14 23:49:56,262 INFO L226 Difference]: Without dead ends: 338 [2019-10-14 23:49:56,264 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,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-14 23:49:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-14 23:49:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-14 23:49:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-14 23:49:56,280 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 101 [2019-10-14 23:49:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,280 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-14 23:49:56,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-14 23:49:56,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:49:56,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,285 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] [2019-10-14 23:49:56,285 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,286 INFO L82 PathProgramCache]: Analyzing trace with hash 775386699, now seen corresponding path program 1 times [2019-10-14 23:49:56,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501182338] [2019-10-14 23:49:56,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,349 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:56,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501182338] [2019-10-14 23:49:56,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52681188] [2019-10-14 23:49:56,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,353 INFO L87 Difference]: Start difference. First operand 336 states and 547 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 661 states and 1079 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 102 [2019-10-14 23:49:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,573 INFO L225 Difference]: With dead ends: 661 [2019-10-14 23:49:56,573 INFO L226 Difference]: Without dead ends: 338 [2019-10-14 23:49:56,577 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,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-14 23:49:56,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-14 23:49:56,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-14 23:49:56,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 543 transitions. [2019-10-14 23:49:56,597 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 543 transitions. Word has length 102 [2019-10-14 23:49:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,597 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 543 transitions. [2019-10-14 23:49:56,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 543 transitions. [2019-10-14 23:49:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:49:56,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,600 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] [2019-10-14 23:49:56,600 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1217428909, now seen corresponding path program 1 times [2019-10-14 23:49:56,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959458556] [2019-10-14 23:49:56,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,677 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:56,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959458556] [2019-10-14 23:49:56,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822789600] [2019-10-14 23:49:56,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,680 INFO L87 Difference]: Start difference. First operand 336 states and 543 transitions. Second operand 5 states. [2019-10-14 23:49:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,906 INFO L93 Difference]: Finished difference Result 694 states and 1129 transitions. [2019-10-14 23:49:56,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:49:56,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,909 INFO L225 Difference]: With dead ends: 694 [2019-10-14 23:49:56,910 INFO L226 Difference]: Without dead ends: 371 [2019-10-14 23:49:56,911 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,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-14 23:49:56,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-14 23:49:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-14 23:49:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 585 transitions. [2019-10-14 23:49:56,928 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 585 transitions. Word has length 103 [2019-10-14 23:49:56,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,929 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 585 transitions. [2019-10-14 23:49:56,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,929 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 585 transitions. [2019-10-14 23:49:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:49:56,931 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,931 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] [2019-10-14 23:49:56,931 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,932 INFO L82 PathProgramCache]: Analyzing trace with hash -141729733, now seen corresponding path program 1 times [2019-10-14 23:49:56,932 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,932 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707779319] [2019-10-14 23:49:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,981 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:56,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707779319] [2019-10-14 23:49:56,982 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693368053] [2019-10-14 23:49:56,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,983 INFO L87 Difference]: Start difference. First operand 363 states and 585 transitions. Second operand 5 states. [2019-10-14 23:49:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,190 INFO L93 Difference]: Finished difference Result 721 states and 1166 transitions. [2019-10-14 23:49:57,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:49:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,193 INFO L225 Difference]: With dead ends: 721 [2019-10-14 23:49:57,193 INFO L226 Difference]: Without dead ends: 371 [2019-10-14 23:49:57,194 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,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-14 23:49:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-14 23:49:57,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-14 23:49:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 580 transitions. [2019-10-14 23:49:57,212 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 580 transitions. Word has length 104 [2019-10-14 23:49:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,213 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 580 transitions. [2019-10-14 23:49:57,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 580 transitions. [2019-10-14 23:49:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:49:57,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,215 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, 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:57,215 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,216 INFO L82 PathProgramCache]: Analyzing trace with hash -564771468, now seen corresponding path program 1 times [2019-10-14 23:49:57,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229025928] [2019-10-14 23:49:57,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:57,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229025928] [2019-10-14 23:49:57,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996923089] [2019-10-14 23:49:57,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,292 INFO L87 Difference]: Start difference. First operand 363 states and 580 transitions. Second operand 5 states. [2019-10-14 23:49:57,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,554 INFO L93 Difference]: Finished difference Result 749 states and 1201 transitions. [2019-10-14 23:49:57,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-14 23:49:57,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,558 INFO L225 Difference]: With dead ends: 749 [2019-10-14 23:49:57,558 INFO L226 Difference]: Without dead ends: 399 [2019-10-14 23:49:57,559 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,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-14 23:49:57,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-14 23:49:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-14 23:49:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 633 transitions. [2019-10-14 23:49:57,580 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 633 transitions. Word has length 111 [2019-10-14 23:49:57,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,580 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 633 transitions. [2019-10-14 23:49:57,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 633 transitions. [2019-10-14 23:49:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-14 23:49:57,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,583 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, 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:57,583 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,584 INFO L82 PathProgramCache]: Analyzing trace with hash -285750569, now seen corresponding path program 1 times [2019-10-14 23:49:57,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145884792] [2019-10-14 23:49:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:57,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145884792] [2019-10-14 23:49:57,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347332638] [2019-10-14 23:49:57,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,707 INFO L87 Difference]: Start difference. First operand 397 states and 633 transitions. Second operand 5 states. [2019-10-14 23:49:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,067 INFO L93 Difference]: Finished difference Result 783 states and 1251 transitions. [2019-10-14 23:49:58,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-14 23:49:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,072 INFO L225 Difference]: With dead ends: 783 [2019-10-14 23:49:58,072 INFO L226 Difference]: Without dead ends: 399 [2019-10-14 23:49:58,074 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,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-14 23:49:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2019-10-14 23:49:58,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-14 23:49:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 630 transitions. [2019-10-14 23:49:58,100 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 630 transitions. Word has length 112 [2019-10-14 23:49:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,100 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 630 transitions. [2019-10-14 23:49:58,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 630 transitions. [2019-10-14 23:49:58,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-14 23:49:58,103 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,104 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,104 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1187170139, now seen corresponding path program 1 times [2019-10-14 23:49:58,105 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,105 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268724171] [2019-10-14 23:49:58,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:58,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268724171] [2019-10-14 23:49:58,178 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28413674] [2019-10-14 23:49:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,180 INFO L87 Difference]: Start difference. First operand 397 states and 630 transitions. Second operand 5 states. [2019-10-14 23:49:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,477 INFO L93 Difference]: Finished difference Result 828 states and 1317 transitions. [2019-10-14 23:49:58,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 117 [2019-10-14 23:49:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,480 INFO L225 Difference]: With dead ends: 828 [2019-10-14 23:49:58,480 INFO L226 Difference]: Without dead ends: 444 [2019-10-14 23:49:58,482 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,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-14 23:49:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 439. [2019-10-14 23:49:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2019-10-14 23:49:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 695 transitions. [2019-10-14 23:49:58,505 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 695 transitions. Word has length 117 [2019-10-14 23:49:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,506 INFO L462 AbstractCegarLoop]: Abstraction has 439 states and 695 transitions. [2019-10-14 23:49:58,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 695 transitions. [2019-10-14 23:49:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-14 23:49:58,508 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,508 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, 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:58,509 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1861118978, now seen corresponding path program 1 times [2019-10-14 23:49:58,509 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005125567] [2019-10-14 23:49:58,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,510 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:58,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005125567] [2019-10-14 23:49:58,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,572 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387794042] [2019-10-14 23:49:58,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,573 INFO L87 Difference]: Start difference. First operand 439 states and 695 transitions. Second operand 5 states. [2019-10-14 23:49:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,844 INFO L93 Difference]: Finished difference Result 874 states and 1388 transitions. [2019-10-14 23:49:58,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2019-10-14 23:49:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,848 INFO L225 Difference]: With dead ends: 874 [2019-10-14 23:49:58,848 INFO L226 Difference]: Without dead ends: 446 [2019-10-14 23:49:58,850 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,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-14 23:49:58,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 441. [2019-10-14 23:49:58,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-14 23:49:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 698 transitions. [2019-10-14 23:49:58,873 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 698 transitions. Word has length 118 [2019-10-14 23:49:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,874 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 698 transitions. [2019-10-14 23:49:58,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 698 transitions. [2019-10-14 23:49:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-14 23:49:58,876 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,876 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,877 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash 385795336, now seen corresponding path program 1 times [2019-10-14 23:49:58,877 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364655214] [2019-10-14 23:49:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-14 23:49:58,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364655214] [2019-10-14 23:49:58,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482316158] [2019-10-14 23:49:58,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,938 INFO L87 Difference]: Start difference. First operand 441 states and 698 transitions. Second operand 5 states. [2019-10-14 23:49:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,136 INFO L93 Difference]: Finished difference Result 907 states and 1443 transitions. [2019-10-14 23:49:59,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-14 23:49:59,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,140 INFO L225 Difference]: With dead ends: 907 [2019-10-14 23:49:59,140 INFO L226 Difference]: Without dead ends: 479 [2019-10-14 23:49:59,142 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:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-14 23:49:59,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-14 23:49:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-14 23:49:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 733 transitions. [2019-10-14 23:49:59,164 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 733 transitions. Word has length 129 [2019-10-14 23:49:59,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,165 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 733 transitions. [2019-10-14 23:49:59,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 733 transitions. [2019-10-14 23:49:59,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-14 23:49:59,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,167 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,168 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,168 INFO L82 PathProgramCache]: Analyzing trace with hash -177817520, now seen corresponding path program 1 times [2019-10-14 23:49:59,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268966518] [2019-10-14 23:49:59,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-14 23:49:59,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268966518] [2019-10-14 23:49:59,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,232 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062606491] [2019-10-14 23:49:59,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,234 INFO L87 Difference]: Start difference. First operand 466 states and 733 transitions. Second operand 5 states. [2019-10-14 23:49:59,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,442 INFO L93 Difference]: Finished difference Result 932 states and 1470 transitions. [2019-10-14 23:49:59,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-14 23:49:59,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,445 INFO L225 Difference]: With dead ends: 932 [2019-10-14 23:49:59,446 INFO L226 Difference]: Without dead ends: 479 [2019-10-14 23:49:59,447 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:59,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-10-14 23:49:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 466. [2019-10-14 23:49:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-14 23:49:59,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 725 transitions. [2019-10-14 23:49:59,471 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 725 transitions. Word has length 130 [2019-10-14 23:49:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,471 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 725 transitions. [2019-10-14 23:49:59,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 725 transitions. [2019-10-14 23:49:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-14 23:49:59,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,474 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, 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] [2019-10-14 23:49:59,474 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,475 INFO L82 PathProgramCache]: Analyzing trace with hash 755280415, now seen corresponding path program 1 times [2019-10-14 23:49:59,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101377768] [2019-10-14 23:49:59,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-14 23:49:59,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101377768] [2019-10-14 23:49:59,548 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185568753] [2019-10-14 23:49:59,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,552 INFO L87 Difference]: Start difference. First operand 466 states and 725 transitions. Second operand 5 states. [2019-10-14 23:49:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,783 INFO L93 Difference]: Finished difference Result 923 states and 1438 transitions. [2019-10-14 23:49:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,784 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-14 23:49:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,788 INFO L225 Difference]: With dead ends: 923 [2019-10-14 23:49:59,788 INFO L226 Difference]: Without dead ends: 470 [2019-10-14 23:49:59,789 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:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-14 23:49:59,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-14 23:49:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-14 23:49:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 720 transitions. [2019-10-14 23:49:59,822 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 720 transitions. Word has length 142 [2019-10-14 23:49:59,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,822 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 720 transitions. [2019-10-14 23:49:59,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 720 transitions. [2019-10-14 23:49:59,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-14 23:49:59,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,826 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, 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] [2019-10-14 23:49:59,826 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash -816490564, now seen corresponding path program 1 times [2019-10-14 23:49:59,827 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719480937] [2019-10-14 23:49:59,827 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,828 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,910 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-10-14 23:49:59,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719480937] [2019-10-14 23:49:59,911 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31696797] [2019-10-14 23:49:59,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,912 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,913 INFO L87 Difference]: Start difference. First operand 466 states and 720 transitions. Second operand 5 states. [2019-10-14 23:50:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,134 INFO L93 Difference]: Finished difference Result 923 states and 1428 transitions. [2019-10-14 23:50:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:00,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-14 23:50:00,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,137 INFO L225 Difference]: With dead ends: 923 [2019-10-14 23:50:00,137 INFO L226 Difference]: Without dead ends: 470 [2019-10-14 23:50:00,139 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:50:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-10-14 23:50:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 466. [2019-10-14 23:50:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2019-10-14 23:50:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 715 transitions. [2019-10-14 23:50:00,164 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 715 transitions. Word has length 143 [2019-10-14 23:50:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,165 INFO L462 AbstractCegarLoop]: Abstraction has 466 states and 715 transitions. [2019-10-14 23:50:00,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 715 transitions. [2019-10-14 23:50:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-14 23:50:00,167 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,168 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,168 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1136592958, now seen corresponding path program 1 times [2019-10-14 23:50:00,169 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,169 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630214223] [2019-10-14 23:50:00,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-14 23:50:00,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630214223] [2019-10-14 23:50:00,235 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:00,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251887758] [2019-10-14 23:50:00,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:00,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,242 INFO L87 Difference]: Start difference. First operand 466 states and 715 transitions. Second operand 5 states. [2019-10-14 23:50:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,437 INFO L93 Difference]: Finished difference Result 947 states and 1458 transitions. [2019-10-14 23:50:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:00,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-14 23:50:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,441 INFO L225 Difference]: With dead ends: 947 [2019-10-14 23:50:00,441 INFO L226 Difference]: Without dead ends: 494 [2019-10-14 23:50:00,443 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:50:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-14 23:50:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-14 23:50:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-14 23:50:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 746 transitions. [2019-10-14 23:50:00,468 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 746 transitions. Word has length 150 [2019-10-14 23:50:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,468 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 746 transitions. [2019-10-14 23:50:00,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 746 transitions. [2019-10-14 23:50:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-14 23:50:00,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,471 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,472 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1424495078, now seen corresponding path program 1 times [2019-10-14 23:50:00,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808888524] [2019-10-14 23:50:00,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-10-14 23:50:00,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808888524] [2019-10-14 23:50:00,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:00,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072986131] [2019-10-14 23:50:00,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:00,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,563 INFO L87 Difference]: Start difference. First operand 490 states and 746 transitions. Second operand 5 states. [2019-10-14 23:50:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,809 INFO L93 Difference]: Finished difference Result 971 states and 1480 transitions. [2019-10-14 23:50:00,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:00,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-10-14 23:50:00,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,817 INFO L225 Difference]: With dead ends: 971 [2019-10-14 23:50:00,817 INFO L226 Difference]: Without dead ends: 494 [2019-10-14 23:50:00,819 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:50:00,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2019-10-14 23:50:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 490. [2019-10-14 23:50:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2019-10-14 23:50:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2019-10-14 23:50:00,865 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 151 [2019-10-14 23:50:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,866 INFO L462 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2019-10-14 23:50:00,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2019-10-14 23:50:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-14 23:50:00,870 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,871 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,871 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,872 INFO L82 PathProgramCache]: Analyzing trace with hash 311984194, now seen corresponding path program 1 times [2019-10-14 23:50:00,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781496816] [2019-10-14 23:50:00,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:50:00,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781496816] [2019-10-14 23:50:00,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:00,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886392219] [2019-10-14 23:50:00,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:00,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:00,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,986 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand 5 states. [2019-10-14 23:50:01,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,298 INFO L93 Difference]: Finished difference Result 1014 states and 1523 transitions. [2019-10-14 23:50:01,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:01,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-10-14 23:50:01,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,304 INFO L225 Difference]: With dead ends: 1014 [2019-10-14 23:50:01,304 INFO L226 Difference]: Without dead ends: 537 [2019-10-14 23:50:01,306 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:50:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-14 23:50:01,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2019-10-14 23:50:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-14 23:50:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 792 transitions. [2019-10-14 23:50:01,348 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 792 transitions. Word has length 157 [2019-10-14 23:50:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,349 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 792 transitions. [2019-10-14 23:50:01,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 792 transitions. [2019-10-14 23:50:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-14 23:50:01,354 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,354 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, 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, 1] [2019-10-14 23:50:01,355 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,355 INFO L82 PathProgramCache]: Analyzing trace with hash -611548539, now seen corresponding path program 1 times [2019-10-14 23:50:01,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770154570] [2019-10-14 23:50:01,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:50:01,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770154570] [2019-10-14 23:50:01,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:01,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954233075] [2019-10-14 23:50:01,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:01,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:01,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:01,497 INFO L87 Difference]: Start difference. First operand 531 states and 792 transitions. Second operand 5 states. [2019-10-14 23:50:01,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,746 INFO L93 Difference]: Finished difference Result 1055 states and 1576 transitions. [2019-10-14 23:50:01,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:01,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-14 23:50:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,749 INFO L225 Difference]: With dead ends: 1055 [2019-10-14 23:50:01,749 INFO L226 Difference]: Without dead ends: 518 [2019-10-14 23:50:01,752 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:50:01,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2019-10-14 23:50:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 512. [2019-10-14 23:50:01,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-10-14 23:50:01,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 762 transitions. [2019-10-14 23:50:01,792 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 762 transitions. Word has length 158 [2019-10-14 23:50:01,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,792 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 762 transitions. [2019-10-14 23:50:01,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:01,792 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 762 transitions. [2019-10-14 23:50:01,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-14 23:50:01,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,795 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:01,796 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1831676618, now seen corresponding path program 1 times [2019-10-14 23:50:01,797 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,797 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969996935] [2019-10-14 23:50:01,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,871 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-14 23:50:01,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969996935] [2019-10-14 23:50:01,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,872 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:01,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552908962] [2019-10-14 23:50:01,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:01,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:01,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:01,874 INFO L87 Difference]: Start difference. First operand 512 states and 762 transitions. Second operand 5 states. [2019-10-14 23:50:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,075 INFO L93 Difference]: Finished difference Result 1036 states and 1548 transitions. [2019-10-14 23:50:02,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:02,076 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-10-14 23:50:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,079 INFO L225 Difference]: With dead ends: 1036 [2019-10-14 23:50:02,080 INFO L226 Difference]: Without dead ends: 537 [2019-10-14 23:50:02,081 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:50:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-10-14 23:50:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 533. [2019-10-14 23:50:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-10-14 23:50:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 786 transitions. [2019-10-14 23:50:02,109 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 786 transitions. Word has length 171 [2019-10-14 23:50:02,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,110 INFO L462 AbstractCegarLoop]: Abstraction has 533 states and 786 transitions. [2019-10-14 23:50:02,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:02,110 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 786 transitions. [2019-10-14 23:50:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-14 23:50:02,113 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,113 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,114 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash -813103810, now seen corresponding path program 1 times [2019-10-14 23:50:02,114 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401268654] [2019-10-14 23:50:02,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,115 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-14 23:50:02,189 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401268654] [2019-10-14 23:50:02,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:02,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42325650] [2019-10-14 23:50:02,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:02,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,192 INFO L87 Difference]: Start difference. First operand 533 states and 786 transitions. Second operand 5 states. [2019-10-14 23:50:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,409 INFO L93 Difference]: Finished difference Result 1057 states and 1561 transitions. [2019-10-14 23:50:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:02,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-10-14 23:50:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,413 INFO L225 Difference]: With dead ends: 1057 [2019-10-14 23:50:02,414 INFO L226 Difference]: Without dead ends: 535 [2019-10-14 23:50:02,416 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:50:02,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-10-14 23:50:02,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 531. [2019-10-14 23:50:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2019-10-14 23:50:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 772 transitions. [2019-10-14 23:50:02,444 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 772 transitions. Word has length 172 [2019-10-14 23:50:02,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,445 INFO L462 AbstractCegarLoop]: Abstraction has 531 states and 772 transitions. [2019-10-14 23:50:02,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:02,445 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 772 transitions. [2019-10-14 23:50:02,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-14 23:50:02,447 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,448 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,448 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1628821973, now seen corresponding path program 1 times [2019-10-14 23:50:02,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887497194] [2019-10-14 23:50:02,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,449 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-14 23:50:02,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887497194] [2019-10-14 23:50:02,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625303136] [2019-10-14 23:50:02,531 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:50:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:02,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-14 23:50:02,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:02,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:02,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504091343] [2019-10-14 23:50:02,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,797 INFO L87 Difference]: Start difference. First operand 531 states and 772 transitions. Second operand 3 states. [2019-10-14 23:50:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,914 INFO L93 Difference]: Finished difference Result 1565 states and 2281 transitions. [2019-10-14 23:50:02,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:02,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-10-14 23:50:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,921 INFO L225 Difference]: With dead ends: 1565 [2019-10-14 23:50:02,921 INFO L226 Difference]: Without dead ends: 1047 [2019-10-14 23:50:02,923 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 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:50:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2019-10-14 23:50:02,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 1047. [2019-10-14 23:50:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-14 23:50:02,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1518 transitions. [2019-10-14 23:50:02,991 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1518 transitions. Word has length 187 [2019-10-14 23:50:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,991 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 1518 transitions. [2019-10-14 23:50:02,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1518 transitions. [2019-10-14 23:50:02,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-14 23:50:02,995 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,996 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:03,203 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash -845275759, now seen corresponding path program 1 times [2019-10-14 23:50:03,204 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758560033] [2019-10-14 23:50:03,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,205 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-14 23:50:03,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758560033] [2019-10-14 23:50:03,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796664202] [2019-10-14 23:50:03,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,324 INFO L87 Difference]: Start difference. First operand 1047 states and 1518 transitions. Second operand 3 states. [2019-10-14 23:50:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,439 INFO L93 Difference]: Finished difference Result 2591 states and 3764 transitions. [2019-10-14 23:50:03,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-14 23:50:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,449 INFO L225 Difference]: With dead ends: 2591 [2019-10-14 23:50:03,449 INFO L226 Difference]: Without dead ends: 1557 [2019-10-14 23:50:03,452 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:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2019-10-14 23:50:03,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2019-10-14 23:50:03,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2019-10-14 23:50:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2254 transitions. [2019-10-14 23:50:03,536 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2254 transitions. Word has length 194 [2019-10-14 23:50:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,537 INFO L462 AbstractCegarLoop]: Abstraction has 1557 states and 2254 transitions. [2019-10-14 23:50:03,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2254 transitions. [2019-10-14 23:50:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-14 23:50:03,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,542 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,542 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,542 INFO L82 PathProgramCache]: Analyzing trace with hash -977462684, now seen corresponding path program 1 times [2019-10-14 23:50:03,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595059920] [2019-10-14 23:50:03,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-14 23:50:03,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595059920] [2019-10-14 23:50:03,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801687938] [2019-10-14 23:50:03,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,623 INFO L87 Difference]: Start difference. First operand 1557 states and 2254 transitions. Second operand 3 states. [2019-10-14 23:50:03,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,815 INFO L93 Difference]: Finished difference Result 3612 states and 5237 transitions. [2019-10-14 23:50:03,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-10-14 23:50:03,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,828 INFO L225 Difference]: With dead ends: 3612 [2019-10-14 23:50:03,829 INFO L226 Difference]: Without dead ends: 2068 [2019-10-14 23:50:03,837 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:03,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-10-14 23:50:03,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2068. [2019-10-14 23:50:03,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2068 states. [2019-10-14 23:50:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2068 states to 2068 states and 2991 transitions. [2019-10-14 23:50:03,989 INFO L78 Accepts]: Start accepts. Automaton has 2068 states and 2991 transitions. Word has length 195 [2019-10-14 23:50:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,990 INFO L462 AbstractCegarLoop]: Abstraction has 2068 states and 2991 transitions. [2019-10-14 23:50:03,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2068 states and 2991 transitions. [2019-10-14 23:50:04,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-10-14 23:50:04,006 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,006 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,007 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1729777908, now seen corresponding path program 1 times [2019-10-14 23:50:04,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878585498] [2019-10-14 23:50:04,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,011 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 719 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-10-14 23:50:04,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878585498] [2019-10-14 23:50:04,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,254 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829681389] [2019-10-14 23:50:04,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,258 INFO L87 Difference]: Start difference. First operand 2068 states and 2991 transitions. Second operand 3 states. [2019-10-14 23:50:04,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,465 INFO L93 Difference]: Finished difference Result 5698 states and 8235 transitions. [2019-10-14 23:50:04,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 344 [2019-10-14 23:50:04,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,518 INFO L225 Difference]: With dead ends: 5698 [2019-10-14 23:50:04,519 INFO L226 Difference]: Without dead ends: 3643 [2019-10-14 23:50:04,525 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,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3643 states. [2019-10-14 23:50:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3643 to 3641. [2019-10-14 23:50:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2019-10-14 23:50:04,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 5251 transitions. [2019-10-14 23:50:04,745 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 5251 transitions. Word has length 344 [2019-10-14 23:50:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,746 INFO L462 AbstractCegarLoop]: Abstraction has 3641 states and 5251 transitions. [2019-10-14 23:50:04,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 5251 transitions. [2019-10-14 23:50:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-10-14 23:50:04,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,763 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,764 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1198848905, now seen corresponding path program 1 times [2019-10-14 23:50:04,765 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,765 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727376812] [2019-10-14 23:50:04,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 851 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-10-14 23:50:04,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727376812] [2019-10-14 23:50:04,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,932 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,932 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190200801] [2019-10-14 23:50:04,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,936 INFO L87 Difference]: Start difference. First operand 3641 states and 5251 transitions. Second operand 3 states. [2019-10-14 23:50:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,306 INFO L93 Difference]: Finished difference Result 7429 states and 10741 transitions. [2019-10-14 23:50:05,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 381 [2019-10-14 23:50:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,321 INFO L225 Difference]: With dead ends: 7429 [2019-10-14 23:50:05,321 INFO L226 Difference]: Without dead ends: 2504 [2019-10-14 23:50:05,334 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,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2019-10-14 23:50:05,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2019-10-14 23:50:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-10-14 23:50:05,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3558 transitions. [2019-10-14 23:50:05,462 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3558 transitions. Word has length 381 [2019-10-14 23:50:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,463 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3558 transitions. [2019-10-14 23:50:05,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3558 transitions. [2019-10-14 23:50:05,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-14 23:50:05,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,475 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,476 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1350004073, now seen corresponding path program 1 times [2019-10-14 23:50:05,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201528687] [2019-10-14 23:50:05,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-14 23:50:05,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201528687] [2019-10-14 23:50:05,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931274687] [2019-10-14 23:50:05,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:05,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 850 proven. 0 refuted. 0 times theorem prover too weak. 1154 trivial. 0 not checked. [2019-10-14 23:50:06,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:06,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:06,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938600893] [2019-10-14 23:50:06,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:06,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:06,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:06,326 INFO L87 Difference]: Start difference. First operand 2504 states and 3558 transitions. Second operand 3 states. [2019-10-14 23:50:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:06,418 INFO L93 Difference]: Finished difference Result 2564 states and 3644 transitions. [2019-10-14 23:50:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:06,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-14 23:50:06,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:06,430 INFO L225 Difference]: With dead ends: 2564 [2019-10-14 23:50:06,430 INFO L226 Difference]: Without dead ends: 2075 [2019-10-14 23:50:06,433 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 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:50:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-10-14 23:50:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2017. [2019-10-14 23:50:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2017 states. [2019-10-14 23:50:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2866 transitions. [2019-10-14 23:50:06,535 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2866 transitions. Word has length 447 [2019-10-14 23:50:06,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,536 INFO L462 AbstractCegarLoop]: Abstraction has 2017 states and 2866 transitions. [2019-10-14 23:50:06,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2866 transitions. [2019-10-14 23:50:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-10-14 23:50:06,550 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:06,550 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:06,757 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:06,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1991023065, now seen corresponding path program 1 times [2019-10-14 23:50:06,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:06,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345055093] [2019-10-14 23:50:06,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-14 23:50:06,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345055093] [2019-10-14 23:50:06,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267863102] [2019-10-14 23:50:06,968 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:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:07,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2019-10-14 23:50:07,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:07,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:07,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350892709] [2019-10-14 23:50:07,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:07,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:07,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:07,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:07,291 INFO L87 Difference]: Start difference. First operand 2017 states and 2866 transitions. Second operand 3 states. [2019-10-14 23:50:07,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,473 INFO L93 Difference]: Finished difference Result 4490 states and 6393 transitions. [2019-10-14 23:50:07,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:07,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 447 [2019-10-14 23:50:07,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,486 INFO L225 Difference]: With dead ends: 4490 [2019-10-14 23:50:07,486 INFO L226 Difference]: Without dead ends: 2486 [2019-10-14 23:50:07,491 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 449 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:50:07,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2019-10-14 23:50:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2486. [2019-10-14 23:50:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2486 states. [2019-10-14 23:50:07,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 3534 transitions. [2019-10-14 23:50:07,615 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 3534 transitions. Word has length 447 [2019-10-14 23:50:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:07,616 INFO L462 AbstractCegarLoop]: Abstraction has 2486 states and 3534 transitions. [2019-10-14 23:50:07,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 3534 transitions. [2019-10-14 23:50:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-10-14 23:50:07,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:07,629 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:07,835 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash -213147291, now seen corresponding path program 1 times [2019-10-14 23:50:07,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:07,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283254554] [2019-10-14 23:50:07,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-14 23:50:08,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283254554] [2019-10-14 23:50:08,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708120967] [2019-10-14 23:50:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:08,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 865 proven. 0 refuted. 0 times theorem prover too weak. 1139 trivial. 0 not checked. [2019-10-14 23:50:08,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:08,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:08,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743649005] [2019-10-14 23:50:08,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:08,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:08,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:08,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:08,321 INFO L87 Difference]: Start difference. First operand 2486 states and 3534 transitions. Second operand 3 states. [2019-10-14 23:50:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:08,490 INFO L93 Difference]: Finished difference Result 5468 states and 7781 transitions. [2019-10-14 23:50:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:08,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 448 [2019-10-14 23:50:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:08,499 INFO L225 Difference]: With dead ends: 5468 [2019-10-14 23:50:08,500 INFO L226 Difference]: Without dead ends: 2995 [2019-10-14 23:50:08,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 450 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:50:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2995 states. [2019-10-14 23:50:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2995. [2019-10-14 23:50:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2995 states. [2019-10-14 23:50:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 4254 transitions. [2019-10-14 23:50:08,645 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 4254 transitions. Word has length 448 [2019-10-14 23:50:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:08,646 INFO L462 AbstractCegarLoop]: Abstraction has 2995 states and 4254 transitions. [2019-10-14 23:50:08,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:08,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 4254 transitions. [2019-10-14 23:50:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-10-14 23:50:08,654 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:08,655 INFO L380 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,860 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,860 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:08,861 INFO L82 PathProgramCache]: Analyzing trace with hash -915884239, now seen corresponding path program 1 times [2019-10-14 23:50:08,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:08,861 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703199222] [2019-10-14 23:50:08,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-14 23:50:09,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703199222] [2019-10-14 23:50:09,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736876360] [2019-10-14 23:50:09,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:09,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:09,372 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1051 proven. 0 refuted. 0 times theorem prover too weak. 953 trivial. 0 not checked. [2019-10-14 23:50:09,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:09,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:09,373 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428504862] [2019-10-14 23:50:09,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:09,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:09,375 INFO L87 Difference]: Start difference. First operand 2995 states and 4254 transitions. Second operand 3 states. [2019-10-14 23:50:09,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:09,543 INFO L93 Difference]: Finished difference Result 6445 states and 9168 transitions. [2019-10-14 23:50:09,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:09,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2019-10-14 23:50:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:09,552 INFO L225 Difference]: With dead ends: 6445 [2019-10-14 23:50:09,552 INFO L226 Difference]: Without dead ends: 3463 [2019-10-14 23:50:09,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 451 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:50:09,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3463 states. [2019-10-14 23:50:09,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3463 to 3463. [2019-10-14 23:50:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2019-10-14 23:50:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 4921 transitions. [2019-10-14 23:50:09,698 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 4921 transitions. Word has length 449 [2019-10-14 23:50:09,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:09,699 INFO L462 AbstractCegarLoop]: Abstraction has 3463 states and 4921 transitions. [2019-10-14 23:50:09,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:09,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 4921 transitions. [2019-10-14 23:50:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-14 23:50:09,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:09,710 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:09,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:09,915 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:09,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:09,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1109132628, now seen corresponding path program 1 times [2019-10-14 23:50:09,917 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:09,917 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937581698] [2019-10-14 23:50:09,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,917 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-14 23:50:10,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937581698] [2019-10-14 23:50:10,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988263135] [2019-10-14 23:50:10,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:10,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2019-10-14 23:50:10,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:10,851 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:10,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814421073] [2019-10-14 23:50:10,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:10,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:10,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:10,853 INFO L87 Difference]: Start difference. First operand 3463 states and 4921 transitions. Second operand 4 states. [2019-10-14 23:50:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:11,208 INFO L93 Difference]: Finished difference Result 6908 states and 9816 transitions. [2019-10-14 23:50:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:11,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-10-14 23:50:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:11,216 INFO L225 Difference]: With dead ends: 6908 [2019-10-14 23:50:11,216 INFO L226 Difference]: Without dead ends: 3381 [2019-10-14 23:50:11,223 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 604 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:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3381 states. [2019-10-14 23:50:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3381 to 3104. [2019-10-14 23:50:11,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-14 23:50:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-14 23:50:11,348 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 600 [2019-10-14 23:50:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,349 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-14 23:50:11,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-14 23:50:11,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1021 [2019-10-14 23:50:11,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,364 INFO L380 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:11,568 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:11,569 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,569 INFO L82 PathProgramCache]: Analyzing trace with hash 859855159, now seen corresponding path program 1 times [2019-10-14 23:50:11,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805680442] [2019-10-14 23:50:11,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,533 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-14 23:50:12,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805680442] [2019-10-14 23:50:12,534 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702855460] [2019-10-14 23:50:12,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:12,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2019-10-14 23:50:13,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:13,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:13,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134621329] [2019-10-14 23:50:13,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:13,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:13,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:13,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:13,279 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 4 states. [2019-10-14 23:50:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,618 INFO L93 Difference]: Finished difference Result 7213 states and 9946 transitions. [2019-10-14 23:50:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:50:13,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1020 [2019-10-14 23:50:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,628 INFO L225 Difference]: With dead ends: 7213 [2019-10-14 23:50:13,628 INFO L226 Difference]: Without dead ends: 3944 [2019-10-14 23:50:13,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 1024 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:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2019-10-14 23:50:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3104. [2019-10-14 23:50:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3104 states. [2019-10-14 23:50:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3104 states to 3104 states and 4254 transitions. [2019-10-14 23:50:13,769 INFO L78 Accepts]: Start accepts. Automaton has 3104 states and 4254 transitions. Word has length 1020 [2019-10-14 23:50:13,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,770 INFO L462 AbstractCegarLoop]: Abstraction has 3104 states and 4254 transitions. [2019-10-14 23:50:13,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:13,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3104 states and 4254 transitions. [2019-10-14 23:50:13,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1271 [2019-10-14 23:50:13,789 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,790 INFO L380 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:14,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:14,004 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:14,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1521228414, now seen corresponding path program 1 times [2019-10-14 23:50:14,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:14,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11667642] [2019-10-14 23:50:14,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 19529 backedges. 8440 proven. 0 refuted. 0 times theorem prover too weak. 11089 trivial. 0 not checked. [2019-10-14 23:50:14,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11667642] [2019-10-14 23:50:14,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:14,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:14,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114470777] [2019-10-14 23:50:14,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:14,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:14,827 INFO L87 Difference]: Start difference. First operand 3104 states and 4254 transitions. Second operand 3 states. [2019-10-14 23:50:15,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:15,041 INFO L93 Difference]: Finished difference Result 6339 states and 8682 transitions. [2019-10-14 23:50:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:15,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1270 [2019-10-14 23:50:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:15,049 INFO L225 Difference]: With dead ends: 6339 [2019-10-14 23:50:15,049 INFO L226 Difference]: Without dead ends: 3230 [2019-10-14 23:50:15,054 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:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3230 states. [2019-10-14 23:50:15,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3230 to 3160. [2019-10-14 23:50:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3160 states. [2019-10-14 23:50:15,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3160 states to 3160 states and 4313 transitions. [2019-10-14 23:50:15,215 INFO L78 Accepts]: Start accepts. Automaton has 3160 states and 4313 transitions. Word has length 1270 [2019-10-14 23:50:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:15,216 INFO L462 AbstractCegarLoop]: Abstraction has 3160 states and 4313 transitions. [2019-10-14 23:50:15,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3160 states and 4313 transitions. [2019-10-14 23:50:15,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2019-10-14 23:50:15,244 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:15,246 INFO L380 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 44, 44, 44, 44, 44, 44, 40, 40, 40, 36, 36, 32, 32, 28, 28, 24, 24, 24, 24, 20, 16, 16, 12, 12, 8, 8, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:50:15,246 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 492000992, now seen corresponding path program 1 times [2019-10-14 23:50:15,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:15,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902587237] [2019-10-14 23:50:15,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:15,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 20156 backedges. 8432 proven. 0 refuted. 0 times theorem prover too weak. 11724 trivial. 0 not checked. [2019-10-14 23:50:16,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902587237] [2019-10-14 23:50:16,061 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:16,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:16,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313785892] [2019-10-14 23:50:16,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:16,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:16,064 INFO L87 Difference]: Start difference. First operand 3160 states and 4313 transitions. Second operand 3 states. [2019-10-14 23:50:16,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:16,227 INFO L93 Difference]: Finished difference Result 4167 states and 5676 transitions. [2019-10-14 23:50:16,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:16,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1300 [2019-10-14 23:50:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:16,229 INFO L225 Difference]: With dead ends: 4167 [2019-10-14 23:50:16,229 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:16,237 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:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:16,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:16,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1300 [2019-10-14 23:50:16,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:16,239 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:16,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:16,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:16,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:16,373 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2019-10-14 23:50:16,636 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 153 [2019-10-14 23:50:17,805 WARN L191 SmtUtils]: Spent 868.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 195 [2019-10-14 23:50:18,250 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 166 [2019-10-14 23:50:18,685 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 195 [2019-10-14 23:50:20,612 WARN L191 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 154 DAG size of output: 123