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_2.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:50:43,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:50:43,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:50:43,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:50:43,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:50:43,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:50:43,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:50:43,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:50:43,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:50:43,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:50:43,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:50:43,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:50:43,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:50:43,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:50:43,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:50:43,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:50:43,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:50:43,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:50:43,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:50:43,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:50:43,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:50:43,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:50:43,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:50:43,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:50:43,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:50:43,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:50:43,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:50:43,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:50:43,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:50:43,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:50:43,820 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:50:43,821 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:50:43,822 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:50:43,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:50:43,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:50:43,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:50:43,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:50:43,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:50:43,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:50:43,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:50:43,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:50:43,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:50:43,866 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:50:43,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:50:43,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:50:43,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:50:43,871 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:50:43,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:50:43,872 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:50:43,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:50:43,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:50:43,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:50:43,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:50:43,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:50:43,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:50:43,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:50:43,877 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:50:43,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:50:43,877 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:43,877 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:50:43,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:50:43,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:50:43,878 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:50:43,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:50:43,878 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:50:43,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:50:44,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:50:44,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:50:44,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:50:44,233 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:50:44,234 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:50:44,234 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-13 19:50:44,314 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610771e5b/13f394f038534fff9883d89da52396f9/FLAGece08f25b [2019-10-13 19:50:44,884 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:50:44,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-13 19:50:44,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610771e5b/13f394f038534fff9883d89da52396f9/FLAGece08f25b [2019-10-13 19:50:45,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610771e5b/13f394f038534fff9883d89da52396f9 [2019-10-13 19:50:45,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:50:45,218 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:50:45,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:45,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:50:45,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:50:45,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a64cdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45, skipping insertion in model container [2019-10-13 19:50:45,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,235 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:50:45,298 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:50:45,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:45,550 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:50:45,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:50:45,713 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:50:45,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45 WrapperNode [2019-10-13 19:50:45,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:50:45,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:50:45,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:50:45,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:50:45,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,767 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... [2019-10-13 19:50:45,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:50:45,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:50:45,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:50:45,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:50:45,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:50:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:50:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:50:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-13 19:50:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:50:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:50:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:50:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:50:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 19:50:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 19:50:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-13 19:50:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:50:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:50:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:50:46,034 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-13 19:50:46,695 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-13 19:50:46,696 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-13 19:50:46,699 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:50:46,699 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 19:50:46,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:46 BoogieIcfgContainer [2019-10-13 19:50:46,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:50:46,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:50:46,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:50:46,706 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:50:46,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:50:45" (1/3) ... [2019-10-13 19:50:46,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2001f649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:46, skipping insertion in model container [2019-10-13 19:50:46,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:50:45" (2/3) ... [2019-10-13 19:50:46,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2001f649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:50:46, skipping insertion in model container [2019-10-13 19:50:46,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:50:46" (3/3) ... [2019-10-13 19:50:46,711 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-10-13 19:50:46,722 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:50:46,731 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:50:46,743 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:50:46,770 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:50:46,770 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:50:46,770 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:50:46,770 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:50:46,771 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:50:46,771 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:50:46,771 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:50:46,771 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:50:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-13 19:50:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 19:50:46,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:46,808 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:46,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:46,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-13 19:50:46,823 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:46,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306737115] [2019-10-13 19:50:46,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:46,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:47,119 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306737115] [2019-10-13 19:50:47,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:47,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:47,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965063265] [2019-10-13 19:50:47,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:47,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:47,145 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-13 19:50:47,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:47,632 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-13 19:50:47,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:47,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-13 19:50:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:47,652 INFO L225 Difference]: With dead ends: 337 [2019-10-13 19:50:47,652 INFO L226 Difference]: Without dead ends: 180 [2019-10-13 19:50:47,657 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:47,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-13 19:50:47,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-13 19:50:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 19:50:47,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-13 19:50:47,745 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-13 19:50:47,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:47,748 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-13 19:50:47,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-13 19:50:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 19:50:47,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:47,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:47,755 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:47,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:47,756 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-13 19:50:47,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:47,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313249477] [2019-10-13 19:50:47,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:47,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:47,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:47,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313249477] [2019-10-13 19:50:47,977 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:47,977 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:47,977 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871571169] [2019-10-13 19:50:47,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:47,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:47,981 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-13 19:50:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:48,327 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-13 19:50:48,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:48,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-13 19:50:48,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:48,331 INFO L225 Difference]: With dead ends: 385 [2019-10-13 19:50:48,331 INFO L226 Difference]: Without dead ends: 221 [2019-10-13 19:50:48,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-13 19:50:48,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-13 19:50:48,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-13 19:50:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-13 19:50:48,367 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-13 19:50:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:48,370 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-13 19:50:48,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-13 19:50:48,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-13 19:50:48,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:48,378 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:48,378 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-10-13 19:50:48,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:48,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077637950] [2019-10-13 19:50:48,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:48,522 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:48,523 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077637950] [2019-10-13 19:50:48,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:48,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:48,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382992562] [2019-10-13 19:50:48,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:48,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:48,525 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-13 19:50:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:48,897 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-13 19:50:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:48,898 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-13 19:50:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:48,902 INFO L225 Difference]: With dead ends: 450 [2019-10-13 19:50:48,902 INFO L226 Difference]: Without dead ends: 247 [2019-10-13 19:50:48,905 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-13 19:50:48,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-13 19:50:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-13 19:50:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-13 19:50:48,943 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-13 19:50:48,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:48,944 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-13 19:50:48,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:48,944 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-13 19:50:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:48,950 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:48,950 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:48,951 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-10-13 19:50:48,951 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:48,952 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781031119] [2019-10-13 19:50:48,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,952 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:48,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:49,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781031119] [2019-10-13 19:50:49,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:49,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261981347] [2019-10-13 19:50:49,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:49,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:49,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:49,025 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-13 19:50:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:49,211 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-13 19:50:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:49,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:49,214 INFO L225 Difference]: With dead ends: 498 [2019-10-13 19:50:49,214 INFO L226 Difference]: Without dead ends: 264 [2019-10-13 19:50:49,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-13 19:50:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-13 19:50:49,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-13 19:50:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-13 19:50:49,229 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-13 19:50:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:49,230 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-13 19:50:49,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:49,230 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-13 19:50:49,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 19:50:49,232 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:49,232 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:49,233 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:49,233 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-10-13 19:50:49,233 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:49,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497219470] [2019-10-13 19:50:49,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,339 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:49,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497219470] [2019-10-13 19:50:49,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:49,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987693112] [2019-10-13 19:50:49,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:49,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:49,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:49,343 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-13 19:50:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:49,589 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-13 19:50:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:49,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-13 19:50:49,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:49,593 INFO L225 Difference]: With dead ends: 557 [2019-10-13 19:50:49,593 INFO L226 Difference]: Without dead ends: 308 [2019-10-13 19:50:49,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-13 19:50:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-13 19:50:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-13 19:50:49,608 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-13 19:50:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:49,609 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-13 19:50:49,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-13 19:50:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:49,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:49,611 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:49,611 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:49,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:49,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-10-13 19:50:49,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:49,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865543366] [2019-10-13 19:50:49,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:49,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865543366] [2019-10-13 19:50:49,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:49,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890362744] [2019-10-13 19:50:49,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:49,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:49,674 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-13 19:50:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:49,851 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-13 19:50:49,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:49,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:49,854 INFO L225 Difference]: With dead ends: 597 [2019-10-13 19:50:49,854 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:50:49,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:49,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:50:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-13 19:50:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-13 19:50:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-13 19:50:49,870 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-13 19:50:49,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:49,871 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-13 19:50:49,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-13 19:50:49,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 19:50:49,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:49,873 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:49,873 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:49,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:49,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-10-13 19:50:49,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:49,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116771634] [2019-10-13 19:50:49,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:49,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:50:49,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116771634] [2019-10-13 19:50:49,935 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:49,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:49,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835590055] [2019-10-13 19:50:49,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:49,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:49,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:49,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:49,937 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-13 19:50:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:50,190 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-13 19:50:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:50,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-13 19:50:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:50,193 INFO L225 Difference]: With dead ends: 599 [2019-10-13 19:50:50,193 INFO L226 Difference]: Without dead ends: 306 [2019-10-13 19:50:50,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-13 19:50:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-13 19:50:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-13 19:50:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-13 19:50:50,206 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-13 19:50:50,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:50,207 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-13 19:50:50,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-13 19:50:50,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:50:50,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:50,209 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:50,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-10-13 19:50:50,210 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:50,210 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465581778] [2019-10-13 19:50:50,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,210 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-13 19:50:50,258 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465581778] [2019-10-13 19:50:50,258 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:50,259 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:50,259 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906282724] [2019-10-13 19:50:50,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:50,259 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:50,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:50,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:50,260 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-13 19:50:50,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:50,420 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-13 19:50:50,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:50,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:50:50,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:50,423 INFO L225 Difference]: With dead ends: 600 [2019-10-13 19:50:50,423 INFO L226 Difference]: Without dead ends: 311 [2019-10-13 19:50:50,424 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:50,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-13 19:50:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-13 19:50:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-13 19:50:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-13 19:50:50,438 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-13 19:50:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:50,438 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-13 19:50:50,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-13 19:50:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-13 19:50:50,440 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:50,440 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:50,441 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:50,441 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-10-13 19:50:50,441 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:50,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598971585] [2019-10-13 19:50:50,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:50,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598971585] [2019-10-13 19:50:50,493 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:50,493 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:50,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910636118] [2019-10-13 19:50:50,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:50,494 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:50,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:50,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:50,495 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-13 19:50:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:50,720 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-13 19:50:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:50,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-13 19:50:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:50,723 INFO L225 Difference]: With dead ends: 640 [2019-10-13 19:50:50,723 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:50,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:50,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:50,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-13 19:50:50,744 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-13 19:50:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:50,744 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-13 19:50:50,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-13 19:50:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:50:50,747 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:50,747 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:50,747 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:50,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-10-13 19:50:50,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:50,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671888884] [2019-10-13 19:50:50,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:50,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:50,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671888884] [2019-10-13 19:50:50,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:50,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:50,851 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827431532] [2019-10-13 19:50:50,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:50,852 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:50,853 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-13 19:50:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,056 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-13 19:50:51,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:50:51,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,059 INFO L225 Difference]: With dead ends: 669 [2019-10-13 19:50:51,059 INFO L226 Difference]: Without dead ends: 342 [2019-10-13 19:50:51,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:51,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-13 19:50:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-13 19:50:51,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-13 19:50:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-13 19:50:51,080 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-13 19:50:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,081 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-13 19:50:51,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-13 19:50:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-13 19:50:51,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,083 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,084 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-10-13 19:50:51,085 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,085 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424248861] [2019-10-13 19:50:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,156 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:51,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424248861] [2019-10-13 19:50:51,156 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,157 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,157 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469483905] [2019-10-13 19:50:51,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,158 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,158 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-13 19:50:51,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,374 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-13 19:50:51,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-13 19:50:51,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,377 INFO L225 Difference]: With dead ends: 702 [2019-10-13 19:50:51,377 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:51,379 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-13 19:50:51,397 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-13 19:50:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,398 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-13 19:50:51,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-13 19:50:51,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:50:51,400 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,400 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-10-13 19:50:51,401 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,401 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479422924] [2019-10-13 19:50:51,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,402 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:50:51,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479422924] [2019-10-13 19:50:51,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375352317] [2019-10-13 19:50:51,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,465 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-13 19:50:51,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:51,786 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-13 19:50:51,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:51,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:50:51,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:51,791 INFO L225 Difference]: With dead ends: 729 [2019-10-13 19:50:51,791 INFO L226 Difference]: Without dead ends: 375 [2019-10-13 19:50:51,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-13 19:50:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-13 19:50:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-13 19:50:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-13 19:50:51,820 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-13 19:50:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:51,821 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-13 19:50:51,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-13 19:50:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:50:51,824 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:51,825 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:51,825 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-10-13 19:50:51,826 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:51,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277310301] [2019-10-13 19:50:51,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:51,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:51,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277310301] [2019-10-13 19:50:51,921 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:51,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:51,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144898088] [2019-10-13 19:50:51,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:51,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:51,925 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-13 19:50:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,201 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2019-10-13 19:50:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:50:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,205 INFO L225 Difference]: With dead ends: 747 [2019-10-13 19:50:52,205 INFO L226 Difference]: Without dead ends: 393 [2019-10-13 19:50:52,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:52,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-13 19:50:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-13 19:50:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-13 19:50:52,226 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-13 19:50:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,226 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-13 19:50:52,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-13 19:50:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 19:50:52,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,229 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,229 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-10-13 19:50:52,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207806520] [2019-10-13 19:50:52,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:52,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207806520] [2019-10-13 19:50:52,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:50:52,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028609259] [2019-10-13 19:50:52,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:50:52,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:50:52,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:52,293 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-13 19:50:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,498 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2019-10-13 19:50:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:52,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-13 19:50:52,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,502 INFO L225 Difference]: With dead ends: 768 [2019-10-13 19:50:52,502 INFO L226 Difference]: Without dead ends: 393 [2019-10-13 19:50:52,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:50:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-13 19:50:52,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-13 19:50:52,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-13 19:50:52,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-13 19:50:52,523 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-13 19:50:52,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,524 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-13 19:50:52,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:50:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-13 19:50:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-13 19:50:52,526 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,527 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,527 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-10-13 19:50:52,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286484175] [2019-10-13 19:50:52,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 19:50:52,613 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286484175] [2019-10-13 19:50:52,613 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,614 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:52,614 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438055005] [2019-10-13 19:50:52,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:52,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:52,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:52,615 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-13 19:50:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,692 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-13 19:50:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:52,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-13 19:50:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,698 INFO L225 Difference]: With dead ends: 763 [2019-10-13 19:50:52,698 INFO L226 Difference]: Without dead ends: 761 [2019-10-13 19:50:52,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-13 19:50:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-13 19:50:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-13 19:50:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-13 19:50:52,740 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-13 19:50:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,740 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-13 19:50:52,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-13 19:50:52,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:52,744 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,744 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,744 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-10-13 19:50:52,745 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848206808] [2019-10-13 19:50:52,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 19:50:52,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848206808] [2019-10-13 19:50:52,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:52,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:52,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328939268] [2019-10-13 19:50:52,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:52,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:52,806 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-13 19:50:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:52,885 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2019-10-13 19:50:52,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:52,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 19:50:52,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:52,894 INFO L225 Difference]: With dead ends: 1877 [2019-10-13 19:50:52,895 INFO L226 Difference]: Without dead ends: 1129 [2019-10-13 19:50:52,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-13 19:50:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-13 19:50:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-13 19:50:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-10-13 19:50:52,965 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-10-13 19:50:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:52,966 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-10-13 19:50:52,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-10-13 19:50:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-13 19:50:52,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:52,971 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:52,971 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-10-13 19:50:52,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:52,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698789907] [2019-10-13 19:50:52,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,972 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:52,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,019 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-13 19:50:53,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698789907] [2019-10-13 19:50:53,020 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,020 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:53,020 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875663064] [2019-10-13 19:50:53,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:53,021 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:53,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,022 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-10-13 19:50:53,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,108 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2019-10-13 19:50:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:53,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-13 19:50:53,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,116 INFO L225 Difference]: With dead ends: 2596 [2019-10-13 19:50:53,117 INFO L226 Difference]: Without dead ends: 1480 [2019-10-13 19:50:53,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-13 19:50:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-10-13 19:50:53,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-13 19:50:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-10-13 19:50:53,199 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-10-13 19:50:53,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,200 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-10-13 19:50:53,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-10-13 19:50:53,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 19:50:53,205 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,205 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:53,205 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,206 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-10-13 19:50:53,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848082610] [2019-10-13 19:50:53,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 19:50:53,286 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848082610] [2019-10-13 19:50:53,286 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,286 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:53,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720420404] [2019-10-13 19:50:53,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:53,287 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:53,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,288 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-10-13 19:50:53,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,512 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2019-10-13 19:50:53,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:53,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 19:50:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,521 INFO L225 Difference]: With dead ends: 2987 [2019-10-13 19:50:53,521 INFO L226 Difference]: Without dead ends: 1520 [2019-10-13 19:50:53,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-13 19:50:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-10-13 19:50:53,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-13 19:50:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-10-13 19:50:53,594 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-10-13 19:50:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:53,594 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-10-13 19:50:53,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-10-13 19:50:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 19:50:53,599 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:53,599 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:53,600 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-10-13 19:50:53,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:53,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623216331] [2019-10-13 19:50:53,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:53,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-10-13 19:50:53,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623216331] [2019-10-13 19:50:53,653 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:53,653 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:53,653 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625215744] [2019-10-13 19:50:53,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:53,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:53,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:53,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,655 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-10-13 19:50:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:53,881 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2019-10-13 19:50:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:53,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 19:50:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:53,894 INFO L225 Difference]: With dead ends: 3143 [2019-10-13 19:50:53,894 INFO L226 Difference]: Without dead ends: 1676 [2019-10-13 19:50:53,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-13 19:50:53,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-10-13 19:50:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-13 19:50:54,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-10-13 19:50:54,009 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-10-13 19:50:54,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,009 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-10-13 19:50:54,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:54,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-10-13 19:50:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-13 19:50:54,015 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,016 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,016 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-10-13 19:50:54,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932771577] [2019-10-13 19:50:54,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-10-13 19:50:54,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932771577] [2019-10-13 19:50:54,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:54,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797271111] [2019-10-13 19:50:54,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:54,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:54,104 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-10-13 19:50:54,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,315 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2019-10-13 19:50:54,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:54,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-13 19:50:54,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,325 INFO L225 Difference]: With dead ends: 3195 [2019-10-13 19:50:54,325 INFO L226 Difference]: Without dead ends: 1648 [2019-10-13 19:50:54,329 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:54,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-10-13 19:50:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-10-13 19:50:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-13 19:50:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-10-13 19:50:54,396 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-10-13 19:50:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,397 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-10-13 19:50:54,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-10-13 19:50:54,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-13 19:50:54,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,403 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:54,403 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-10-13 19:50:54,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211064830] [2019-10-13 19:50:54,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,465 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 19:50:54,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211064830] [2019-10-13 19:50:54,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:54,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544506182] [2019-10-13 19:50:54,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:54,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:54,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:54,468 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-10-13 19:50:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:54,636 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2019-10-13 19:50:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:54,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-13 19:50:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:54,645 INFO L225 Difference]: With dead ends: 3198 [2019-10-13 19:50:54,645 INFO L226 Difference]: Without dead ends: 1651 [2019-10-13 19:50:54,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:54,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-10-13 19:50:54,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-10-13 19:50:54,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-10-13 19:50:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-10-13 19:50:54,741 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-10-13 19:50:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:54,742 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-10-13 19:50:54,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-10-13 19:50:54,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-13 19:50:54,748 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:54,748 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 19:50:54,748 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:54,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:54,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-10-13 19:50:54,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:54,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330232167] [2019-10-13 19:50:54,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:54,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-13 19:50:54,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330232167] [2019-10-13 19:50:54,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:54,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:54,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996615628] [2019-10-13 19:50:54,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:54,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:54,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:54,837 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-10-13 19:50:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,061 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2019-10-13 19:50:55,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:55,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-13 19:50:55,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,075 INFO L225 Difference]: With dead ends: 3403 [2019-10-13 19:50:55,075 INFO L226 Difference]: Without dead ends: 1787 [2019-10-13 19:50:55,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:55,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-10-13 19:50:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-10-13 19:50:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-13 19:50:55,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-10-13 19:50:55,186 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-10-13 19:50:55,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,187 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-10-13 19:50:55,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:55,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-10-13 19:50:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-13 19:50:55,197 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,197 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,198 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-10-13 19:50:55,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610317883] [2019-10-13 19:50:55,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-10-13 19:50:55,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610317883] [2019-10-13 19:50:55,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:55,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202600814] [2019-10-13 19:50:55,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:55,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:55,317 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-10-13 19:50:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:55,639 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2019-10-13 19:50:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:55,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-13 19:50:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:55,649 INFO L225 Difference]: With dead ends: 3531 [2019-10-13 19:50:55,649 INFO L226 Difference]: Without dead ends: 1815 [2019-10-13 19:50:55,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-10-13 19:50:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-10-13 19:50:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-13 19:50:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-10-13 19:50:55,719 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-10-13 19:50:55,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:55,719 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-10-13 19:50:55,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-10-13 19:50:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-13 19:50:55,725 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:55,726 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:55,726 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-10-13 19:50:55,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:55,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471388847] [2019-10-13 19:50:55,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:55,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-13 19:50:55,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471388847] [2019-10-13 19:50:55,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:55,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:55,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698381439] [2019-10-13 19:50:55,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:55,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:55,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:55,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:55,829 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-10-13 19:50:56,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,035 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2019-10-13 19:50:56,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-13 19:50:56,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,046 INFO L225 Difference]: With dead ends: 3647 [2019-10-13 19:50:56,046 INFO L226 Difference]: Without dead ends: 1831 [2019-10-13 19:50:56,051 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-10-13 19:50:56,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-10-13 19:50:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-13 19:50:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-10-13 19:50:56,137 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-10-13 19:50:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,137 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-10-13 19:50:56,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-10-13 19:50:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-13 19:50:56,147 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,147 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-13 19:50:56,148 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-10-13 19:50:56,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343976266] [2019-10-13 19:50:56,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-13 19:50:56,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343976266] [2019-10-13 19:50:56,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:56,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:56,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719230403] [2019-10-13 19:50:56,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:56,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:56,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:56,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,293 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-10-13 19:50:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:56,486 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2019-10-13 19:50:56,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:56,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-13 19:50:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:56,498 INFO L225 Difference]: With dead ends: 3595 [2019-10-13 19:50:56,498 INFO L226 Difference]: Without dead ends: 1823 [2019-10-13 19:50:56,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-13 19:50:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-10-13 19:50:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-13 19:50:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-10-13 19:50:56,603 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-10-13 19:50:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:56,603 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-10-13 19:50:56,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-10-13 19:50:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-13 19:50:56,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:56,611 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:56,611 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-10-13 19:50:56,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:56,612 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386344316] [2019-10-13 19:50:56,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:56,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,728 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 425 proven. 16 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-13 19:50:56,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386344316] [2019-10-13 19:50:56,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657111727] [2019-10-13 19:50:56,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:56,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 19:50:56,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 624 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-13 19:50:57,012 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:50:57,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:50:57,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898232190] [2019-10-13 19:50:57,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:57,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:57,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,016 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 3 states. [2019-10-13 19:50:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:57,154 INFO L93 Difference]: Finished difference Result 3585 states and 4844 transitions. [2019-10-13 19:50:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:57,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-13 19:50:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:57,168 INFO L225 Difference]: With dead ends: 3585 [2019-10-13 19:50:57,168 INFO L226 Difference]: Without dead ends: 2246 [2019-10-13 19:50:57,200 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:50:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-10-13 19:50:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2019-10-13 19:50:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-10-13 19:50:57,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3031 transitions. [2019-10-13 19:50:57,314 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3031 transitions. Word has length 251 [2019-10-13 19:50:57,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:57,315 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 3031 transitions. [2019-10-13 19:50:57,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:57,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3031 transitions. [2019-10-13 19:50:57,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 19:50:57,324 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:57,324 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-13 19:50:57,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:57,531 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:57,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:57,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2019-10-13 19:50:57,532 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:57,532 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845077398] [2019-10-13 19:50:57,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,532 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:57,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 19:50:57,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845077398] [2019-10-13 19:50:57,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616279808] [2019-10-13 19:50:57,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:57,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:50:57,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:50:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 430 proven. 16 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-10-13 19:50:57,893 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:50:57,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:50:57,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75797389] [2019-10-13 19:50:57,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:50:57,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:57,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:50:57,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:50:57,895 INFO L87 Difference]: Start difference. First operand 2246 states and 3031 transitions. Second operand 4 states. [2019-10-13 19:50:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:58,493 INFO L93 Difference]: Finished difference Result 7160 states and 9675 transitions. [2019-10-13 19:50:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:50:58,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-10-13 19:50:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:58,533 INFO L225 Difference]: With dead ends: 7160 [2019-10-13 19:50:58,533 INFO L226 Difference]: Without dead ends: 4933 [2019-10-13 19:50:58,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 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-13 19:50:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2019-10-13 19:50:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 2791. [2019-10-13 19:50:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-10-13 19:50:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3681 transitions. [2019-10-13 19:50:58,680 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3681 transitions. Word has length 258 [2019-10-13 19:50:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:58,681 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 3681 transitions. [2019-10-13 19:50:58,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:50:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3681 transitions. [2019-10-13 19:50:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-13 19:50:58,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:58,689 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-13 19:50:58,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:50:58,898 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:58,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-10-13 19:50:58,899 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:58,899 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728925576] [2019-10-13 19:50:58,899 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,900 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:58,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-13 19:50:59,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728925576] [2019-10-13 19:50:59,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:59,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704685804] [2019-10-13 19:50:59,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:59,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:59,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,024 INFO L87 Difference]: Start difference. First operand 2791 states and 3681 transitions. Second operand 3 states. [2019-10-13 19:50:59,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,198 INFO L93 Difference]: Finished difference Result 7820 states and 10371 transitions. [2019-10-13 19:50:59,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:59,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-13 19:50:59,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,211 INFO L225 Difference]: With dead ends: 7820 [2019-10-13 19:50:59,211 INFO L226 Difference]: Without dead ends: 5048 [2019-10-13 19:50:59,218 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2019-10-13 19:50:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5046. [2019-10-13 19:50:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2019-10-13 19:50:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 6701 transitions. [2019-10-13 19:50:59,418 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 6701 transitions. Word has length 258 [2019-10-13 19:50:59,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:50:59,418 INFO L462 AbstractCegarLoop]: Abstraction has 5046 states and 6701 transitions. [2019-10-13 19:50:59,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:50:59,419 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 6701 transitions. [2019-10-13 19:50:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-13 19:50:59,431 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:50:59,431 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:50:59,431 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:50:59,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:50:59,432 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-10-13 19:50:59,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:50:59,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141150417] [2019-10-13 19:50:59,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:50:59,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:50:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:50:59,561 INFO L134 CoverageAnalysis]: Checked inductivity of 580 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:50:59,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141150417] [2019-10-13 19:50:59,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:50:59,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:50:59,562 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879014459] [2019-10-13 19:50:59,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:50:59,565 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:50:59,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:50:59,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,566 INFO L87 Difference]: Start difference. First operand 5046 states and 6701 transitions. Second operand 3 states. [2019-10-13 19:50:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:50:59,872 INFO L93 Difference]: Finished difference Result 10199 states and 13538 transitions. [2019-10-13 19:50:59,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:50:59,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-13 19:50:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:50:59,882 INFO L225 Difference]: With dead ends: 10199 [2019-10-13 19:50:59,883 INFO L226 Difference]: Without dead ends: 5172 [2019-10-13 19:50:59,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:50:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-10-13 19:51:00,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5047. [2019-10-13 19:51:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-13 19:51:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6617 transitions. [2019-10-13 19:51:00,069 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6617 transitions. Word has length 261 [2019-10-13 19:51:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,069 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6617 transitions. [2019-10-13 19:51:00,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6617 transitions. [2019-10-13 19:51:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-13 19:51:00,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,081 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 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, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:00,081 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-10-13 19:51:00,082 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:00,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931274687] [2019-10-13 19:51:00,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,083 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:00,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:51:00,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931274687] [2019-10-13 19:51:00,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590880440] [2019-10-13 19:51:00,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:00,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:00,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-13 19:51:00,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:00,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:00,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803066138] [2019-10-13 19:51:00,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:00,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,371 INFO L87 Difference]: Start difference. First operand 5047 states and 6617 transitions. Second operand 3 states. [2019-10-13 19:51:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:00,622 INFO L93 Difference]: Finished difference Result 10094 states and 13226 transitions. [2019-10-13 19:51:00,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:00,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-13 19:51:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:00,633 INFO L225 Difference]: With dead ends: 10094 [2019-10-13 19:51:00,633 INFO L226 Difference]: Without dead ends: 5067 [2019-10-13 19:51:00,643 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2019-10-13 19:51:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5047. [2019-10-13 19:51:00,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-13 19:51:00,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6607 transitions. [2019-10-13 19:51:00,816 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6607 transitions. Word has length 287 [2019-10-13 19:51:00,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:00,817 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6607 transitions. [2019-10-13 19:51:00,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:00,817 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6607 transitions. [2019-10-13 19:51:00,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-13 19:51:00,827 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:00,828 INFO L380 BasicCegarLoop]: trace histogram [10, 10, 9, 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, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:01,035 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:01,035 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:01,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:01,036 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2019-10-13 19:51:01,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:01,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195288262] [2019-10-13 19:51:01,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:01,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,135 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 518 proven. 5 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:51:01,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195288262] [2019-10-13 19:51:01,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113002171] [2019-10-13 19:51:01,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:01,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:01,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 421 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-10-13 19:51:01,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:01,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:01,404 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177400648] [2019-10-13 19:51:01,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:01,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:01,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:01,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,405 INFO L87 Difference]: Start difference. First operand 5047 states and 6607 transitions. Second operand 3 states. [2019-10-13 19:51:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:01,690 INFO L93 Difference]: Finished difference Result 10074 states and 13186 transitions. [2019-10-13 19:51:01,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:01,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-10-13 19:51:01,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:01,700 INFO L225 Difference]: With dead ends: 10074 [2019-10-13 19:51:01,701 INFO L226 Difference]: Without dead ends: 5047 [2019-10-13 19:51:01,711 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2019-10-13 19:51:01,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2019-10-13 19:51:01,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-13 19:51:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6597 transitions. [2019-10-13 19:51:01,881 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6597 transitions. Word has length 288 [2019-10-13 19:51:01,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:01,882 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6597 transitions. [2019-10-13 19:51:01,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:01,882 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6597 transitions. [2019-10-13 19:51:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-13 19:51:01,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:01,892 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, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:02,104 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:02,105 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:02,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2019-10-13 19:51:02,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:02,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442679676] [2019-10-13 19:51:02,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:02,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:51:02,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442679676] [2019-10-13 19:51:02,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073663700] [2019-10-13 19:51:02,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:02,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:02,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 526 proven. 6 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-13 19:51:02,460 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:02,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:02,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449918361] [2019-10-13 19:51:02,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:02,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:02,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:02,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:02,462 INFO L87 Difference]: Start difference. First operand 5047 states and 6597 transitions. Second operand 4 states. [2019-10-13 19:51:03,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,022 INFO L93 Difference]: Finished difference Result 11856 states and 15438 transitions. [2019-10-13 19:51:03,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:03,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-10-13 19:51:03,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,036 INFO L225 Difference]: With dead ends: 11856 [2019-10-13 19:51:03,037 INFO L226 Difference]: Without dead ends: 6763 [2019-10-13 19:51:03,049 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 292 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-13 19:51:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2019-10-13 19:51:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 4456. [2019-10-13 19:51:03,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2019-10-13 19:51:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5756 transitions. [2019-10-13 19:51:03,244 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5756 transitions. Word has length 288 [2019-10-13 19:51:03,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,244 INFO L462 AbstractCegarLoop]: Abstraction has 4456 states and 5756 transitions. [2019-10-13 19:51:03,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:03,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5756 transitions. [2019-10-13 19:51:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-13 19:51:03,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,255 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:03,460 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-10-13 19:51:03,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373136227] [2019-10-13 19:51:03,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,562 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 564 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-13 19:51:03,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373136227] [2019-10-13 19:51:03,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:03,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:03,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346981675] [2019-10-13 19:51:03,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:03,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:03,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:03,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,564 INFO L87 Difference]: Start difference. First operand 4456 states and 5756 transitions. Second operand 3 states. [2019-10-13 19:51:03,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:03,762 INFO L93 Difference]: Finished difference Result 7492 states and 9566 transitions. [2019-10-13 19:51:03,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:03,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-13 19:51:03,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:03,769 INFO L225 Difference]: With dead ends: 7492 [2019-10-13 19:51:03,769 INFO L226 Difference]: Without dead ends: 2273 [2019-10-13 19:51:03,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-10-13 19:51:03,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2019-10-13 19:51:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-10-13 19:51:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2893 transitions. [2019-10-13 19:51:03,892 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2893 transitions. Word has length 326 [2019-10-13 19:51:03,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:03,893 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 2893 transitions. [2019-10-13 19:51:03,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2893 transitions. [2019-10-13 19:51:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-13 19:51:03,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:03,902 INFO L380 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 9, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:03,903 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-10-13 19:51:03,904 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:03,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791152196] [2019-10-13 19:51:03,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:03,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 738 proven. 0 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2019-10-13 19:51:04,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791152196] [2019-10-13 19:51:04,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:04,138 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:04,138 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233859513] [2019-10-13 19:51:04,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,140 INFO L87 Difference]: Start difference. First operand 2273 states and 2893 transitions. Second operand 3 states. [2019-10-13 19:51:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,328 INFO L93 Difference]: Finished difference Result 4511 states and 5729 transitions. [2019-10-13 19:51:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-13 19:51:04,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,335 INFO L225 Difference]: With dead ends: 4511 [2019-10-13 19:51:04,335 INFO L226 Difference]: Without dead ends: 2283 [2019-10-13 19:51:04,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-10-13 19:51:04,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2273. [2019-10-13 19:51:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-10-13 19:51:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2868 transitions. [2019-10-13 19:51:04,421 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2868 transitions. Word has length 365 [2019-10-13 19:51:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:04,421 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 2868 transitions. [2019-10-13 19:51:04,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2868 transitions. [2019-10-13 19:51:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-13 19:51:04,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:04,429 INFO L380 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:04,429 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:04,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:04,430 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-10-13 19:51:04,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:04,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502010328] [2019-10-13 19:51:04,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:04,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1011 proven. 26 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-10-13 19:51:04,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502010328] [2019-10-13 19:51:04,572 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047830296] [2019-10-13 19:51:04,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:04,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:04,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:04,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 773 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2019-10-13 19:51:04,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:51:04,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-13 19:51:04,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112093507] [2019-10-13 19:51:04,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:04,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:04,842 INFO L87 Difference]: Start difference. First operand 2273 states and 2868 transitions. Second operand 3 states. [2019-10-13 19:51:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:04,926 INFO L93 Difference]: Finished difference Result 2892 states and 3673 transitions. [2019-10-13 19:51:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:04,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-13 19:51:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:04,932 INFO L225 Difference]: With dead ends: 2892 [2019-10-13 19:51:04,932 INFO L226 Difference]: Without dead ends: 2800 [2019-10-13 19:51:04,933 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:51:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-13 19:51:05,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2183. [2019-10-13 19:51:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-10-13 19:51:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2767 transitions. [2019-10-13 19:51:05,010 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2767 transitions. Word has length 398 [2019-10-13 19:51:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:05,011 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2767 transitions. [2019-10-13 19:51:05,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2767 transitions. [2019-10-13 19:51:05,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-13 19:51:05,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:05,018 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:05,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:05,228 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:05,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2019-10-13 19:51:05,229 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:05,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159072794] [2019-10-13 19:51:05,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,229 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:05,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-13 19:51:05,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159072794] [2019-10-13 19:51:05,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991786021] [2019-10-13 19:51:05,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:05,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:05,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:05,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3139 backedges. 1686 proven. 26 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2019-10-13 19:51:05,762 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:05,762 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:05,762 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378683951] [2019-10-13 19:51:05,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:05,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:05,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:05,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:05,766 INFO L87 Difference]: Start difference. First operand 2183 states and 2767 transitions. Second operand 4 states. [2019-10-13 19:51:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:06,153 INFO L93 Difference]: Finished difference Result 5269 states and 6675 transitions. [2019-10-13 19:51:06,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:51:06,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2019-10-13 19:51:06,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:06,160 INFO L225 Difference]: With dead ends: 5269 [2019-10-13 19:51:06,160 INFO L226 Difference]: Without dead ends: 3089 [2019-10-13 19:51:06,164 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 542 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-13 19:51:06,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-10-13 19:51:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2243. [2019-10-13 19:51:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-10-13 19:51:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2847 transitions. [2019-10-13 19:51:06,245 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2847 transitions. Word has length 538 [2019-10-13 19:51:06,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:06,245 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 2847 transitions. [2019-10-13 19:51:06,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:06,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2847 transitions. [2019-10-13 19:51:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-13 19:51:06,252 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:06,252 INFO L380 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 17, 17, 15, 15, 13, 13, 11, 11, 11, 11, 8, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:06,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:06,463 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:06,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:06,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2019-10-13 19:51:06,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:06,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604882055] [2019-10-13 19:51:06,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:06,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 2066 proven. 0 refuted. 0 times theorem prover too weak. 1910 trivial. 0 not checked. [2019-10-13 19:51:06,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604882055] [2019-10-13 19:51:06,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:06,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:06,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657927564] [2019-10-13 19:51:06,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:06,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:06,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:06,847 INFO L87 Difference]: Start difference. First operand 2243 states and 2847 transitions. Second operand 3 states. [2019-10-13 19:51:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,063 INFO L93 Difference]: Finished difference Result 4621 states and 5867 transitions. [2019-10-13 19:51:07,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2019-10-13 19:51:07,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,068 INFO L225 Difference]: With dead ends: 4621 [2019-10-13 19:51:07,068 INFO L226 Difference]: Without dead ends: 2423 [2019-10-13 19:51:07,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-10-13 19:51:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2413. [2019-10-13 19:51:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-10-13 19:51:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3042 transitions. [2019-10-13 19:51:07,166 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3042 transitions. Word has length 600 [2019-10-13 19:51:07,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,167 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 3042 transitions. [2019-10-13 19:51:07,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3042 transitions. [2019-10-13 19:51:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-10-13 19:51:07,175 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,176 INFO L380 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 19, 19, 17, 17, 15, 15, 13, 13, 13, 13, 10, 8, 8, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,176 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2019-10-13 19:51:07,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080133869] [2019-10-13 19:51:07,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4945 backedges. 2605 proven. 0 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2019-10-13 19:51:07,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080133869] [2019-10-13 19:51:07,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:51:07,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:51:07,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995518383] [2019-10-13 19:51:07,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:51:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:07,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:51:07,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,464 INFO L87 Difference]: Start difference. First operand 2413 states and 3042 transitions. Second operand 3 states. [2019-10-13 19:51:07,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:07,675 INFO L93 Difference]: Finished difference Result 4778 states and 6009 transitions. [2019-10-13 19:51:07,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:51:07,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-10-13 19:51:07,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:07,681 INFO L225 Difference]: With dead ends: 4778 [2019-10-13 19:51:07,681 INFO L226 Difference]: Without dead ends: 2410 [2019-10-13 19:51:07,685 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:51:07,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2019-10-13 19:51:07,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2019-10-13 19:51:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2019-10-13 19:51:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2987 transitions. [2019-10-13 19:51:07,769 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2987 transitions. Word has length 662 [2019-10-13 19:51:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:07,769 INFO L462 AbstractCegarLoop]: Abstraction has 2408 states and 2987 transitions. [2019-10-13 19:51:07,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:51:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2987 transitions. [2019-10-13 19:51:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-10-13 19:51:07,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:51:07,781 INFO L380 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 21, 21, 19, 19, 17, 17, 15, 15, 15, 15, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:51:07,781 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:51:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:51:07,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-10-13 19:51:07,782 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:51:07,782 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144202020] [2019-10-13 19:51:07,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:51:07,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:51:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-13 19:51:08,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144202020] [2019-10-13 19:51:08,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2324517] [2019-10-13 19:51:08,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:51:08,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 19:51:08,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:51:08,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6056 backedges. 3605 proven. 16 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2019-10-13 19:51:08,665 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:51:08,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-13 19:51:08,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997991595] [2019-10-13 19:51:08,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:51:08,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:51:08,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:51:08,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:51:08,668 INFO L87 Difference]: Start difference. First operand 2408 states and 2987 transitions. Second operand 4 states. [2019-10-13 19:51:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:51:08,939 INFO L93 Difference]: Finished difference Result 4118 states and 5143 transitions. [2019-10-13 19:51:08,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:51:08,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2019-10-13 19:51:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:51:08,940 INFO L225 Difference]: With dead ends: 4118 [2019-10-13 19:51:08,940 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 19:51:08,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 732 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-13 19:51:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 19:51:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 19:51:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 19:51:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 19:51:08,952 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2019-10-13 19:51:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:51:08,953 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 19:51:08,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:51:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 19:51:08,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 19:51:09,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:51:09,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 19:51:09,282 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-10-13 19:51:09,756 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 [2019-10-13 19:51:09,937 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2019-10-13 19:51:11,337 WARN L191 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 464 DAG size of output: 250 [2019-10-13 19:51:12,198 WARN L191 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 465 DAG size of output: 256 [2019-10-13 19:51:12,611 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 141 [2019-10-13 19:51:13,463 WARN L191 SmtUtils]: Spent 809.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2019-10-13 19:51:14,130 WARN L191 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-10-13 19:51:14,897 WARN L191 SmtUtils]: Spent 764.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-10-13 19:51:15,595 WARN L191 SmtUtils]: Spent 696.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-10-13 19:51:16,229 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-10-13 19:51:16,597 WARN L191 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 59