java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:49:48,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:48,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:48,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:48,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:48,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:48,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:48,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:48,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:48,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:48,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:48,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:48,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:48,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:48,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:48,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:48,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:48,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:48,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:48,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:48,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:48,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:48,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:48,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:48,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:48,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:48,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:48,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:48,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:48,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:48,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:48,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:48,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:48,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:48,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:48,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:48,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:48,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:48,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:48,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:48,514 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:48,516 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:48,542 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:48,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:48,544 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:48,544 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:48,544 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:48,545 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:48,545 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:48,545 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:48,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:48,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:48,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:48,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:48,547 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:48,547 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:48,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:48,548 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:48,548 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:48,548 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:48,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:48,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:48,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:48,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:48,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:48,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:48,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:48,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:48,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:48,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:48,551 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:48,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:48,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:48,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:48,856 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:48,856 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:48,857 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-14 23:49:48,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530d63ea2/8c912c38ddde49c9b28eaaec84193723/FLAG79bc337fe [2019-10-14 23:49:49,491 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:49,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_7.cil.c [2019-10-14 23:49:49,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530d63ea2/8c912c38ddde49c9b28eaaec84193723/FLAG79bc337fe [2019-10-14 23:49:49,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/530d63ea2/8c912c38ddde49c9b28eaaec84193723 [2019-10-14 23:49:49,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:49,803 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:49,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:49,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:49,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:49,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee277f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:49, skipping insertion in model container [2019-10-14 23:49:49,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:49" (1/1) ... [2019-10-14 23:49:49,820 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:49,871 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:50,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:50,162 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:50,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:50,338 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:50,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50 WrapperNode [2019-10-14 23:49:50,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:50,340 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:50,340 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:50,340 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:50,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (1/1) ... [2019-10-14 23:49:50,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:50,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:50,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:50,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:50,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49: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-14 23:49:50,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:50,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:50,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:50,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:50,744 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:51,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:51,336 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:51,339 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:51,339 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:51,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:51 BoogieIcfgContainer [2019-10-14 23:49:51,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:51,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:51,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:51,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:51,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:49" (1/3) ... [2019-10-14 23:49:51,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558711cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:51, skipping insertion in model container [2019-10-14 23:49:51,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:50" (2/3) ... [2019-10-14 23:49:51,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558711cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:51, skipping insertion in model container [2019-10-14 23:49:51,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:51" (3/3) ... [2019-10-14 23:49:51,350 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_7.cil.c [2019-10-14 23:49:51,359 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:51,367 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:51,379 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:51,404 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:51,404 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:51,404 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:51,405 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:51,405 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:51,405 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:51,405 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:51,405 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-10-14 23:49:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:49:51,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,435 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] [2019-10-14 23:49:51,437 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1198514108, now seen corresponding path program 1 times [2019-10-14 23:49:51,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625646230] [2019-10-14 23:49:51,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,453 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:51,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625646230] [2019-10-14 23:49:51,735 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118516611] [2019-10-14 23:49:51,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,742 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,760 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 5 states. [2019-10-14 23:49:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,208 INFO L93 Difference]: Finished difference Result 338 states and 575 transitions. [2019-10-14 23:49:52,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-10-14 23:49:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,225 INFO L225 Difference]: With dead ends: 338 [2019-10-14 23:49:52,226 INFO L226 Difference]: Without dead ends: 176 [2019-10-14 23:49:52,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-14 23:49:52,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 165. [2019-10-14 23:49:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-14 23:49:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2019-10-14 23:49:52,295 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 38 [2019-10-14 23:49:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,296 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2019-10-14 23:49:52,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,296 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2019-10-14 23:49:52,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:49:52,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,299 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] [2019-10-14 23:49:52,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash -733377836, now seen corresponding path program 1 times [2019-10-14 23:49:52,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930282941] [2019-10-14 23:49:52,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:52,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930282941] [2019-10-14 23:49:52,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351341443] [2019-10-14 23:49:52,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,468 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand 5 states. [2019-10-14 23:49:52,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,790 INFO L93 Difference]: Finished difference Result 356 states and 571 transitions. [2019-10-14 23:49:52,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:52,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-10-14 23:49:52,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,793 INFO L225 Difference]: With dead ends: 356 [2019-10-14 23:49:52,793 INFO L226 Difference]: Without dead ends: 204 [2019-10-14 23:49:52,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-14 23:49:52,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2019-10-14 23:49:52,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-14 23:49:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 311 transitions. [2019-10-14 23:49:52,816 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 311 transitions. Word has length 39 [2019-10-14 23:49:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,816 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 311 transitions. [2019-10-14 23:49:52,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:52,817 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 311 transitions. [2019-10-14 23:49:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:49:52,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,819 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] [2019-10-14 23:49:52,820 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash 2008699792, now seen corresponding path program 1 times [2019-10-14 23:49:52,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,821 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739451236] [2019-10-14 23:49:52,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,821 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:52,936 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739451236] [2019-10-14 23:49:52,936 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:52,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930241255] [2019-10-14 23:49:52,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:52,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:52,944 INFO L87 Difference]: Start difference. First operand 193 states and 311 transitions. Second operand 5 states. [2019-10-14 23:49:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,260 INFO L93 Difference]: Finished difference Result 417 states and 682 transitions. [2019-10-14 23:49:53,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-14 23:49:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,264 INFO L225 Difference]: With dead ends: 417 [2019-10-14 23:49:53,264 INFO L226 Difference]: Without dead ends: 237 [2019-10-14 23:49:53,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-14 23:49:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2019-10-14 23:49:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-10-14 23:49:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 380 transitions. [2019-10-14 23:49:53,299 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 380 transitions. Word has length 45 [2019-10-14 23:49:53,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,300 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 380 transitions. [2019-10-14 23:49:53,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 380 transitions. [2019-10-14 23:49:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:49:53,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,309 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] [2019-10-14 23:49:53,309 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2133173875, now seen corresponding path program 1 times [2019-10-14 23:49:53,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,310 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547270808] [2019-10-14 23:49:53,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:53,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547270808] [2019-10-14 23:49:53,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,438 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754151970] [2019-10-14 23:49:53,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,440 INFO L87 Difference]: Start difference. First operand 231 states and 380 transitions. Second operand 5 states. [2019-10-14 23:49:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,674 INFO L93 Difference]: Finished difference Result 466 states and 772 transitions. [2019-10-14 23:49:53,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-14 23:49:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,677 INFO L225 Difference]: With dead ends: 466 [2019-10-14 23:49:53,677 INFO L226 Difference]: Without dead ends: 248 [2019-10-14 23:49:53,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-14 23:49:53,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2019-10-14 23:49:53,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-14 23:49:53,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 401 transitions. [2019-10-14 23:49:53,694 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 401 transitions. Word has length 46 [2019-10-14 23:49:53,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,695 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 401 transitions. [2019-10-14 23:49:53,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:53,695 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 401 transitions. [2019-10-14 23:49:53,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-14 23:49:53,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,697 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:53,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,697 INFO L82 PathProgramCache]: Analyzing trace with hash 648824040, now seen corresponding path program 1 times [2019-10-14 23:49:53,698 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,698 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886687269] [2019-10-14 23:49:53,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,698 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:53,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886687269] [2019-10-14 23:49:53,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:53,776 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154538861] [2019-10-14 23:49:53,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:53,777 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:53,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:53,778 INFO L87 Difference]: Start difference. First operand 242 states and 401 transitions. Second operand 5 states. [2019-10-14 23:49:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,978 INFO L93 Difference]: Finished difference Result 510 states and 854 transitions. [2019-10-14 23:49:53,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:53,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-10-14 23:49:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,981 INFO L225 Difference]: With dead ends: 510 [2019-10-14 23:49:53,981 INFO L226 Difference]: Without dead ends: 281 [2019-10-14 23:49:53,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:53,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-14 23:49:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-14 23:49:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-14 23:49:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 444 transitions. [2019-10-14 23:49:54,009 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 444 transitions. Word has length 64 [2019-10-14 23:49:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,010 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 444 transitions. [2019-10-14 23:49:54,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 444 transitions. [2019-10-14 23:49:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-14 23:49:54,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,015 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,016 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash 943009440, now seen corresponding path program 1 times [2019-10-14 23:49:54,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692924802] [2019-10-14 23:49:54,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:54,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692924802] [2019-10-14 23:49:54,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,147 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287344074] [2019-10-14 23:49:54,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,149 INFO L87 Difference]: Start difference. First operand 267 states and 444 transitions. Second operand 5 states. [2019-10-14 23:49:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,364 INFO L93 Difference]: Finished difference Result 535 states and 894 transitions. [2019-10-14 23:49:54,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-14 23:49:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,367 INFO L225 Difference]: With dead ends: 535 [2019-10-14 23:49:54,367 INFO L226 Difference]: Without dead ends: 281 [2019-10-14 23:49:54,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-14 23:49:54,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 267. [2019-10-14 23:49:54,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-14 23:49:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 441 transitions. [2019-10-14 23:49:54,381 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 441 transitions. Word has length 65 [2019-10-14 23:49:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,382 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 441 transitions. [2019-10-14 23:49:54,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,382 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 441 transitions. [2019-10-14 23:49:54,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-14 23:49:54,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,384 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,384 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1195194559, now seen corresponding path program 1 times [2019-10-14 23:49:54,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128472010] [2019-10-14 23:49:54,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:54,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128472010] [2019-10-14 23:49:54,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,441 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574447178] [2019-10-14 23:49:54,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,442 INFO L87 Difference]: Start difference. First operand 267 states and 441 transitions. Second operand 5 states. [2019-10-14 23:49:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,649 INFO L93 Difference]: Finished difference Result 552 states and 919 transitions. [2019-10-14 23:49:54,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-10-14 23:49:54,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,652 INFO L225 Difference]: With dead ends: 552 [2019-10-14 23:49:54,652 INFO L226 Difference]: Without dead ends: 298 [2019-10-14 23:49:54,653 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-10-14 23:49:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2019-10-14 23:49:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-14 23:49:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 493 transitions. [2019-10-14 23:49:54,667 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 493 transitions. Word has length 66 [2019-10-14 23:49:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,667 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 493 transitions. [2019-10-14 23:49:54,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,667 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 493 transitions. [2019-10-14 23:49:54,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:49:54,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,669 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:54,669 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,669 INFO L82 PathProgramCache]: Analyzing trace with hash -379332949, now seen corresponding path program 1 times [2019-10-14 23:49:54,670 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922473820] [2019-10-14 23:49:54,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:54,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922473820] [2019-10-14 23:49:54,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:54,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629059163] [2019-10-14 23:49:54,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:54,735 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:54,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:54,735 INFO L87 Difference]: Start difference. First operand 298 states and 493 transitions. Second operand 5 states. [2019-10-14 23:49:54,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,925 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-14 23:49:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:54,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-14 23:49:54,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,928 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:49:54,928 INFO L226 Difference]: Without dead ends: 315 [2019-10-14 23:49:54,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-14 23:49:54,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2019-10-14 23:49:54,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2019-10-14 23:49:54,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 514 transitions. [2019-10-14 23:49:54,945 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 514 transitions. Word has length 78 [2019-10-14 23:49:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,946 INFO L462 AbstractCegarLoop]: Abstraction has 313 states and 514 transitions. [2019-10-14 23:49:54,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 514 transitions. [2019-10-14 23:49:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-14 23:49:54,947 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,948 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] [2019-10-14 23:49:54,948 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash 314969472, now seen corresponding path program 1 times [2019-10-14 23:49:54,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509720285] [2019-10-14 23:49:54,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:55,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509720285] [2019-10-14 23:49:55,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207410431] [2019-10-14 23:49:55,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,009 INFO L87 Difference]: Start difference. First operand 313 states and 514 transitions. Second operand 5 states. [2019-10-14 23:49:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,236 INFO L93 Difference]: Finished difference Result 651 states and 1075 transitions. [2019-10-14 23:49:55,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-14 23:49:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,239 INFO L225 Difference]: With dead ends: 651 [2019-10-14 23:49:55,239 INFO L226 Difference]: Without dead ends: 351 [2019-10-14 23:49:55,240 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-14 23:49:55,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-14 23:49:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-14 23:49:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 574 transitions. [2019-10-14 23:49:55,257 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 574 transitions. Word has length 78 [2019-10-14 23:49:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,257 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 574 transitions. [2019-10-14 23:49:55,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,258 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 574 transitions. [2019-10-14 23:49:55,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-14 23:49:55,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,259 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,260 INFO L82 PathProgramCache]: Analyzing trace with hash 496741763, now seen corresponding path program 1 times [2019-10-14 23:49:55,260 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773049006] [2019-10-14 23:49:55,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,260 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,319 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:55,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773049006] [2019-10-14 23:49:55,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120059720] [2019-10-14 23:49:55,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,322 INFO L87 Difference]: Start difference. First operand 349 states and 574 transitions. Second operand 5 states. [2019-10-14 23:49:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,507 INFO L93 Difference]: Finished difference Result 687 states and 1133 transitions. [2019-10-14 23:49:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-14 23:49:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,510 INFO L225 Difference]: With dead ends: 687 [2019-10-14 23:49:55,511 INFO L226 Difference]: Without dead ends: 351 [2019-10-14 23:49:55,513 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-14 23:49:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-14 23:49:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-14 23:49:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 568 transitions. [2019-10-14 23:49:55,534 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 568 transitions. Word has length 79 [2019-10-14 23:49:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,535 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 568 transitions. [2019-10-14 23:49:55,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 568 transitions. [2019-10-14 23:49:55,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-14 23:49:55,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,537 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] [2019-10-14 23:49:55,538 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,538 INFO L82 PathProgramCache]: Analyzing trace with hash -70012323, now seen corresponding path program 1 times [2019-10-14 23:49:55,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74278422] [2019-10-14 23:49:55,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:55,643 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74278422] [2019-10-14 23:49:55,643 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:55,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:55,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000238406] [2019-10-14 23:49:55,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:55,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:55,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,645 INFO L87 Difference]: Start difference. First operand 349 states and 568 transitions. Second operand 5 states. [2019-10-14 23:49:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,932 INFO L93 Difference]: Finished difference Result 687 states and 1121 transitions. [2019-10-14 23:49:55,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:55,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-10-14 23:49:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,935 INFO L225 Difference]: With dead ends: 687 [2019-10-14 23:49:55,935 INFO L226 Difference]: Without dead ends: 351 [2019-10-14 23:49:55,936 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-14 23:49:55,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2019-10-14 23:49:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2019-10-14 23:49:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 566 transitions. [2019-10-14 23:49:55,954 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 566 transitions. Word has length 79 [2019-10-14 23:49:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,955 INFO L462 AbstractCegarLoop]: Abstraction has 349 states and 566 transitions. [2019-10-14 23:49:55,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 566 transitions. [2019-10-14 23:49:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-14 23:49:55,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,956 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:55,957 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2051852968, now seen corresponding path program 1 times [2019-10-14 23:49:55,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892468894] [2019-10-14 23:49:55,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 23:49:56,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892468894] [2019-10-14 23:49:56,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789474983] [2019-10-14 23:49:56,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,025 INFO L87 Difference]: Start difference. First operand 349 states and 566 transitions. Second operand 5 states. [2019-10-14 23:49:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,228 INFO L93 Difference]: Finished difference Result 714 states and 1163 transitions. [2019-10-14 23:49:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-10-14 23:49:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,231 INFO L225 Difference]: With dead ends: 714 [2019-10-14 23:49:56,231 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:49:56,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:49:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-14 23:49:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-14 23:49:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 601 transitions. [2019-10-14 23:49:56,250 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 601 transitions. Word has length 85 [2019-10-14 23:49:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,251 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 601 transitions. [2019-10-14 23:49:56,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 601 transitions. [2019-10-14 23:49:56,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-14 23:49:56,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,252 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,252 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,253 INFO L82 PathProgramCache]: Analyzing trace with hash 406324048, now seen corresponding path program 1 times [2019-10-14 23:49:56,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978185265] [2019-10-14 23:49:56,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-14 23:49:56,316 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978185265] [2019-10-14 23:49:56,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,317 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498295305] [2019-10-14 23:49:56,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,319 INFO L87 Difference]: Start difference. First operand 373 states and 601 transitions. Second operand 5 states. [2019-10-14 23:49:56,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,534 INFO L93 Difference]: Finished difference Result 738 states and 1192 transitions. [2019-10-14 23:49:56,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,535 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-10-14 23:49:56,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,537 INFO L225 Difference]: With dead ends: 738 [2019-10-14 23:49:56,538 INFO L226 Difference]: Without dead ends: 378 [2019-10-14 23:49:56,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-10-14 23:49:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 373. [2019-10-14 23:49:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2019-10-14 23:49:56,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 595 transitions. [2019-10-14 23:49:56,557 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 595 transitions. Word has length 86 [2019-10-14 23:49:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,558 INFO L462 AbstractCegarLoop]: Abstraction has 373 states and 595 transitions. [2019-10-14 23:49:56,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 595 transitions. [2019-10-14 23:49:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-14 23:49:56,563 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,563 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2087471906, now seen corresponding path program 1 times [2019-10-14 23:49:56,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786578168] [2019-10-14 23:49:56,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,565 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-14 23:49:56,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786578168] [2019-10-14 23:49:56,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803095861] [2019-10-14 23:49:56,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,624 INFO L87 Difference]: Start difference. First operand 373 states and 595 transitions. Second operand 5 states. [2019-10-14 23:49:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:56,865 INFO L93 Difference]: Finished difference Result 742 states and 1185 transitions. [2019-10-14 23:49:56,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:56,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-10-14 23:49:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:56,869 INFO L225 Difference]: With dead ends: 742 [2019-10-14 23:49:56,870 INFO L226 Difference]: Without dead ends: 382 [2019-10-14 23:49:56,873 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-10-14 23:49:56,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2019-10-14 23:49:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-10-14 23:49:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 598 transitions. [2019-10-14 23:49:56,902 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 598 transitions. Word has length 91 [2019-10-14 23:49:56,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:56,902 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 598 transitions. [2019-10-14 23:49:56,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 598 transitions. [2019-10-14 23:49:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-14 23:49:56,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:56,905 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:56,905 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash 754738376, now seen corresponding path program 1 times [2019-10-14 23:49:56,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699877735] [2019-10-14 23:49:56,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,907 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,992 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:56,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699877735] [2019-10-14 23:49:56,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:56,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:56,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571091229] [2019-10-14 23:49:56,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:56,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:56,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:56,995 INFO L87 Difference]: Start difference. First operand 382 states and 598 transitions. Second operand 5 states. [2019-10-14 23:49:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,251 INFO L93 Difference]: Finished difference Result 782 states and 1226 transitions. [2019-10-14 23:49:57,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-14 23:49:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,254 INFO L225 Difference]: With dead ends: 782 [2019-10-14 23:49:57,255 INFO L226 Difference]: Without dead ends: 413 [2019-10-14 23:49:57,257 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-14 23:49:57,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-14 23:49:57,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-14 23:49:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 639 transitions. [2019-10-14 23:49:57,280 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 639 transitions. Word has length 92 [2019-10-14 23:49:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,281 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 639 transitions. [2019-10-14 23:49:57,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,282 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 639 transitions. [2019-10-14 23:49:57,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-14 23:49:57,283 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,284 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,284 INFO L82 PathProgramCache]: Analyzing trace with hash -196155072, now seen corresponding path program 1 times [2019-10-14 23:49:57,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,285 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315496984] [2019-10-14 23:49:57,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:57,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315496984] [2019-10-14 23:49:57,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426654635] [2019-10-14 23:49:57,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,356 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,357 INFO L87 Difference]: Start difference. First operand 411 states and 639 transitions. Second operand 5 states. [2019-10-14 23:49:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,602 INFO L93 Difference]: Finished difference Result 811 states and 1263 transitions. [2019-10-14 23:49:57,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-10-14 23:49:57,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,605 INFO L225 Difference]: With dead ends: 811 [2019-10-14 23:49:57,605 INFO L226 Difference]: Without dead ends: 413 [2019-10-14 23:49:57,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-10-14 23:49:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2019-10-14 23:49:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-10-14 23:49:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 635 transitions. [2019-10-14 23:49:57,652 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 635 transitions. Word has length 93 [2019-10-14 23:49:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,653 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 635 transitions. [2019-10-14 23:49:57,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 635 transitions. [2019-10-14 23:49:57,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:57,655 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,655 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,655 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 222103604, now seen corresponding path program 1 times [2019-10-14 23:49:57,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816970706] [2019-10-14 23:49:57,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 23:49:57,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816970706] [2019-10-14 23:49:57,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:57,732 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868029764] [2019-10-14 23:49:57,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:57,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:57,734 INFO L87 Difference]: Start difference. First operand 411 states and 635 transitions. Second operand 5 states. [2019-10-14 23:49:57,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,956 INFO L93 Difference]: Finished difference Result 834 states and 1294 transitions. [2019-10-14 23:49:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:57,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,959 INFO L225 Difference]: With dead ends: 834 [2019-10-14 23:49:57,959 INFO L226 Difference]: Without dead ends: 436 [2019-10-14 23:49:57,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-14 23:49:57,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-14 23:49:57,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-14 23:49:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 662 transitions. [2019-10-14 23:49:57,985 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 662 transitions. Word has length 106 [2019-10-14 23:49:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,985 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 662 transitions. [2019-10-14 23:49:57,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 662 transitions. [2019-10-14 23:49:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-14 23:49:57,987 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,988 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:57,988 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1331192532, now seen corresponding path program 1 times [2019-10-14 23:49:57,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323186403] [2019-10-14 23:49:57,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,049 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-14 23:49:58,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323186403] [2019-10-14 23:49:58,050 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,050 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,050 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307015121] [2019-10-14 23:49:58,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,051 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,051 INFO L87 Difference]: Start difference. First operand 432 states and 662 transitions. Second operand 5 states. [2019-10-14 23:49:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,251 INFO L93 Difference]: Finished difference Result 855 states and 1313 transitions. [2019-10-14 23:49:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2019-10-14 23:49:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,254 INFO L225 Difference]: With dead ends: 855 [2019-10-14 23:49:58,255 INFO L226 Difference]: Without dead ends: 436 [2019-10-14 23:49:58,256 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-10-14 23:49:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2019-10-14 23:49:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-10-14 23:49:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 654 transitions. [2019-10-14 23:49:58,282 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 654 transitions. Word has length 107 [2019-10-14 23:49:58,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,283 INFO L462 AbstractCegarLoop]: Abstraction has 432 states and 654 transitions. [2019-10-14 23:49:58,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 654 transitions. [2019-10-14 23:49:58,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:49:58,285 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,285 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:58,285 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,286 INFO L82 PathProgramCache]: Analyzing trace with hash -276692460, now seen corresponding path program 1 times [2019-10-14 23:49:58,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014133317] [2019-10-14 23:49:58,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,287 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:58,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014133317] [2019-10-14 23:49:58,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583182740] [2019-10-14 23:49:58,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,351 INFO L87 Difference]: Start difference. First operand 432 states and 654 transitions. Second operand 5 states. [2019-10-14 23:49:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,593 INFO L93 Difference]: Finished difference Result 896 states and 1357 transitions. [2019-10-14 23:49:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-14 23:49:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,597 INFO L225 Difference]: With dead ends: 896 [2019-10-14 23:49:58,597 INFO L226 Difference]: Without dead ends: 477 [2019-10-14 23:49:58,598 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:58,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-14 23:49:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 474. [2019-10-14 23:49:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-10-14 23:49:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 715 transitions. [2019-10-14 23:49:58,622 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 715 transitions. Word has length 108 [2019-10-14 23:49:58,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,623 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 715 transitions. [2019-10-14 23:49:58,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 715 transitions. [2019-10-14 23:49:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:49:58,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,625 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] [2019-10-14 23:49:58,626 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1027622475, now seen corresponding path program 1 times [2019-10-14 23:49:58,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419798550] [2019-10-14 23:49:58,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:58,689 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419798550] [2019-10-14 23:49:58,690 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:58,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424489103] [2019-10-14 23:49:58,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:58,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:58,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:58,692 INFO L87 Difference]: Start difference. First operand 474 states and 715 transitions. Second operand 5 states. [2019-10-14 23:49:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,916 INFO L93 Difference]: Finished difference Result 971 states and 1465 transitions. [2019-10-14 23:49:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:58,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:49:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,920 INFO L225 Difference]: With dead ends: 971 [2019-10-14 23:49:58,920 INFO L226 Difference]: Without dead ends: 510 [2019-10-14 23:49:58,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-14 23:49:58,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-10-14 23:49:58,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 508. [2019-10-14 23:49:58,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2019-10-14 23:49:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 761 transitions. [2019-10-14 23:49:58,948 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 761 transitions. Word has length 109 [2019-10-14 23:49:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,948 INFO L462 AbstractCegarLoop]: Abstraction has 508 states and 761 transitions. [2019-10-14 23:49:58,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 761 transitions. [2019-10-14 23:49:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-10-14 23:49:58,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,951 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, 1, 1, 1] [2019-10-14 23:49:58,951 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1688696815, now seen corresponding path program 1 times [2019-10-14 23:49:58,952 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888943657] [2019-10-14 23:49:58,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,024 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-14 23:49:59,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888943657] [2019-10-14 23:49:59,024 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050330262] [2019-10-14 23:49:59,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,033 INFO L87 Difference]: Start difference. First operand 508 states and 761 transitions. Second operand 5 states. [2019-10-14 23:49:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,267 INFO L93 Difference]: Finished difference Result 1010 states and 1516 transitions. [2019-10-14 23:49:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-10-14 23:49:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,272 INFO L225 Difference]: With dead ends: 1010 [2019-10-14 23:49:59,272 INFO L226 Difference]: Without dead ends: 513 [2019-10-14 23:49:59,274 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-10-14 23:49:59,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 510. [2019-10-14 23:49:59,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-14 23:49:59,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 764 transitions. [2019-10-14 23:49:59,308 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 764 transitions. Word has length 109 [2019-10-14 23:49:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,308 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 764 transitions. [2019-10-14 23:49:59,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 764 transitions. [2019-10-14 23:49:59,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:49:59,314 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,315 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] [2019-10-14 23:49:59,315 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -429369896, now seen corresponding path program 1 times [2019-10-14 23:49:59,316 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,316 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919587051] [2019-10-14 23:49:59,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-14 23:49:59,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919587051] [2019-10-14 23:49:59,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:59,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471487354] [2019-10-14 23:49:59,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:59,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:59,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,397 INFO L87 Difference]: Start difference. First operand 510 states and 764 transitions. Second operand 5 states. [2019-10-14 23:49:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,633 INFO L93 Difference]: Finished difference Result 1009 states and 1513 transitions. [2019-10-14 23:49:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:59,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-14 23:49:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,637 INFO L225 Difference]: With dead ends: 1009 [2019-10-14 23:49:59,637 INFO L226 Difference]: Without dead ends: 512 [2019-10-14 23:49:59,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:59,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-10-14 23:49:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2019-10-14 23:49:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2019-10-14 23:49:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 760 transitions. [2019-10-14 23:49:59,663 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 760 transitions. Word has length 110 [2019-10-14 23:49:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,663 INFO L462 AbstractCegarLoop]: Abstraction has 510 states and 760 transitions. [2019-10-14 23:49:59,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 760 transitions. [2019-10-14 23:49:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:49:59,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,665 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,666 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1290144821, now seen corresponding path program 1 times [2019-10-14 23:49:59,666 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723641271] [2019-10-14 23:49:59,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-14 23:49:59,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723641271] [2019-10-14 23:49:59,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,709 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,709 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771700009] [2019-10-14 23:49:59,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,710 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,711 INFO L87 Difference]: Start difference. First operand 510 states and 760 transitions. Second operand 3 states. [2019-10-14 23:49:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,762 INFO L93 Difference]: Finished difference Result 1497 states and 2233 transitions. [2019-10-14 23:49:59,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-14 23:49:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,768 INFO L225 Difference]: With dead ends: 1497 [2019-10-14 23:49:59,769 INFO L226 Difference]: Without dead ends: 1000 [2019-10-14 23:49:59,770 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-10-14 23:49:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 511. [2019-10-14 23:49:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2019-10-14 23:49:59,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 761 transitions. [2019-10-14 23:49:59,801 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 761 transitions. Word has length 122 [2019-10-14 23:49:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,801 INFO L462 AbstractCegarLoop]: Abstraction has 511 states and 761 transitions. [2019-10-14 23:49:59,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 761 transitions. [2019-10-14 23:49:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-14 23:49:59,803 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,803 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,803 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,804 INFO L82 PathProgramCache]: Analyzing trace with hash -953838477, now seen corresponding path program 1 times [2019-10-14 23:49:59,804 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756226084] [2019-10-14 23:49:59,804 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,805 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-14 23:49:59,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756226084] [2019-10-14 23:49:59,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:59,854 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:59,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939451669] [2019-10-14 23:49:59,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,855 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,856 INFO L87 Difference]: Start difference. First operand 511 states and 761 transitions. Second operand 3 states. [2019-10-14 23:49:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,935 INFO L93 Difference]: Finished difference Result 1505 states and 2248 transitions. [2019-10-14 23:49:59,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-14 23:49:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,941 INFO L225 Difference]: With dead ends: 1505 [2019-10-14 23:49:59,941 INFO L226 Difference]: Without dead ends: 1007 [2019-10-14 23:49:59,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:59,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-10-14 23:49:59,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1007. [2019-10-14 23:49:59,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-10-14 23:49:59,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1498 transitions. [2019-10-14 23:49:59,993 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1498 transitions. Word has length 122 [2019-10-14 23:49:59,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,993 INFO L462 AbstractCegarLoop]: Abstraction has 1007 states and 1498 transitions. [2019-10-14 23:49:59,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1498 transitions. [2019-10-14 23:49:59,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-14 23:49:59,996 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,996 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:59,996 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:59,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:59,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1636886403, now seen corresponding path program 1 times [2019-10-14 23:49:59,997 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:59,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231216604] [2019-10-14 23:49:59,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:59,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-14 23:50:00,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231216604] [2019-10-14 23:50:00,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:00,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019258378] [2019-10-14 23:50:00,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,044 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,044 INFO L87 Difference]: Start difference. First operand 1007 states and 1498 transitions. Second operand 3 states. [2019-10-14 23:50:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,170 INFO L93 Difference]: Finished difference Result 2499 states and 3723 transitions. [2019-10-14 23:50:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-14 23:50:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,178 INFO L225 Difference]: With dead ends: 2499 [2019-10-14 23:50:00,179 INFO L226 Difference]: Without dead ends: 1505 [2019-10-14 23:50:00,181 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-10-14 23:50:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1503. [2019-10-14 23:50:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-14 23:50:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2239 transitions. [2019-10-14 23:50:00,302 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2239 transitions. Word has length 124 [2019-10-14 23:50:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,303 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 2239 transitions. [2019-10-14 23:50:00,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2239 transitions. [2019-10-14 23:50:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-14 23:50:00,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,308 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:00,308 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,312 INFO L82 PathProgramCache]: Analyzing trace with hash -89246318, now seen corresponding path program 1 times [2019-10-14 23:50:00,312 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,312 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534435023] [2019-10-14 23:50:00,312 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,313 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-10-14 23:50:00,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534435023] [2019-10-14 23:50:00,387 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:00,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433798448] [2019-10-14 23:50:00,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,390 INFO L87 Difference]: Start difference. First operand 1503 states and 2239 transitions. Second operand 3 states. [2019-10-14 23:50:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,566 INFO L93 Difference]: Finished difference Result 2003 states and 2984 transitions. [2019-10-14 23:50:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-14 23:50:00,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,580 INFO L225 Difference]: With dead ends: 2003 [2019-10-14 23:50:00,580 INFO L226 Difference]: Without dead ends: 2001 [2019-10-14 23:50:00,582 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2019-10-14 23:50:00,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 1999. [2019-10-14 23:50:00,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1999 states. [2019-10-14 23:50:00,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1999 states to 1999 states and 2981 transitions. [2019-10-14 23:50:00,734 INFO L78 Accepts]: Start accepts. Automaton has 1999 states and 2981 transitions. Word has length 125 [2019-10-14 23:50:00,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,735 INFO L462 AbstractCegarLoop]: Abstraction has 1999 states and 2981 transitions. [2019-10-14 23:50:00,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1999 states and 2981 transitions. [2019-10-14 23:50:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-14 23:50:00,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,739 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] [2019-10-14 23:50:00,739 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1672983707, now seen corresponding path program 1 times [2019-10-14 23:50:00,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132713607] [2019-10-14 23:50:00,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:50:00,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132713607] [2019-10-14 23:50:00,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:00,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:00,857 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095881826] [2019-10-14 23:50:00,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:00,858 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:00,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,859 INFO L87 Difference]: Start difference. First operand 1999 states and 2981 transitions. Second operand 5 states. [2019-10-14 23:50:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,235 INFO L93 Difference]: Finished difference Result 4173 states and 6206 transitions. [2019-10-14 23:50:01,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:01,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2019-10-14 23:50:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,248 INFO L225 Difference]: With dead ends: 4173 [2019-10-14 23:50:01,248 INFO L226 Difference]: Without dead ends: 2187 [2019-10-14 23:50:01,253 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:50:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2019-10-14 23:50:01,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2163. [2019-10-14 23:50:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2163 states. [2019-10-14 23:50:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3201 transitions. [2019-10-14 23:50:01,359 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3201 transitions. Word has length 155 [2019-10-14 23:50:01,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,359 INFO L462 AbstractCegarLoop]: Abstraction has 2163 states and 3201 transitions. [2019-10-14 23:50:01,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3201 transitions. [2019-10-14 23:50:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-14 23:50:01,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,364 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] [2019-10-14 23:50:01,364 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash -132146072, now seen corresponding path program 1 times [2019-10-14 23:50:01,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063406646] [2019-10-14 23:50:01,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-14 23:50:01,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063406646] [2019-10-14 23:50:01,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:01,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:50:01,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409609892] [2019-10-14 23:50:01,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:50:01,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:50:01,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:01,450 INFO L87 Difference]: Start difference. First operand 2163 states and 3201 transitions. Second operand 5 states. [2019-10-14 23:50:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:01,763 INFO L93 Difference]: Finished difference Result 4337 states and 6418 transitions. [2019-10-14 23:50:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:01,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-14 23:50:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:01,777 INFO L225 Difference]: With dead ends: 4337 [2019-10-14 23:50:01,778 INFO L226 Difference]: Without dead ends: 2155 [2019-10-14 23:50:01,783 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:50:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2019-10-14 23:50:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2131. [2019-10-14 23:50:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-10-14 23:50:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3145 transitions. [2019-10-14 23:50:01,919 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3145 transitions. Word has length 156 [2019-10-14 23:50:01,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:01,920 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 3145 transitions. [2019-10-14 23:50:01,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:50:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3145 transitions. [2019-10-14 23:50:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-14 23:50:01,925 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:01,925 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] [2019-10-14 23:50:01,926 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1669045776, now seen corresponding path program 1 times [2019-10-14 23:50:01,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733768628] [2019-10-14 23:50:01,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-14 23:50:02,081 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733768628] [2019-10-14 23:50:02,082 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845357162] [2019-10-14 23:50:02,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:50:02,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-10-14 23:50:02,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:02,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:02,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222872142] [2019-10-14 23:50:02,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,321 INFO L87 Difference]: Start difference. First operand 2131 states and 3145 transitions. Second operand 3 states. [2019-10-14 23:50:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,504 INFO L93 Difference]: Finished difference Result 4780 states and 7056 transitions. [2019-10-14 23:50:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:02,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-10-14 23:50:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,521 INFO L225 Difference]: With dead ends: 4780 [2019-10-14 23:50:02,521 INFO L226 Difference]: Without dead ends: 2662 [2019-10-14 23:50:02,530 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-10-14 23:50:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-10-14 23:50:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-10-14 23:50:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3906 transitions. [2019-10-14 23:50:02,740 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 3906 transitions. Word has length 188 [2019-10-14 23:50:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,741 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 3906 transitions. [2019-10-14 23:50:02,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 3906 transitions. [2019-10-14 23:50:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-14 23:50:02,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,752 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:02,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:02,968 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1467791988, now seen corresponding path program 1 times [2019-10-14 23:50:02,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713014264] [2019-10-14 23:50:02,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-10-14 23:50:03,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713014264] [2019-10-14 23:50:03,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,084 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111426709] [2019-10-14 23:50:03,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,086 INFO L87 Difference]: Start difference. First operand 2660 states and 3906 transitions. Second operand 3 states. [2019-10-14 23:50:03,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,304 INFO L93 Difference]: Finished difference Result 4249 states and 6242 transitions. [2019-10-14 23:50:03,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-10-14 23:50:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,322 INFO L225 Difference]: With dead ends: 4249 [2019-10-14 23:50:03,322 INFO L226 Difference]: Without dead ends: 3189 [2019-10-14 23:50:03,327 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3189 states. [2019-10-14 23:50:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3189 to 3189. [2019-10-14 23:50:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-14 23:50:03,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4686 transitions. [2019-10-14 23:50:03,492 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4686 transitions. Word has length 192 [2019-10-14 23:50:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,493 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4686 transitions. [2019-10-14 23:50:03,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4686 transitions. [2019-10-14 23:50:03,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-14 23:50:03,509 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,509 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:03,509 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1040739973, now seen corresponding path program 1 times [2019-10-14 23:50:03,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378480863] [2019-10-14 23:50:03,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-14 23:50:03,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378480863] [2019-10-14 23:50:03,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56542266] [2019-10-14 23:50:03,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,625 INFO L87 Difference]: Start difference. First operand 3189 states and 4686 transitions. Second operand 3 states. [2019-10-14 23:50:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,940 INFO L93 Difference]: Finished difference Result 6425 states and 9427 transitions. [2019-10-14 23:50:03,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 270 [2019-10-14 23:50:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,972 INFO L225 Difference]: With dead ends: 6425 [2019-10-14 23:50:03,972 INFO L226 Difference]: Without dead ends: 3249 [2019-10-14 23:50:03,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2019-10-14 23:50:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 3189. [2019-10-14 23:50:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-14 23:50:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4638 transitions. [2019-10-14 23:50:04,143 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4638 transitions. Word has length 270 [2019-10-14 23:50:04,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,144 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4638 transitions. [2019-10-14 23:50:04,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4638 transitions. [2019-10-14 23:50:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-14 23:50:04,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,154 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,155 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1618154303, now seen corresponding path program 1 times [2019-10-14 23:50:04,156 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,156 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219740076] [2019-10-14 23:50:04,156 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,240 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 442 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-14 23:50:04,241 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219740076] [2019-10-14 23:50:04,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,241 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96719586] [2019-10-14 23:50:04,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,243 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,243 INFO L87 Difference]: Start difference. First operand 3189 states and 4638 transitions. Second operand 3 states. [2019-10-14 23:50:04,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,528 INFO L93 Difference]: Finished difference Result 6461 states and 9373 transitions. [2019-10-14 23:50:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-14 23:50:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,540 INFO L225 Difference]: With dead ends: 6461 [2019-10-14 23:50:04,540 INFO L226 Difference]: Without dead ends: 3285 [2019-10-14 23:50:04,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-10-14 23:50:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 3189. [2019-10-14 23:50:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3189 states. [2019-10-14 23:50:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3189 states to 3189 states and 4422 transitions. [2019-10-14 23:50:04,782 INFO L78 Accepts]: Start accepts. Automaton has 3189 states and 4422 transitions. Word has length 274 [2019-10-14 23:50:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,782 INFO L462 AbstractCegarLoop]: Abstraction has 3189 states and 4422 transitions. [2019-10-14 23:50:04,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3189 states and 4422 transitions. [2019-10-14 23:50:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-10-14 23:50:04,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,792 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:04,792 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1393049634, now seen corresponding path program 1 times [2019-10-14 23:50:04,792 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808265515] [2019-10-14 23:50:04,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-14 23:50:04,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808265515] [2019-10-14 23:50:04,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:04,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:04,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996468848] [2019-10-14 23:50:04,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,869 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:04,870 INFO L87 Difference]: Start difference. First operand 3189 states and 4422 transitions. Second operand 3 states. [2019-10-14 23:50:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,152 INFO L93 Difference]: Finished difference Result 6469 states and 8954 transitions. [2019-10-14 23:50:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2019-10-14 23:50:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,161 INFO L225 Difference]: With dead ends: 6469 [2019-10-14 23:50:05,161 INFO L226 Difference]: Without dead ends: 3293 [2019-10-14 23:50:05,168 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-10-14 23:50:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3195. [2019-10-14 23:50:05,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2019-10-14 23:50:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 4275 transitions. [2019-10-14 23:50:05,319 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 4275 transitions. Word has length 284 [2019-10-14 23:50:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,320 INFO L462 AbstractCegarLoop]: Abstraction has 3195 states and 4275 transitions. [2019-10-14 23:50:05,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 4275 transitions. [2019-10-14 23:50:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-14 23:50:05,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,330 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, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:05,331 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -27112689, now seen corresponding path program 1 times [2019-10-14 23:50:05,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841650097] [2019-10-14 23:50:05,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-14 23:50:05,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841650097] [2019-10-14 23:50:05,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187940071] [2019-10-14 23:50:05,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:05,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-10-14 23:50:05,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:05,721 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:05,721 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061493706] [2019-10-14 23:50:05,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:05,722 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:05,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:05,722 INFO L87 Difference]: Start difference. First operand 3195 states and 4275 transitions. Second operand 3 states. [2019-10-14 23:50:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,984 INFO L93 Difference]: Finished difference Result 9385 states and 12539 transitions. [2019-10-14 23:50:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:05,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-10-14 23:50:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,998 INFO L225 Difference]: With dead ends: 9385 [2019-10-14 23:50:05,998 INFO L226 Difference]: Without dead ends: 6209 [2019-10-14 23:50:06,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:06,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6209 states. [2019-10-14 23:50:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6209 to 6207. [2019-10-14 23:50:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6207 states. [2019-10-14 23:50:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6207 states to 6207 states and 8271 transitions. [2019-10-14 23:50:06,352 INFO L78 Accepts]: Start accepts. Automaton has 6207 states and 8271 transitions. Word has length 294 [2019-10-14 23:50:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,353 INFO L462 AbstractCegarLoop]: Abstraction has 6207 states and 8271 transitions. [2019-10-14 23:50:06,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6207 states and 8271 transitions. [2019-10-14 23:50:06,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-10-14 23:50:06,367 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:06,367 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, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:06,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:06,573 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 533587089, now seen corresponding path program 1 times [2019-10-14 23:50:06,574 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:06,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094224774] [2019-10-14 23:50:06,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,575 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,671 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-14 23:50:06,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094224774] [2019-10-14 23:50:06,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238219923] [2019-10-14 23:50:06,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:06,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 600 proven. 26 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2019-10-14 23:50:06,853 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:06,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:06,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079929353] [2019-10-14 23:50:06,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:06,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:06,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:06,856 INFO L87 Difference]: Start difference. First operand 6207 states and 8271 transitions. Second operand 4 states. [2019-10-14 23:50:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,635 INFO L93 Difference]: Finished difference Result 17827 states and 23541 transitions. [2019-10-14 23:50:07,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:07,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 294 [2019-10-14 23:50:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,658 INFO L225 Difference]: With dead ends: 17827 [2019-10-14 23:50:07,659 INFO L226 Difference]: Without dead ends: 11483 [2019-10-14 23:50:07,671 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11483 states. [2019-10-14 23:50:07,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11483 to 6371. [2019-10-14 23:50:07,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6371 states. [2019-10-14 23:50:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6371 states to 6371 states and 8489 transitions. [2019-10-14 23:50:08,008 INFO L78 Accepts]: Start accepts. Automaton has 6371 states and 8489 transitions. Word has length 294 [2019-10-14 23:50:08,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:08,008 INFO L462 AbstractCegarLoop]: Abstraction has 6371 states and 8489 transitions. [2019-10-14 23:50:08,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:08,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6371 states and 8489 transitions. [2019-10-14 23:50:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-14 23:50:08,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:08,027 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:08,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,242 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1875632044, now seen corresponding path program 1 times [2019-10-14 23:50:08,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:08,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915219081] [2019-10-14 23:50:08,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,245 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:08,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-14 23:50:08,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915219081] [2019-10-14 23:50:08,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928428526] [2019-10-14 23:50:08,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:08,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:08,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:08,608 INFO L134 CoverageAnalysis]: Checked inductivity of 842 backedges. 631 proven. 26 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-10-14 23:50:08,608 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:08,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:08,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653611659] [2019-10-14 23:50:08,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:08,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:08,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:08,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:08,610 INFO L87 Difference]: Start difference. First operand 6371 states and 8489 transitions. Second operand 4 states. [2019-10-14 23:50:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:09,170 INFO L93 Difference]: Finished difference Result 14256 states and 18832 transitions. [2019-10-14 23:50:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:09,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 303 [2019-10-14 23:50:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:09,189 INFO L225 Difference]: With dead ends: 14256 [2019-10-14 23:50:09,189 INFO L226 Difference]: Without dead ends: 7894 [2019-10-14 23:50:09,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7894 states. [2019-10-14 23:50:09,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7894 to 6185. [2019-10-14 23:50:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6185 states. [2019-10-14 23:50:09,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6185 states to 6185 states and 8189 transitions. [2019-10-14 23:50:09,486 INFO L78 Accepts]: Start accepts. Automaton has 6185 states and 8189 transitions. Word has length 303 [2019-10-14 23:50:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:09,487 INFO L462 AbstractCegarLoop]: Abstraction has 6185 states and 8189 transitions. [2019-10-14 23:50:09,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6185 states and 8189 transitions. [2019-10-14 23:50:09,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-14 23:50:09,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:09,499 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-14 23:50:09,702 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:09,706 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:09,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1588759982, now seen corresponding path program 1 times [2019-10-14 23:50:09,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:09,707 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399225555] [2019-10-14 23:50:09,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,707 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:09,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-14 23:50:09,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399225555] [2019-10-14 23:50:09,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:09,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:09,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042881545] [2019-10-14 23:50:09,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:09,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:09,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:09,876 INFO L87 Difference]: Start difference. First operand 6185 states and 8189 transitions. Second operand 3 states. [2019-10-14 23:50:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:10,248 INFO L93 Difference]: Finished difference Result 12737 states and 16878 transitions. [2019-10-14 23:50:10,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:10,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 312 [2019-10-14 23:50:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:10,259 INFO L225 Difference]: With dead ends: 12737 [2019-10-14 23:50:10,259 INFO L226 Difference]: Without dead ends: 6375 [2019-10-14 23:50:10,271 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:10,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6375 states. [2019-10-14 23:50:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6375 to 6365. [2019-10-14 23:50:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6365 states. [2019-10-14 23:50:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6365 states to 6365 states and 8363 transitions. [2019-10-14 23:50:10,517 INFO L78 Accepts]: Start accepts. Automaton has 6365 states and 8363 transitions. Word has length 312 [2019-10-14 23:50:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:10,518 INFO L462 AbstractCegarLoop]: Abstraction has 6365 states and 8363 transitions. [2019-10-14 23:50:10,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 6365 states and 8363 transitions. [2019-10-14 23:50:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2019-10-14 23:50:10,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:10,534 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:10,534 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash -630627056, now seen corresponding path program 1 times [2019-10-14 23:50:10,535 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:10,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981454674] [2019-10-14 23:50:10,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:10,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:10,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-14 23:50:10,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981454674] [2019-10-14 23:50:10,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270735979] [2019-10-14 23:50:10,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:10,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:10,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 986 backedges. 691 proven. 16 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-14 23:50:11,015 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:11,016 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:11,016 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402276958] [2019-10-14 23:50:11,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:11,017 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:11,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:11,018 INFO L87 Difference]: Start difference. First operand 6365 states and 8363 transitions. Second operand 4 states. [2019-10-14 23:50:11,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:11,504 INFO L93 Difference]: Finished difference Result 13086 states and 17000 transitions. [2019-10-14 23:50:11,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:11,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 324 [2019-10-14 23:50:11,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:11,510 INFO L225 Difference]: With dead ends: 13086 [2019-10-14 23:50:11,510 INFO L226 Difference]: Without dead ends: 6760 [2019-10-14 23:50:11,516 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6760 states. [2019-10-14 23:50:11,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6760 to 4064. [2019-10-14 23:50:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-14 23:50:11,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5188 transitions. [2019-10-14 23:50:11,725 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5188 transitions. Word has length 324 [2019-10-14 23:50:11,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:11,725 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5188 transitions. [2019-10-14 23:50:11,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5188 transitions. [2019-10-14 23:50:11,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2019-10-14 23:50:11,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:11,740 INFO L380 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:11,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:11,945 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:11,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1793866143, now seen corresponding path program 1 times [2019-10-14 23:50:11,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:11,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243690454] [2019-10-14 23:50:11,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:11,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 563 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2019-10-14 23:50:12,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243690454] [2019-10-14 23:50:12,043 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:12,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:12,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277164463] [2019-10-14 23:50:12,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:12,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:12,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:12,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:12,045 INFO L87 Difference]: Start difference. First operand 4064 states and 5188 transitions. Second operand 3 states. [2019-10-14 23:50:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:12,293 INFO L93 Difference]: Finished difference Result 8219 states and 10471 transitions. [2019-10-14 23:50:12,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:12,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 327 [2019-10-14 23:50:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:12,299 INFO L225 Difference]: With dead ends: 8219 [2019-10-14 23:50:12,299 INFO L226 Difference]: Without dead ends: 4194 [2019-10-14 23:50:12,304 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:12,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4194 states. [2019-10-14 23:50:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4194 to 4064. [2019-10-14 23:50:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-14 23:50:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5110 transitions. [2019-10-14 23:50:12,573 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5110 transitions. Word has length 327 [2019-10-14 23:50:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:12,574 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5110 transitions. [2019-10-14 23:50:12,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5110 transitions. [2019-10-14 23:50:12,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-10-14 23:50:12,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:12,581 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:12,581 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:12,581 INFO L82 PathProgramCache]: Analyzing trace with hash 141772578, now seen corresponding path program 1 times [2019-10-14 23:50:12,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:12,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644494376] [2019-10-14 23:50:12,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:12,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:12,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2019-10-14 23:50:12,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644494376] [2019-10-14 23:50:12,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:12,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:12,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863131579] [2019-10-14 23:50:12,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:12,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:12,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:12,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:12,693 INFO L87 Difference]: Start difference. First operand 4064 states and 5110 transitions. Second operand 3 states. [2019-10-14 23:50:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:12,897 INFO L93 Difference]: Finished difference Result 7140 states and 9037 transitions. [2019-10-14 23:50:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:12,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 370 [2019-10-14 23:50:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:12,903 INFO L225 Difference]: With dead ends: 7140 [2019-10-14 23:50:12,903 INFO L226 Difference]: Without dead ends: 4120 [2019-10-14 23:50:12,911 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:12,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4120 states. [2019-10-14 23:50:13,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4120 to 4064. [2019-10-14 23:50:13,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4064 states. [2019-10-14 23:50:13,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4064 states to 4064 states and 5104 transitions. [2019-10-14 23:50:13,072 INFO L78 Accepts]: Start accepts. Automaton has 4064 states and 5104 transitions. Word has length 370 [2019-10-14 23:50:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,072 INFO L462 AbstractCegarLoop]: Abstraction has 4064 states and 5104 transitions. [2019-10-14 23:50:13,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4064 states and 5104 transitions. [2019-10-14 23:50:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-14 23:50:13,080 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,080 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:13,080 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1004200358, now seen corresponding path program 1 times [2019-10-14 23:50:13,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825258042] [2019-10-14 23:50:13,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,081 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 868 proven. 0 refuted. 0 times theorem prover too weak. 606 trivial. 0 not checked. [2019-10-14 23:50:13,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825258042] [2019-10-14 23:50:13,216 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:13,216 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:13,216 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491424301] [2019-10-14 23:50:13,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:13,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:13,218 INFO L87 Difference]: Start difference. First operand 4064 states and 5104 transitions. Second operand 3 states. [2019-10-14 23:50:13,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,530 INFO L93 Difference]: Finished difference Result 7559 states and 9508 transitions. [2019-10-14 23:50:13,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:13,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-14 23:50:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,533 INFO L225 Difference]: With dead ends: 7559 [2019-10-14 23:50:13,534 INFO L226 Difference]: Without dead ends: 3413 [2019-10-14 23:50:13,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:13,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2019-10-14 23:50:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3324. [2019-10-14 23:50:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-14 23:50:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4153 transitions. [2019-10-14 23:50:13,626 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4153 transitions. Word has length 393 [2019-10-14 23:50:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:13,627 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4153 transitions. [2019-10-14 23:50:13,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4153 transitions. [2019-10-14 23:50:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-10-14 23:50:13,632 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:13,632 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:13,633 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash 404718799, now seen corresponding path program 1 times [2019-10-14 23:50:13,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:13,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192895534] [2019-10-14 23:50:13,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:13,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 863 proven. 0 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-10-14 23:50:13,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192895534] [2019-10-14 23:50:13,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:13,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:13,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860331363] [2019-10-14 23:50:13,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:13,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:13,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:13,758 INFO L87 Difference]: Start difference. First operand 3324 states and 4153 transitions. Second operand 3 states. [2019-10-14 23:50:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:13,954 INFO L93 Difference]: Finished difference Result 6266 states and 7844 transitions. [2019-10-14 23:50:13,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:13,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-10-14 23:50:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:13,957 INFO L225 Difference]: With dead ends: 6266 [2019-10-14 23:50:13,958 INFO L226 Difference]: Without dead ends: 3336 [2019-10-14 23:50:13,962 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2019-10-14 23:50:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3324. [2019-10-14 23:50:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3324 states. [2019-10-14 23:50:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4147 transitions. [2019-10-14 23:50:14,066 INFO L78 Accepts]: Start accepts. Automaton has 3324 states and 4147 transitions. Word has length 393 [2019-10-14 23:50:14,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:14,066 INFO L462 AbstractCegarLoop]: Abstraction has 3324 states and 4147 transitions. [2019-10-14 23:50:14,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3324 states and 4147 transitions. [2019-10-14 23:50:14,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2019-10-14 23:50:14,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:14,072 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, 8, 8, 8, 8, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:50:14,072 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:14,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:14,072 INFO L82 PathProgramCache]: Analyzing trace with hash -676110835, now seen corresponding path program 1 times [2019-10-14 23:50:14,073 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:14,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351142183] [2019-10-14 23:50:14,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:14,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-14 23:50:14,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351142183] [2019-10-14 23:50:14,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325099541] [2019-10-14 23:50:14,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:14,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:14,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 518 proven. 22 refuted. 0 times theorem prover too weak. 1358 trivial. 0 not checked. [2019-10-14 23:50:14,523 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:14,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:14,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755176091] [2019-10-14 23:50:14,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:14,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:14,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:14,525 INFO L87 Difference]: Start difference. First operand 3324 states and 4147 transitions. Second operand 4 states. [2019-10-14 23:50:14,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:14,792 INFO L93 Difference]: Finished difference Result 5419 states and 6812 transitions. [2019-10-14 23:50:14,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:50:14,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 427 [2019-10-14 23:50:14,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:14,793 INFO L225 Difference]: With dead ends: 5419 [2019-10-14 23:50:14,794 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:14,799 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:14,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:14,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:14,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 427 [2019-10-14 23:50:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:14,801 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:14,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:14,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:15,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:15,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:15,167 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 158 [2019-10-14 23:50:15,386 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 156 [2019-10-14 23:50:17,396 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 669 DAG size of output: 413 [2019-10-14 23:50:17,677 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 183 [2019-10-14 23:50:19,583 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 670 DAG size of output: 414 [2019-10-14 23:50:20,148 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 207 [2019-10-14 23:50:20,281 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 236 [2019-10-14 23:50:21,635 WARN L191 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 152 DAG size of output: 90