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_6.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:48,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:48,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:48,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:48,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:48,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:48,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:48,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:48,296 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:48,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:48,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:48,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:48,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:48,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:48,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:48,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:48,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:48,313 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:48,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:48,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:48,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:48,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:48,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:48,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:48,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:48,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:48,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:48,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:48,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:48,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:48,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:48,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:48,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:48,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:48,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:48,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:48,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:48,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:48,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:48,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:48,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:48,347 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-13 19:50:48,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:48,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:48,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:48,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:48,367 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:48,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:48,367 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:48,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:48,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:48,368 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:48,368 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:48,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:48,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:48,369 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:48,369 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:48,369 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:48,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:48,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:48,370 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:48,370 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:48,370 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:48,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:48,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:48,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:48,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:48,371 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:48,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:48,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:48,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:48,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:48,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:48,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:48,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:48,657 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:48,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-13 19:50:48,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267c566f7/da92363d051f427c8c3491d805b50042/FLAG836ac9a97 [2019-10-13 19:50:49,254 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:49,261 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_6.cil-2.c [2019-10-13 19:50:49,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267c566f7/da92363d051f427c8c3491d805b50042/FLAG836ac9a97 [2019-10-13 19:50:49,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/267c566f7/da92363d051f427c8c3491d805b50042 [2019-10-13 19:50:49,634 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:49,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:49,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:49,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:49,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:49,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e2977e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:49, skipping insertion in model container [2019-10-13 19:50:49,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:49" (1/1) ... [2019-10-13 19:50:49,652 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:49,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:50,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:50,017 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:50,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:50,189 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:50,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50 WrapperNode [2019-10-13 19:50:50,189 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:50,190 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:50,191 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:50,191 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:50,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (1/1) ... [2019-10-13 19:50:50,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:50,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:50,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:50,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:50,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (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-13 19:50:50,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:50,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:50,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:50,326 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:50,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:50,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:50,554 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:51,190 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:51,190 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:51,193 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:51,194 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:51,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:51 BoogieIcfgContainer [2019-10-13 19:50:51,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:51,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:51,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:51,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:51,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:49" (1/3) ... [2019-10-13 19:50:51,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc090a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:51, skipping insertion in model container [2019-10-13 19:50:51,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:50" (2/3) ... [2019-10-13 19:50:51,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc090a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:51, skipping insertion in model container [2019-10-13 19:50:51,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:51" (3/3) ... [2019-10-13 19:50:51,204 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_6.cil-2.c [2019-10-13 19:50:51,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:51,223 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:51,236 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:51,263 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:51,264 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:51,264 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:51,264 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:51,264 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:51,265 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:51,265 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:51,265 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-10-13 19:50:51,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:50:51,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,316 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,318 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,326 INFO L82 PathProgramCache]: Analyzing trace with hash 887093352, now seen corresponding path program 1 times [2019-10-13 19:50:51,335 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999277136] [2019-10-13 19:50:51,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,336 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,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-13 19:50:51,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999277136] [2019-10-13 19:50:51,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447535225] [2019-10-13 19:50:51,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,688 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 5 states. [2019-10-13 19:50:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,152 INFO L93 Difference]: Finished difference Result 372 states and 644 transitions. [2019-10-13 19:50:52,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 19:50:52,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,171 INFO L225 Difference]: With dead ends: 372 [2019-10-13 19:50:52,172 INFO L226 Difference]: Without dead ends: 198 [2019-10-13 19:50:52,180 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-13 19:50:52,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-10-13 19:50:52,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2019-10-13 19:50:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-10-13 19:50:52,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 306 transitions. [2019-10-13 19:50:52,303 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 306 transitions. Word has length 49 [2019-10-13 19:50:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,305 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 306 transitions. [2019-10-13 19:50:52,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 306 transitions. [2019-10-13 19:50:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 19:50:52,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1023309003, now seen corresponding path program 1 times [2019-10-13 19:50:52,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37061156] [2019-10-13 19:50:52,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,315 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,520 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-13 19:50:52,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37061156] [2019-10-13 19:50:52,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73321464] [2019-10-13 19:50:52,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,524 INFO L87 Difference]: Start difference. First operand 188 states and 306 transitions. Second operand 5 states. [2019-10-13 19:50:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,824 INFO L93 Difference]: Finished difference Result 412 states and 684 transitions. [2019-10-13 19:50:52,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 19:50:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,828 INFO L225 Difference]: With dead ends: 412 [2019-10-13 19:50:52,828 INFO L226 Difference]: Without dead ends: 237 [2019-10-13 19:50:52,830 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-13 19:50:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-13 19:50:52,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 227. [2019-10-13 19:50:52,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-13 19:50:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 379 transitions. [2019-10-13 19:50:52,850 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 379 transitions. Word has length 50 [2019-10-13 19:50:52,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,850 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 379 transitions. [2019-10-13 19:50:52,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 379 transitions. [2019-10-13 19:50:52,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 19:50:52,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,854 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,855 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,855 INFO L82 PathProgramCache]: Analyzing trace with hash -141028317, now seen corresponding path program 1 times [2019-10-13 19:50:52,856 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,856 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136483544] [2019-10-13 19:50:52,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,998 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-13 19:50:52,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136483544] [2019-10-13 19:50:52,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174610088] [2019-10-13 19:50:53,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,001 INFO L87 Difference]: Start difference. First operand 227 states and 379 transitions. Second operand 5 states. [2019-10-13 19:50:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,251 INFO L93 Difference]: Finished difference Result 472 states and 799 transitions. [2019-10-13 19:50:53,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 19:50:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,255 INFO L225 Difference]: With dead ends: 472 [2019-10-13 19:50:53,255 INFO L226 Difference]: Without dead ends: 258 [2019-10-13 19:50:53,259 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-13 19:50:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-13 19:50:53,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2019-10-13 19:50:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-13 19:50:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 435 transitions. [2019-10-13 19:50:53,296 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 435 transitions. Word has length 77 [2019-10-13 19:50:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,298 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 435 transitions. [2019-10-13 19:50:53,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 435 transitions. [2019-10-13 19:50:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-13 19:50:53,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,305 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, 1, 1, 1] [2019-10-13 19:50:53,307 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1615796808, now seen corresponding path program 1 times [2019-10-13 19:50:53,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335421649] [2019-10-13 19:50:53,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,451 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-13 19:50:53,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335421649] [2019-10-13 19:50:53,452 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,452 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434136882] [2019-10-13 19:50:53,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,456 INFO L87 Difference]: Start difference. First operand 258 states and 435 transitions. Second operand 5 states. [2019-10-13 19:50:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,691 INFO L93 Difference]: Finished difference Result 542 states and 924 transitions. [2019-10-13 19:50:53,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:53,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-10-13 19:50:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,699 INFO L225 Difference]: With dead ends: 542 [2019-10-13 19:50:53,699 INFO L226 Difference]: Without dead ends: 297 [2019-10-13 19:50:53,700 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-13 19:50:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-13 19:50:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-13 19:50:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-13 19:50:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 500 transitions. [2019-10-13 19:50:53,718 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 500 transitions. Word has length 83 [2019-10-13 19:50:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,719 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 500 transitions. [2019-10-13 19:50:53,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 500 transitions. [2019-10-13 19:50:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-13 19:50:53,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,721 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, 1, 1, 1] [2019-10-13 19:50:53,722 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1136743931, now seen corresponding path program 1 times [2019-10-13 19:50:53,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894889543] [2019-10-13 19:50:53,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,866 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-13 19:50:53,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894889543] [2019-10-13 19:50:53,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:53,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441818368] [2019-10-13 19:50:53,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:53,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:53,869 INFO L87 Difference]: Start difference. First operand 294 states and 500 transitions. Second operand 5 states. [2019-10-13 19:50:54,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,152 INFO L93 Difference]: Finished difference Result 578 states and 987 transitions. [2019-10-13 19:50:54,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-10-13 19:50:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,155 INFO L225 Difference]: With dead ends: 578 [2019-10-13 19:50:54,155 INFO L226 Difference]: Without dead ends: 297 [2019-10-13 19:50:54,157 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-13 19:50:54,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-10-13 19:50:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2019-10-13 19:50:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-10-13 19:50:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 498 transitions. [2019-10-13 19:50:54,176 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 498 transitions. Word has length 84 [2019-10-13 19:50:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,178 INFO L462 AbstractCegarLoop]: Abstraction has 294 states and 498 transitions. [2019-10-13 19:50:54,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 498 transitions. [2019-10-13 19:50:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:54,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,181 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,182 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,182 INFO L82 PathProgramCache]: Analyzing trace with hash -2104928583, now seen corresponding path program 1 times [2019-10-13 19:50:54,182 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200016344] [2019-10-13 19:50:54,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,242 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-13 19:50:54,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200016344] [2019-10-13 19:50:54,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,243 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232654560] [2019-10-13 19:50:54,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,244 INFO L87 Difference]: Start difference. First operand 294 states and 498 transitions. Second operand 5 states. [2019-10-13 19:50:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,428 INFO L93 Difference]: Finished difference Result 592 states and 1007 transitions. [2019-10-13 19:50:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,435 INFO L225 Difference]: With dead ends: 592 [2019-10-13 19:50:54,436 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 19:50:54,437 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-13 19:50:54,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 19:50:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-13 19:50:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-13 19:50:54,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 520 transitions. [2019-10-13 19:50:54,462 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 520 transitions. Word has length 89 [2019-10-13 19:50:54,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,463 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 520 transitions. [2019-10-13 19:50:54,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 520 transitions. [2019-10-13 19:50:54,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:54,469 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,470 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash -281961503, now seen corresponding path program 1 times [2019-10-13 19:50:54,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600483166] [2019-10-13 19:50:54,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,541 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-13 19:50:54,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600483166] [2019-10-13 19:50:54,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254879915] [2019-10-13 19:50:54,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,543 INFO L87 Difference]: Start difference. First operand 309 states and 520 transitions. Second operand 5 states. [2019-10-13 19:50:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,746 INFO L93 Difference]: Finished difference Result 607 states and 1025 transitions. [2019-10-13 19:50:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:54,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,749 INFO L225 Difference]: With dead ends: 607 [2019-10-13 19:50:54,750 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 19:50:54,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-13 19:50:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 19:50:54,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2019-10-13 19:50:54,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-13 19:50:54,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 516 transitions. [2019-10-13 19:50:54,768 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 516 transitions. Word has length 90 [2019-10-13 19:50:54,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,768 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 516 transitions. [2019-10-13 19:50:54,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:54,769 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 516 transitions. [2019-10-13 19:50:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:50:54,770 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,770 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,771 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1109463774, now seen corresponding path program 1 times [2019-10-13 19:50:54,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648556552] [2019-10-13 19:50:54,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,772 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,843 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-13 19:50:54,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648556552] [2019-10-13 19:50:54,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:54,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157568097] [2019-10-13 19:50:54,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:54,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:54,847 INFO L87 Difference]: Start difference. First operand 309 states and 516 transitions. Second operand 5 states. [2019-10-13 19:50:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,041 INFO L93 Difference]: Finished difference Result 614 states and 1027 transitions. [2019-10-13 19:50:55,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:50:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,045 INFO L225 Difference]: With dead ends: 614 [2019-10-13 19:50:55,046 INFO L226 Difference]: Without dead ends: 318 [2019-10-13 19:50:55,047 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-13 19:50:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-13 19:50:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2019-10-13 19:50:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-13 19:50:55,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 522 transitions. [2019-10-13 19:50:55,065 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 522 transitions. Word has length 102 [2019-10-13 19:50:55,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,065 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 522 transitions. [2019-10-13 19:50:55,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,066 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 522 transitions. [2019-10-13 19:50:55,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:50:55,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,068 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,068 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1351505052, now seen corresponding path program 1 times [2019-10-13 19:50:55,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382091037] [2019-10-13 19:50:55,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,141 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-13 19:50:55,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382091037] [2019-10-13 19:50:55,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781487521] [2019-10-13 19:50:55,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,144 INFO L87 Difference]: Start difference. First operand 318 states and 522 transitions. Second operand 5 states. [2019-10-13 19:50:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,370 INFO L93 Difference]: Finished difference Result 654 states and 1080 transitions. [2019-10-13 19:50:55,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:50:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,374 INFO L225 Difference]: With dead ends: 654 [2019-10-13 19:50:55,374 INFO L226 Difference]: Without dead ends: 349 [2019-10-13 19:50:55,375 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-13 19:50:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-13 19:50:55,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-13 19:50:55,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-13 19:50:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 569 transitions. [2019-10-13 19:50:55,395 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 569 transitions. Word has length 103 [2019-10-13 19:50:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,397 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 569 transitions. [2019-10-13 19:50:55,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 569 transitions. [2019-10-13 19:50:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:50:55,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,404 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,404 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1217914916, now seen corresponding path program 1 times [2019-10-13 19:50:55,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827732220] [2019-10-13 19:50:55,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,480 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-13 19:50:55,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827732220] [2019-10-13 19:50:55,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195765057] [2019-10-13 19:50:55,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,483 INFO L87 Difference]: Start difference. First operand 347 states and 569 transitions. Second operand 5 states. [2019-10-13 19:50:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,682 INFO L93 Difference]: Finished difference Result 683 states and 1123 transitions. [2019-10-13 19:50:55,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:50:55,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,685 INFO L225 Difference]: With dead ends: 683 [2019-10-13 19:50:55,685 INFO L226 Difference]: Without dead ends: 349 [2019-10-13 19:50:55,686 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-13 19:50:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-13 19:50:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2019-10-13 19:50:55,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-10-13 19:50:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 565 transitions. [2019-10-13 19:50:55,702 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 565 transitions. Word has length 104 [2019-10-13 19:50:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,703 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 565 transitions. [2019-10-13 19:50:55,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 565 transitions. [2019-10-13 19:50:55,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:55,705 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,705 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,705 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1213371254, now seen corresponding path program 1 times [2019-10-13 19:50:55,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362256297] [2019-10-13 19:50:55,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,766 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-13 19:50:55,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362256297] [2019-10-13 19:50:55,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:55,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006982083] [2019-10-13 19:50:55,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:55,767 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:55,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:55,768 INFO L87 Difference]: Start difference. First operand 347 states and 565 transitions. Second operand 5 states. [2019-10-13 19:50:55,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,959 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2019-10-13 19:50:55,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:55,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:55,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,962 INFO L225 Difference]: With dead ends: 717 [2019-10-13 19:50:55,963 INFO L226 Difference]: Without dead ends: 383 [2019-10-13 19:50:55,964 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-13 19:50:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-13 19:50:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-13 19:50:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-13 19:50:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 607 transitions. [2019-10-13 19:50:55,981 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 607 transitions. Word has length 106 [2019-10-13 19:50:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,981 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 607 transitions. [2019-10-13 19:50:55,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 607 transitions. [2019-10-13 19:50:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:50:55,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,983 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,984 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1820780382, now seen corresponding path program 1 times [2019-10-13 19:50:55,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439949683] [2019-10-13 19:50:55,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,053 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-13 19:50:56,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439949683] [2019-10-13 19:50:56,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032205005] [2019-10-13 19:50:56,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,056 INFO L87 Difference]: Start difference. First operand 374 states and 607 transitions. Second operand 5 states. [2019-10-13 19:50:56,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,257 INFO L93 Difference]: Finished difference Result 744 states and 1212 transitions. [2019-10-13 19:50:56,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-13 19:50:56,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,260 INFO L225 Difference]: With dead ends: 744 [2019-10-13 19:50:56,260 INFO L226 Difference]: Without dead ends: 383 [2019-10-13 19:50:56,261 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-13 19:50:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-10-13 19:50:56,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 374. [2019-10-13 19:50:56,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-10-13 19:50:56,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 602 transitions. [2019-10-13 19:50:56,278 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 602 transitions. Word has length 107 [2019-10-13 19:50:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,279 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 602 transitions. [2019-10-13 19:50:56,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 602 transitions. [2019-10-13 19:50:56,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 19:50:56,281 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,281 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, 1, 1, 1, 1] [2019-10-13 19:50:56,281 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1208949664, now seen corresponding path program 1 times [2019-10-13 19:50:56,282 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,282 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875393084] [2019-10-13 19:50:56,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,342 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-13 19:50:56,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875393084] [2019-10-13 19:50:56,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233258558] [2019-10-13 19:50:56,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,345 INFO L87 Difference]: Start difference. First operand 374 states and 602 transitions. Second operand 5 states. [2019-10-13 19:50:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,566 INFO L93 Difference]: Finished difference Result 772 states and 1247 transitions. [2019-10-13 19:50:56,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-10-13 19:50:56,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,570 INFO L225 Difference]: With dead ends: 772 [2019-10-13 19:50:56,570 INFO L226 Difference]: Without dead ends: 411 [2019-10-13 19:50:56,571 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-13 19:50:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-13 19:50:56,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-13 19:50:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-13 19:50:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 655 transitions. [2019-10-13 19:50:56,593 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 655 transitions. Word has length 115 [2019-10-13 19:50:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,593 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 655 transitions. [2019-10-13 19:50:56,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 655 transitions. [2019-10-13 19:50:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 19:50:56,595 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,596 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, 1, 1, 1, 1] [2019-10-13 19:50:56,596 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,596 INFO L82 PathProgramCache]: Analyzing trace with hash 523971907, now seen corresponding path program 1 times [2019-10-13 19:50:56,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948886443] [2019-10-13 19:50:56,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,668 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-13 19:50:56,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948886443] [2019-10-13 19:50:56,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:56,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934437078] [2019-10-13 19:50:56,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:56,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:56,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:56,670 INFO L87 Difference]: Start difference. First operand 408 states and 655 transitions. Second operand 5 states. [2019-10-13 19:50:56,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,917 INFO L93 Difference]: Finished difference Result 806 states and 1297 transitions. [2019-10-13 19:50:56,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:56,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-10-13 19:50:56,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,919 INFO L225 Difference]: With dead ends: 806 [2019-10-13 19:50:56,920 INFO L226 Difference]: Without dead ends: 411 [2019-10-13 19:50:56,922 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-13 19:50:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-10-13 19:50:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2019-10-13 19:50:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-10-13 19:50:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 652 transitions. [2019-10-13 19:50:56,940 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 652 transitions. Word has length 116 [2019-10-13 19:50:56,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,940 INFO L462 AbstractCegarLoop]: Abstraction has 408 states and 652 transitions. [2019-10-13 19:50:56,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:56,940 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 652 transitions. [2019-10-13 19:50:56,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 19:50:56,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,942 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, 1] [2019-10-13 19:50:56,942 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1148759440, now seen corresponding path program 1 times [2019-10-13 19:50:56,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438670074] [2019-10-13 19:50:56,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,020 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-13 19:50:57,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438670074] [2019-10-13 19:50:57,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664790768] [2019-10-13 19:50:57,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,023 INFO L87 Difference]: Start difference. First operand 408 states and 652 transitions. Second operand 5 states. [2019-10-13 19:50:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,245 INFO L93 Difference]: Finished difference Result 851 states and 1363 transitions. [2019-10-13 19:50:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,246 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-13 19:50:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,248 INFO L225 Difference]: With dead ends: 851 [2019-10-13 19:50:57,249 INFO L226 Difference]: Without dead ends: 456 [2019-10-13 19:50:57,251 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-13 19:50:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-10-13 19:50:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 450. [2019-10-13 19:50:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-10-13 19:50:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 717 transitions. [2019-10-13 19:50:57,271 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 717 transitions. Word has length 119 [2019-10-13 19:50:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,271 INFO L462 AbstractCegarLoop]: Abstraction has 450 states and 717 transitions. [2019-10-13 19:50:57,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 717 transitions. [2019-10-13 19:50:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 19:50:57,273 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,273 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, 1, 1] [2019-10-13 19:50:57,274 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 669551219, now seen corresponding path program 1 times [2019-10-13 19:50:57,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769342199] [2019-10-13 19:50:57,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,338 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-13 19:50:57,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769342199] [2019-10-13 19:50:57,345 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,346 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120654189] [2019-10-13 19:50:57,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,347 INFO L87 Difference]: Start difference. First operand 450 states and 717 transitions. Second operand 5 states. [2019-10-13 19:50:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,577 INFO L93 Difference]: Finished difference Result 897 states and 1434 transitions. [2019-10-13 19:50:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-13 19:50:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,580 INFO L225 Difference]: With dead ends: 897 [2019-10-13 19:50:57,580 INFO L226 Difference]: Without dead ends: 458 [2019-10-13 19:50:57,582 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-13 19:50:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-10-13 19:50:57,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2019-10-13 19:50:57,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-13 19:50:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 720 transitions. [2019-10-13 19:50:57,603 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 720 transitions. Word has length 120 [2019-10-13 19:50:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,604 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 720 transitions. [2019-10-13 19:50:57,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 720 transitions. [2019-10-13 19:50:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 19:50:57,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,606 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, 1, 1, 1] [2019-10-13 19:50:57,607 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 534907766, now seen corresponding path program 1 times [2019-10-13 19:50:57,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811977529] [2019-10-13 19:50:57,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,702 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-13 19:50:57,702 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811977529] [2019-10-13 19:50:57,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:57,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:57,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455696494] [2019-10-13 19:50:57,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:57,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:57,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,704 INFO L87 Difference]: Start difference. First operand 452 states and 720 transitions. Second operand 5 states. [2019-10-13 19:50:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,913 INFO L93 Difference]: Finished difference Result 930 states and 1489 transitions. [2019-10-13 19:50:57,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:57,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-13 19:50:57,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,917 INFO L225 Difference]: With dead ends: 930 [2019-10-13 19:50:57,917 INFO L226 Difference]: Without dead ends: 491 [2019-10-13 19:50:57,918 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-13 19:50:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-13 19:50:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 19:50:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 755 transitions. [2019-10-13 19:50:57,940 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 755 transitions. Word has length 132 [2019-10-13 19:50:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,940 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 755 transitions. [2019-10-13 19:50:57,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 755 transitions. [2019-10-13 19:50:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 19:50:57,942 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,943 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, 1, 1, 1] [2019-10-13 19:50:57,943 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash 535914030, now seen corresponding path program 1 times [2019-10-13 19:50:57,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401861538] [2019-10-13 19:50:57,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,005 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-13 19:50:58,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401861538] [2019-10-13 19:50:58,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264923002] [2019-10-13 19:50:58,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,007 INFO L87 Difference]: Start difference. First operand 477 states and 755 transitions. Second operand 5 states. [2019-10-13 19:50:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,203 INFO L93 Difference]: Finished difference Result 955 states and 1516 transitions. [2019-10-13 19:50:58,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 19:50:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,206 INFO L225 Difference]: With dead ends: 955 [2019-10-13 19:50:58,206 INFO L226 Difference]: Without dead ends: 491 [2019-10-13 19:50:58,207 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-13 19:50:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-13 19:50:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2019-10-13 19:50:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 19:50:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 747 transitions. [2019-10-13 19:50:58,229 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 747 transitions. Word has length 133 [2019-10-13 19:50:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,230 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 747 transitions. [2019-10-13 19:50:58,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 747 transitions. [2019-10-13 19:50:58,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 19:50:58,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,233 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, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,233 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1278605743, now seen corresponding path program 1 times [2019-10-13 19:50:58,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077085115] [2019-10-13 19:50:58,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,316 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-13 19:50:58,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077085115] [2019-10-13 19:50:58,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716842911] [2019-10-13 19:50:58,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,321 INFO L87 Difference]: Start difference. First operand 477 states and 747 transitions. Second operand 5 states. [2019-10-13 19:50:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,668 INFO L93 Difference]: Finished difference Result 947 states and 1486 transitions. [2019-10-13 19:50:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-13 19:50:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,672 INFO L225 Difference]: With dead ends: 947 [2019-10-13 19:50:58,673 INFO L226 Difference]: Without dead ends: 483 [2019-10-13 19:50:58,674 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-13 19:50:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-13 19:50:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-13 19:50:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 19:50:58,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 742 transitions. [2019-10-13 19:50:58,715 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 742 transitions. Word has length 148 [2019-10-13 19:50:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,716 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 742 transitions. [2019-10-13 19:50:58,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 742 transitions. [2019-10-13 19:50:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 19:50:58,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,721 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, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:58,721 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1353663186, now seen corresponding path program 1 times [2019-10-13 19:50:58,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620337161] [2019-10-13 19:50:58,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,824 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-13 19:50:58,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620337161] [2019-10-13 19:50:58,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:58,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:58,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506099216] [2019-10-13 19:50:58,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:58,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:58,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:58,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:58,828 INFO L87 Difference]: Start difference. First operand 477 states and 742 transitions. Second operand 5 states. [2019-10-13 19:50:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,299 INFO L93 Difference]: Finished difference Result 947 states and 1476 transitions. [2019-10-13 19:50:59,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-10-13 19:50:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,304 INFO L225 Difference]: With dead ends: 947 [2019-10-13 19:50:59,304 INFO L226 Difference]: Without dead ends: 483 [2019-10-13 19:50:59,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-13 19:50:59,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-13 19:50:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 477. [2019-10-13 19:50:59,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 19:50:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 737 transitions. [2019-10-13 19:50:59,338 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 737 transitions. Word has length 149 [2019-10-13 19:50:59,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,339 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 737 transitions. [2019-10-13 19:50:59,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 737 transitions. [2019-10-13 19:50:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 19:50:59,343 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,343 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, 1, 1, 1] [2019-10-13 19:50:59,343 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1186463222, now seen corresponding path program 1 times [2019-10-13 19:50:59,344 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261981535] [2019-10-13 19:50:59,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,463 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-13 19:50:59,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261981535] [2019-10-13 19:50:59,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945343002] [2019-10-13 19:50:59,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,466 INFO L87 Difference]: Start difference. First operand 477 states and 737 transitions. Second operand 5 states. [2019-10-13 19:50:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,746 INFO L93 Difference]: Finished difference Result 970 states and 1504 transitions. [2019-10-13 19:50:59,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:59,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 19:50:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,751 INFO L225 Difference]: With dead ends: 970 [2019-10-13 19:50:59,751 INFO L226 Difference]: Without dead ends: 506 [2019-10-13 19:50:59,753 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-13 19:50:59,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-13 19:50:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-13 19:50:59,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-13 19:50:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 768 transitions. [2019-10-13 19:50:59,785 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 768 transitions. Word has length 153 [2019-10-13 19:50:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,785 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 768 transitions. [2019-10-13 19:50:59,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 768 transitions. [2019-10-13 19:50:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-13 19:50:59,790 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,790 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, 1, 1, 1] [2019-10-13 19:50:59,790 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,791 INFO L82 PathProgramCache]: Analyzing trace with hash 320058782, now seen corresponding path program 1 times [2019-10-13 19:50:59,791 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,792 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452041226] [2019-10-13 19:50:59,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,792 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,893 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-13 19:50:59,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452041226] [2019-10-13 19:50:59,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:59,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592023525] [2019-10-13 19:50:59,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:59,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:59,896 INFO L87 Difference]: Start difference. First operand 501 states and 768 transitions. Second operand 5 states. [2019-10-13 19:51:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,124 INFO L93 Difference]: Finished difference Result 994 states and 1526 transitions. [2019-10-13 19:51:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 154 [2019-10-13 19:51:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,127 INFO L225 Difference]: With dead ends: 994 [2019-10-13 19:51:00,127 INFO L226 Difference]: Without dead ends: 506 [2019-10-13 19:51:00,128 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-13 19:51:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-10-13 19:51:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 501. [2019-10-13 19:51:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-13 19:51:00,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 759 transitions. [2019-10-13 19:51:00,152 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 759 transitions. Word has length 154 [2019-10-13 19:51:00,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,152 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 759 transitions. [2019-10-13 19:51:00,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,153 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 759 transitions. [2019-10-13 19:51:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 19:51:00,155 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,155 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, 1, 1] [2019-10-13 19:51:00,155 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1626033845, now seen corresponding path program 1 times [2019-10-13 19:51:00,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364841977] [2019-10-13 19:51:00,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,222 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-13 19:51:00,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364841977] [2019-10-13 19:51:00,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105376274] [2019-10-13 19:51:00,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,224 INFO L87 Difference]: Start difference. First operand 501 states and 759 transitions. Second operand 5 states. [2019-10-13 19:51:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,436 INFO L93 Difference]: Finished difference Result 1037 states and 1569 transitions. [2019-10-13 19:51:00,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-13 19:51:00,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,440 INFO L225 Difference]: With dead ends: 1037 [2019-10-13 19:51:00,440 INFO L226 Difference]: Without dead ends: 549 [2019-10-13 19:51:00,441 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-13 19:51:00,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-10-13 19:51:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2019-10-13 19:51:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-13 19:51:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 814 transitions. [2019-10-13 19:51:00,468 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 814 transitions. Word has length 159 [2019-10-13 19:51:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,469 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 814 transitions. [2019-10-13 19:51:00,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 814 transitions. [2019-10-13 19:51:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-13 19:51:00,471 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,471 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, 1, 1] [2019-10-13 19:51:00,472 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,472 INFO L82 PathProgramCache]: Analyzing trace with hash 885119950, now seen corresponding path program 1 times [2019-10-13 19:51:00,472 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663625349] [2019-10-13 19:51:00,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,540 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-13 19:51:00,540 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663625349] [2019-10-13 19:51:00,540 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730883909] [2019-10-13 19:51:00,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,542 INFO L87 Difference]: Start difference. First operand 542 states and 814 transitions. Second operand 5 states. [2019-10-13 19:51:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,803 INFO L93 Difference]: Finished difference Result 1078 states and 1622 transitions. [2019-10-13 19:51:00,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:00,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2019-10-13 19:51:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,806 INFO L225 Difference]: With dead ends: 1078 [2019-10-13 19:51:00,806 INFO L226 Difference]: Without dead ends: 530 [2019-10-13 19:51:00,807 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-13 19:51:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2019-10-13 19:51:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2019-10-13 19:51:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-10-13 19:51:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 784 transitions. [2019-10-13 19:51:00,830 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 784 transitions. Word has length 160 [2019-10-13 19:51:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,831 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 784 transitions. [2019-10-13 19:51:00,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 784 transitions. [2019-10-13 19:51:00,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-13 19:51:00,833 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,833 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, 1, 1, 1] [2019-10-13 19:51:00,834 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1076584642, now seen corresponding path program 1 times [2019-10-13 19:51:00,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041775961] [2019-10-13 19:51:00,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,902 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-13 19:51:00,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041775961] [2019-10-13 19:51:00,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:00,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:00,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486028137] [2019-10-13 19:51:00,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:00,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,904 INFO L87 Difference]: Start difference. First operand 523 states and 784 transitions. Second operand 5 states. [2019-10-13 19:51:01,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,109 INFO L93 Difference]: Finished difference Result 1058 states and 1592 transitions. [2019-10-13 19:51:01,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-13 19:51:01,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,113 INFO L225 Difference]: With dead ends: 1058 [2019-10-13 19:51:01,113 INFO L226 Difference]: Without dead ends: 548 [2019-10-13 19:51:01,114 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-13 19:51:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-10-13 19:51:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 544. [2019-10-13 19:51:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-10-13 19:51:01,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 808 transitions. [2019-10-13 19:51:01,144 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 808 transitions. Word has length 174 [2019-10-13 19:51:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,145 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 808 transitions. [2019-10-13 19:51:01,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 808 transitions. [2019-10-13 19:51:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-13 19:51:01,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,148 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, 1, 1, 1] [2019-10-13 19:51:01,148 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 415925946, now seen corresponding path program 1 times [2019-10-13 19:51:01,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517322405] [2019-10-13 19:51:01,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,212 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-13 19:51:01,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517322405] [2019-10-13 19:51:01,212 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:51:01,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220981919] [2019-10-13 19:51:01,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:51:01,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:51:01,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,215 INFO L87 Difference]: Start difference. First operand 544 states and 808 transitions. Second operand 5 states. [2019-10-13 19:51:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,414 INFO L93 Difference]: Finished difference Result 1079 states and 1605 transitions. [2019-10-13 19:51:01,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:01,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-13 19:51:01,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,418 INFO L225 Difference]: With dead ends: 1079 [2019-10-13 19:51:01,419 INFO L226 Difference]: Without dead ends: 546 [2019-10-13 19:51:01,420 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-13 19:51:01,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-13 19:51:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 542. [2019-10-13 19:51:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-10-13 19:51:01,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 794 transitions. [2019-10-13 19:51:01,443 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 794 transitions. Word has length 175 [2019-10-13 19:51:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,444 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 794 transitions. [2019-10-13 19:51:01,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:51:01,444 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 794 transitions. [2019-10-13 19:51:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-13 19:51:01,446 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,447 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, 1, 1, 1] [2019-10-13 19:51:01,447 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1910899715, now seen corresponding path program 1 times [2019-10-13 19:51:01,448 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,448 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062436992] [2019-10-13 19:51:01,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,448 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,517 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-13 19:51:01,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062436992] [2019-10-13 19:51:01,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067535933] [2019-10-13 19:51:01,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,519 INFO L87 Difference]: Start difference. First operand 542 states and 794 transitions. Second operand 3 states. [2019-10-13 19:51:01,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,571 INFO L93 Difference]: Finished difference Result 1593 states and 2335 transitions. [2019-10-13 19:51:01,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-13 19:51:01,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,576 INFO L225 Difference]: With dead ends: 1593 [2019-10-13 19:51:01,577 INFO L226 Difference]: Without dead ends: 1064 [2019-10-13 19:51:01,578 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-13 19:51:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-10-13 19:51:01,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 543. [2019-10-13 19:51:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-10-13 19:51:01,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 795 transitions. [2019-10-13 19:51:01,609 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 795 transitions. Word has length 190 [2019-10-13 19:51:01,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,610 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 795 transitions. [2019-10-13 19:51:01,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,610 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 795 transitions. [2019-10-13 19:51:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-13 19:51:01,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,613 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, 1, 1, 1] [2019-10-13 19:51:01,613 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 44191041, now seen corresponding path program 1 times [2019-10-13 19:51:01,614 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,614 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412387166] [2019-10-13 19:51:01,614 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,615 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,701 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-13 19:51:01,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412387166] [2019-10-13 19:51:01,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:01,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:01,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353267826] [2019-10-13 19:51:01,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:01,703 INFO L87 Difference]: Start difference. First operand 543 states and 795 transitions. Second operand 3 states. [2019-10-13 19:51:01,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,879 INFO L93 Difference]: Finished difference Result 1601 states and 2350 transitions. [2019-10-13 19:51:01,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 190 [2019-10-13 19:51:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,887 INFO L225 Difference]: With dead ends: 1601 [2019-10-13 19:51:01,887 INFO L226 Difference]: Without dead ends: 1071 [2019-10-13 19:51:01,889 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-13 19:51:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-10-13 19:51:01,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2019-10-13 19:51:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1071 states. [2019-10-13 19:51:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1553 transitions. [2019-10-13 19:51:01,961 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1553 transitions. Word has length 190 [2019-10-13 19:51:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,961 INFO L462 AbstractCegarLoop]: Abstraction has 1071 states and 1553 transitions. [2019-10-13 19:51:01,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1553 transitions. [2019-10-13 19:51:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-13 19:51:01,965 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,966 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, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,966 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,966 INFO L82 PathProgramCache]: Analyzing trace with hash 402721867, now seen corresponding path program 1 times [2019-10-13 19:51:01,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263139040] [2019-10-13 19:51:01,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-13 19:51:02,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263139040] [2019-10-13 19:51:02,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:02,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:02,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222471752] [2019-10-13 19:51:02,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:02,041 INFO L87 Difference]: Start difference. First operand 1071 states and 1553 transitions. Second operand 3 states. [2019-10-13 19:51:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,220 INFO L93 Difference]: Finished difference Result 2657 states and 3866 transitions. [2019-10-13 19:51:02,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-13 19:51:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,230 INFO L225 Difference]: With dead ends: 2657 [2019-10-13 19:51:02,230 INFO L226 Difference]: Without dead ends: 1599 [2019-10-13 19:51:02,234 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-13 19:51:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2019-10-13 19:51:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2019-10-13 19:51:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-10-13 19:51:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2312 transitions. [2019-10-13 19:51:02,343 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2312 transitions. Word has length 192 [2019-10-13 19:51:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,344 INFO L462 AbstractCegarLoop]: Abstraction has 1599 states and 2312 transitions. [2019-10-13 19:51:02,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2312 transitions. [2019-10-13 19:51:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-13 19:51:02,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:02,349 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, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,349 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1637292960, now seen corresponding path program 1 times [2019-10-13 19:51:02,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,350 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128078426] [2019-10-13 19:51:02,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,421 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-13 19:51:02,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128078426] [2019-10-13 19:51:02,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907385837] [2019-10-13 19:51:02,422 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-13 19:51:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:51:02,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-13 19:51:02,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:02,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:02,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576823341] [2019-10-13 19:51:02,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:02,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:02,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:02,619 INFO L87 Difference]: Start difference. First operand 1599 states and 2312 transitions. Second operand 3 states. [2019-10-13 19:51:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:02,844 INFO L93 Difference]: Finished difference Result 3713 states and 5384 transitions. [2019-10-13 19:51:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:02,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2019-10-13 19:51:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:02,854 INFO L225 Difference]: With dead ends: 3713 [2019-10-13 19:51:02,854 INFO L226 Difference]: Without dead ends: 2127 [2019-10-13 19:51:02,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 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-13 19:51:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2019-10-13 19:51:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 2127. [2019-10-13 19:51:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-10-13 19:51:02,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 3073 transitions. [2019-10-13 19:51:02,996 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 3073 transitions. Word has length 193 [2019-10-13 19:51:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:02,997 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 3073 transitions. [2019-10-13 19:51:02,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:02,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 3073 transitions. [2019-10-13 19:51:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-13 19:51:03,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,003 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:03,206 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1013209815, now seen corresponding path program 1 times [2019-10-13 19:51:03,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959335450] [2019-10-13 19:51:03,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-10-13 19:51:03,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959335450] [2019-10-13 19:51:03,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976581411] [2019-10-13 19:51:03,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,362 INFO L87 Difference]: Start difference. First operand 2127 states and 3073 transitions. Second operand 3 states. [2019-10-13 19:51:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,634 INFO L93 Difference]: Finished difference Result 4734 states and 6858 transitions. [2019-10-13 19:51:03,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-13 19:51:03,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,651 INFO L225 Difference]: With dead ends: 4734 [2019-10-13 19:51:03,651 INFO L226 Difference]: Without dead ends: 2620 [2019-10-13 19:51:03,661 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-13 19:51:03,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2620 states. [2019-10-13 19:51:03,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2620. [2019-10-13 19:51:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2620 states. [2019-10-13 19:51:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3780 transitions. [2019-10-13 19:51:03,897 INFO L78 Accepts]: Start accepts. Automaton has 2620 states and 3780 transitions. Word has length 292 [2019-10-13 19:51:03,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,898 INFO L462 AbstractCegarLoop]: Abstraction has 2620 states and 3780 transitions. [2019-10-13 19:51:03,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2620 states and 3780 transitions. [2019-10-13 19:51:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-13 19:51:03,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,909 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,910 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1308592103, now seen corresponding path program 1 times [2019-10-13 19:51:03,911 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,911 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674007306] [2019-10-13 19:51:03,911 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,912 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 657 trivial. 0 not checked. [2019-10-13 19:51:04,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674007306] [2019-10-13 19:51:04,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845622012] [2019-10-13 19:51:04,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,129 INFO L87 Difference]: Start difference. First operand 2620 states and 3780 transitions. Second operand 3 states. [2019-10-13 19:51:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,500 INFO L93 Difference]: Finished difference Result 5747 states and 8307 transitions. [2019-10-13 19:51:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-13 19:51:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,521 INFO L225 Difference]: With dead ends: 5747 [2019-10-13 19:51:04,522 INFO L226 Difference]: Without dead ends: 3140 [2019-10-13 19:51:04,528 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-13 19:51:04,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-13 19:51:04,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3140. [2019-10-13 19:51:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3140 states. [2019-10-13 19:51:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3140 states to 3140 states and 4526 transitions. [2019-10-13 19:51:04,819 INFO L78 Accepts]: Start accepts. Automaton has 3140 states and 4526 transitions. Word has length 292 [2019-10-13 19:51:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,820 INFO L462 AbstractCegarLoop]: Abstraction has 3140 states and 4526 transitions. [2019-10-13 19:51:04,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3140 states and 4526 transitions. [2019-10-13 19:51:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-13 19:51:04,838 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,838 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:04,838 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1060445609, now seen corresponding path program 1 times [2019-10-13 19:51:04,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50219801] [2019-10-13 19:51:04,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2019-10-13 19:51:04,953 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50219801] [2019-10-13 19:51:04,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84716350] [2019-10-13 19:51:04,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,956 INFO L87 Difference]: Start difference. First operand 3140 states and 4526 transitions. Second operand 3 states. [2019-10-13 19:51:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,275 INFO L93 Difference]: Finished difference Result 6756 states and 9760 transitions. [2019-10-13 19:51:05,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-13 19:51:05,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,304 INFO L225 Difference]: With dead ends: 6756 [2019-10-13 19:51:05,307 INFO L226 Difference]: Without dead ends: 3629 [2019-10-13 19:51:05,313 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-13 19:51:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2019-10-13 19:51:05,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3629. [2019-10-13 19:51:05,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2019-10-13 19:51:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 5229 transitions. [2019-10-13 19:51:05,489 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 5229 transitions. Word has length 292 [2019-10-13 19:51:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,489 INFO L462 AbstractCegarLoop]: Abstraction has 3629 states and 5229 transitions. [2019-10-13 19:51:05,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 5229 transitions. [2019-10-13 19:51:05,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-13 19:51:05,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,497 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:05,497 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1157184789, now seen corresponding path program 1 times [2019-10-13 19:51:05,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495319123] [2019-10-13 19:51:05,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-13 19:51:05,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495319123] [2019-10-13 19:51:05,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:05,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:05,592 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541986694] [2019-10-13 19:51:05,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:05,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:05,593 INFO L87 Difference]: Start difference. First operand 3629 states and 5229 transitions. Second operand 3 states. [2019-10-13 19:51:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:05,882 INFO L93 Difference]: Finished difference Result 7736 states and 11168 transitions. [2019-10-13 19:51:05,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:05,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 292 [2019-10-13 19:51:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:05,894 INFO L225 Difference]: With dead ends: 7736 [2019-10-13 19:51:05,894 INFO L226 Difference]: Without dead ends: 4120 [2019-10-13 19:51:05,904 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-13 19:51:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-10-13 19:51:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4120. [2019-10-13 19:51:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2019-10-13 19:51:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 5934 transitions. [2019-10-13 19:51:06,170 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 5934 transitions. Word has length 292 [2019-10-13 19:51:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,170 INFO L462 AbstractCegarLoop]: Abstraction has 4120 states and 5934 transitions. [2019-10-13 19:51:06,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 5934 transitions. [2019-10-13 19:51:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2019-10-13 19:51:06,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,183 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, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:06,183 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1424241546, now seen corresponding path program 1 times [2019-10-13 19:51:06,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110593168] [2019-10-13 19:51:06,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 26 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-13 19:51:06,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110593168] [2019-10-13 19:51:06,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332014715] [2019-10-13 19:51:06,363 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-13 19:51:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:06,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2019-10-13 19:51:06,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:06,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:06,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769911108] [2019-10-13 19:51:06,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:06,758 INFO L87 Difference]: Start difference. First operand 4120 states and 5934 transitions. Second operand 3 states. [2019-10-13 19:51:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,032 INFO L93 Difference]: Finished difference Result 8748 states and 12617 transitions. [2019-10-13 19:51:07,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2019-10-13 19:51:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,043 INFO L225 Difference]: With dead ends: 8748 [2019-10-13 19:51:07,044 INFO L226 Difference]: Without dead ends: 4641 [2019-10-13 19:51:07,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 442 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-13 19:51:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2019-10-13 19:51:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4641. [2019-10-13 19:51:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4641 states. [2019-10-13 19:51:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4641 states to 4641 states and 6681 transitions. [2019-10-13 19:51:07,347 INFO L78 Accepts]: Start accepts. Automaton has 4641 states and 6681 transitions. Word has length 440 [2019-10-13 19:51:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,349 INFO L462 AbstractCegarLoop]: Abstraction has 4641 states and 6681 transitions. [2019-10-13 19:51:07,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,349 INFO L276 IsEmpty]: Start isEmpty. Operand 4641 states and 6681 transitions. [2019-10-13 19:51:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-13 19:51:07,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,368 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, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,582 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:07,582 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1367558780, now seen corresponding path program 1 times [2019-10-13 19:51:07,583 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794725415] [2019-10-13 19:51:07,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 840 proven. 0 refuted. 0 times theorem prover too weak. 1116 trivial. 0 not checked. [2019-10-13 19:51:07,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794725415] [2019-10-13 19:51:07,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:07,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084232174] [2019-10-13 19:51:07,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,885 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,886 INFO L87 Difference]: Start difference. First operand 4641 states and 6681 transitions. Second operand 3 states. [2019-10-13 19:51:08,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,177 INFO L93 Difference]: Finished difference Result 9791 states and 14112 transitions. [2019-10-13 19:51:08,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:08,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-10-13 19:51:08,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,189 INFO L225 Difference]: With dead ends: 9791 [2019-10-13 19:51:08,189 INFO L226 Difference]: Without dead ends: 5163 [2019-10-13 19:51:08,199 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-13 19:51:08,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5163 states. [2019-10-13 19:51:08,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5163 to 5163. [2019-10-13 19:51:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5163 states. [2019-10-13 19:51:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5163 states to 5163 states and 7429 transitions. [2019-10-13 19:51:08,441 INFO L78 Accepts]: Start accepts. Automaton has 5163 states and 7429 transitions. Word has length 441 [2019-10-13 19:51:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,442 INFO L462 AbstractCegarLoop]: Abstraction has 5163 states and 7429 transitions. [2019-10-13 19:51:08,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 5163 states and 7429 transitions. [2019-10-13 19:51:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-10-13 19:51:08,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:08,459 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, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:08,460 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:08,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:08,460 INFO L82 PathProgramCache]: Analyzing trace with hash 370864915, now seen corresponding path program 1 times [2019-10-13 19:51:08,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:08,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740716023] [2019-10-13 19:51:08,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:08,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1956 backedges. 1014 proven. 0 refuted. 0 times theorem prover too weak. 942 trivial. 0 not checked. [2019-10-13 19:51:08,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740716023] [2019-10-13 19:51:08,682 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:08,682 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:08,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801134443] [2019-10-13 19:51:08,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:08,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:08,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:08,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:08,684 INFO L87 Difference]: Start difference. First operand 5163 states and 7429 transitions. Second operand 3 states. [2019-10-13 19:51:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:09,003 INFO L93 Difference]: Finished difference Result 10794 states and 15555 transitions. [2019-10-13 19:51:09,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:09,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 442 [2019-10-13 19:51:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:09,015 INFO L225 Difference]: With dead ends: 10794 [2019-10-13 19:51:09,015 INFO L226 Difference]: Without dead ends: 5644 [2019-10-13 19:51:09,025 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-13 19:51:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2019-10-13 19:51:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 5644. [2019-10-13 19:51:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5644 states. [2019-10-13 19:51:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5644 states to 5644 states and 8124 transitions. [2019-10-13 19:51:09,253 INFO L78 Accepts]: Start accepts. Automaton has 5644 states and 8124 transitions. Word has length 442 [2019-10-13 19:51:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:09,254 INFO L462 AbstractCegarLoop]: Abstraction has 5644 states and 8124 transitions. [2019-10-13 19:51:09,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:09,254 INFO L276 IsEmpty]: Start isEmpty. Operand 5644 states and 8124 transitions. [2019-10-13 19:51:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-10-13 19:51:09,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:09,270 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, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:51:09,271 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:09,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:09,271 INFO L82 PathProgramCache]: Analyzing trace with hash 652692000, now seen corresponding path program 1 times [2019-10-13 19:51:09,271 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:09,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852568770] [2019-10-13 19:51:09,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,272 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:09,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-13 19:51:09,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852568770] [2019-10-13 19:51:09,597 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779995734] [2019-10-13 19:51:09,597 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-13 19:51:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:09,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:09,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 2753 trivial. 0 not checked. [2019-10-13 19:51:09,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:09,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:09,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719507279] [2019-10-13 19:51:09,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:09,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:09,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:09,999 INFO L87 Difference]: Start difference. First operand 5644 states and 8124 transitions. Second operand 3 states. [2019-10-13 19:51:10,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:10,283 INFO L93 Difference]: Finished difference Result 11797 states and 16999 transitions. [2019-10-13 19:51:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:10,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 591 [2019-10-13 19:51:10,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:10,296 INFO L225 Difference]: With dead ends: 11797 [2019-10-13 19:51:10,297 INFO L226 Difference]: Without dead ends: 6166 [2019-10-13 19:51:10,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 593 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-13 19:51:10,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6166 states. [2019-10-13 19:51:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6166 to 6166. [2019-10-13 19:51:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6166 states. [2019-10-13 19:51:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6166 states to 6166 states and 8872 transitions. [2019-10-13 19:51:10,576 INFO L78 Accepts]: Start accepts. Automaton has 6166 states and 8872 transitions. Word has length 591 [2019-10-13 19:51:10,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:10,578 INFO L462 AbstractCegarLoop]: Abstraction has 6166 states and 8872 transitions. [2019-10-13 19:51:10,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6166 states and 8872 transitions. [2019-10-13 19:51:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2019-10-13 19:51:10,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:10,594 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, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:51:10,799 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:10,800 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1264094977, now seen corresponding path program 1 times [2019-10-13 19:51:10,800 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:10,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850447210] [2019-10-13 19:51:10,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,801 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:10,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-13 19:51:11,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850447210] [2019-10-13 19:51:11,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813622543] [2019-10-13 19:51:11,213 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-13 19:51:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:11,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:11,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1212 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2019-10-13 19:51:11,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:11,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:11,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970901464] [2019-10-13 19:51:11,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:11,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:11,619 INFO L87 Difference]: Start difference. First operand 6166 states and 8872 transitions. Second operand 3 states. [2019-10-13 19:51:11,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:11,911 INFO L93 Difference]: Finished difference Result 12842 states and 18496 transitions. [2019-10-13 19:51:11,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:11,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 592 [2019-10-13 19:51:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:11,925 INFO L225 Difference]: With dead ends: 12842 [2019-10-13 19:51:11,925 INFO L226 Difference]: Without dead ends: 6689 [2019-10-13 19:51:11,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 594 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-13 19:51:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2019-10-13 19:51:12,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2019-10-13 19:51:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2019-10-13 19:51:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 9621 transitions. [2019-10-13 19:51:12,221 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 9621 transitions. Word has length 592 [2019-10-13 19:51:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:12,222 INFO L462 AbstractCegarLoop]: Abstraction has 6689 states and 9621 transitions. [2019-10-13 19:51:12,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 9621 transitions. [2019-10-13 19:51:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2019-10-13 19:51:12,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:12,236 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, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:51:12,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:12,441 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -294938665, now seen corresponding path program 1 times [2019-10-13 19:51:12,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:12,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028485798] [2019-10-13 19:51:12,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:12,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1996 proven. 26 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-10-13 19:51:12,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028485798] [2019-10-13 19:51:12,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690617652] [2019-10-13 19:51:12,877 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-13 19:51:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:13,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:13,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3562 backedges. 1521 proven. 0 refuted. 0 times theorem prover too weak. 2041 trivial. 0 not checked. [2019-10-13 19:51:13,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:13,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:13,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142457425] [2019-10-13 19:51:13,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:13,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:13,287 INFO L87 Difference]: Start difference. First operand 6689 states and 9621 transitions. Second operand 3 states. [2019-10-13 19:51:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:13,566 INFO L93 Difference]: Finished difference Result 13847 states and 19941 transitions. [2019-10-13 19:51:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:13,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 593 [2019-10-13 19:51:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:13,581 INFO L225 Difference]: With dead ends: 13847 [2019-10-13 19:51:13,581 INFO L226 Difference]: Without dead ends: 7171 [2019-10-13 19:51:13,592 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 595 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-13 19:51:13,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7171 states. [2019-10-13 19:51:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7171 to 7171. [2019-10-13 19:51:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7171 states. [2019-10-13 19:51:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7171 states to 7171 states and 10317 transitions. [2019-10-13 19:51:13,964 INFO L78 Accepts]: Start accepts. Automaton has 7171 states and 10317 transitions. Word has length 593 [2019-10-13 19:51:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:13,965 INFO L462 AbstractCegarLoop]: Abstraction has 7171 states and 10317 transitions. [2019-10-13 19:51:13,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:13,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7171 states and 10317 transitions. [2019-10-13 19:51:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2019-10-13 19:51:13,982 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:13,983 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:14,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:14,197 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:14,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1751651628, now seen corresponding path program 1 times [2019-10-13 19:51:14,197 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:14,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113002445] [2019-10-13 19:51:14,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,198 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:14,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-13 19:51:14,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113002445] [2019-10-13 19:51:14,567 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986731648] [2019-10-13 19:51:14,568 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-13 19:51:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:14,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:14,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 1047 proven. 0 refuted. 0 times theorem prover too weak. 4631 trivial. 0 not checked. [2019-10-13 19:51:15,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:15,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:15,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300905257] [2019-10-13 19:51:15,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:15,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:15,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:15,020 INFO L87 Difference]: Start difference. First operand 7171 states and 10317 transitions. Second operand 3 states. [2019-10-13 19:51:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:15,265 INFO L93 Difference]: Finished difference Result 14852 states and 21387 transitions. [2019-10-13 19:51:15,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:15,266 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 745 [2019-10-13 19:51:15,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:15,280 INFO L225 Difference]: With dead ends: 14852 [2019-10-13 19:51:15,280 INFO L226 Difference]: Without dead ends: 7694 [2019-10-13 19:51:15,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 747 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-13 19:51:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7694 states. [2019-10-13 19:51:15,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7694 to 7694. [2019-10-13 19:51:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7694 states. [2019-10-13 19:51:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7694 states to 7694 states and 11066 transitions. [2019-10-13 19:51:15,616 INFO L78 Accepts]: Start accepts. Automaton has 7694 states and 11066 transitions. Word has length 745 [2019-10-13 19:51:15,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:15,617 INFO L462 AbstractCegarLoop]: Abstraction has 7694 states and 11066 transitions. [2019-10-13 19:51:15,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7694 states and 11066 transitions. [2019-10-13 19:51:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2019-10-13 19:51:15,631 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:15,632 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:15,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:15,833 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:15,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:15,834 INFO L82 PathProgramCache]: Analyzing trace with hash -983126576, now seen corresponding path program 1 times [2019-10-13 19:51:15,834 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:15,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615985045] [2019-10-13 19:51:15,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,835 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:15,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-13 19:51:16,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615985045] [2019-10-13 19:51:16,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450840223] [2019-10-13 19:51:16,359 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-13 19:51:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:16,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:16,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 1586 proven. 0 refuted. 0 times theorem prover too weak. 4092 trivial. 0 not checked. [2019-10-13 19:51:16,842 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:16,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:16,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004824987] [2019-10-13 19:51:16,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:16,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:16,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:16,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:16,843 INFO L87 Difference]: Start difference. First operand 7694 states and 11066 transitions. Second operand 3 states. [2019-10-13 19:51:17,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:17,104 INFO L93 Difference]: Finished difference Result 15899 states and 22886 transitions. [2019-10-13 19:51:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:17,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 746 [2019-10-13 19:51:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:17,118 INFO L225 Difference]: With dead ends: 15899 [2019-10-13 19:51:17,118 INFO L226 Difference]: Without dead ends: 8218 [2019-10-13 19:51:17,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 751 GetRequests, 748 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-13 19:51:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8218 states. [2019-10-13 19:51:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8218 to 8218. [2019-10-13 19:51:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8218 states. [2019-10-13 19:51:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8218 states to 8218 states and 11816 transitions. [2019-10-13 19:51:17,411 INFO L78 Accepts]: Start accepts. Automaton has 8218 states and 11816 transitions. Word has length 746 [2019-10-13 19:51:17,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:17,412 INFO L462 AbstractCegarLoop]: Abstraction has 8218 states and 11816 transitions. [2019-10-13 19:51:17,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 8218 states and 11816 transitions. [2019-10-13 19:51:17,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2019-10-13 19:51:17,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:17,425 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 20, 20, 19, 19, 18, 18, 17, 17, 17, 17, 13, 12, 12, 11, 11, 10, 10, 6, 6, 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, 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-13 19:51:17,628 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:17,632 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1703465931, now seen corresponding path program 1 times [2019-10-13 19:51:17,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:17,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607831023] [2019-10-13 19:51:17,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:17,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 3420 proven. 26 refuted. 0 times theorem prover too weak. 2232 trivial. 0 not checked. [2019-10-13 19:51:18,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607831023] [2019-10-13 19:51:18,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771063059] [2019-10-13 19:51:18,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:18,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:18,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:18,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 2031 proven. 0 refuted. 0 times theorem prover too weak. 3647 trivial. 0 not checked. [2019-10-13 19:51:18,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:18,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:18,620 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935343177] [2019-10-13 19:51:18,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:18,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:18,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:18,621 INFO L87 Difference]: Start difference. First operand 8218 states and 11816 transitions. Second operand 3 states. [2019-10-13 19:51:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:18,887 INFO L93 Difference]: Finished difference Result 16906 states and 24333 transitions. [2019-10-13 19:51:18,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:18,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 747 [2019-10-13 19:51:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:18,899 INFO L225 Difference]: With dead ends: 16906 [2019-10-13 19:51:18,899 INFO L226 Difference]: Without dead ends: 8701 [2019-10-13 19:51:18,909 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 749 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-13 19:51:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8701 states. [2019-10-13 19:51:19,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8701 to 8701. [2019-10-13 19:51:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8701 states. [2019-10-13 19:51:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8701 states to 8701 states and 12513 transitions. [2019-10-13 19:51:19,235 INFO L78 Accepts]: Start accepts. Automaton has 8701 states and 12513 transitions. Word has length 747 [2019-10-13 19:51:19,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:19,235 INFO L462 AbstractCegarLoop]: Abstraction has 8701 states and 12513 transitions. [2019-10-13 19:51:19,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 8701 states and 12513 transitions. [2019-10-13 19:51:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2019-10-13 19:51:19,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:19,251 INFO L380 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 24, 24, 23, 23, 22, 22, 21, 21, 21, 21, 16, 15, 15, 14, 14, 13, 13, 8, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-13 19:51:19,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:19,572 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1976807567, now seen corresponding path program 1 times [2019-10-13 19:51:19,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:19,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865284631] [2019-10-13 19:51:19,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:19,573 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:19,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8307 backedges. 4844 proven. 26 refuted. 0 times theorem prover too weak. 3437 trivial. 0 not checked. [2019-10-13 19:51:20,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865284631] [2019-10-13 19:51:20,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048332298] [2019-10-13 19:51:20,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:20,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 1371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:20,359 INFO L279 TraceCheckSpWp]: Computing forward predicates...