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-13a467a-m [2019-10-14 23:49:42,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:49:42,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:49:42,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:49:42,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:49:42,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:49:42,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:49:42,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:49:42,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:49:42,817 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:49:42,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:49:42,819 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:49:42,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:49:42,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:49:42,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:49:42,828 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:49:42,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:49:42,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:49:42,835 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:49:42,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:49:42,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:49:42,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:49:42,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:49:42,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:49:42,842 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:49:42,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:49:42,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:49:42,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:49:42,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:49:42,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:49:42,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:49:42,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:49:42,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:49:42,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:49:42,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:49:42,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:49:42,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:49:42,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:49:42,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:49:42,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:49:42,851 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:49:42,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:49:42,866 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:49:42,866 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:49:42,867 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:49:42,867 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:49:42,868 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:49:42,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:49:42,868 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:49:42,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:49:42,868 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:49:42,869 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:49:42,869 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:49:42,869 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:49:42,869 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:49:42,869 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:49:42,870 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:49:42,870 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:49:42,870 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:49:42,870 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:49:42,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:49:42,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:49:42,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:49:42,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:42,871 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:49:42,872 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:49:43,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:49:43,155 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:49:43,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:49:43,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:49:43,161 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:49:43,162 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-14 23:49:43,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8e28020/4c357f587a3a4a56b26e477db5927835/FLAG54402460c [2019-10-14 23:49:43,755 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:49:43,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh-simplified/s3_srvr_2.cil-1.c [2019-10-14 23:49:43,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8e28020/4c357f587a3a4a56b26e477db5927835/FLAG54402460c [2019-10-14 23:49:44,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a8e28020/4c357f587a3a4a56b26e477db5927835 [2019-10-14 23:49:44,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:49:44,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:49:44,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:44,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:49:44,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:49:44,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e48f3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44, skipping insertion in model container [2019-10-14 23:49:44,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,122 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:49:44,183 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:49:44,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:44,441 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:49:44,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:49:44,540 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:49:44,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44 WrapperNode [2019-10-14 23:49:44,541 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:49:44,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:49:44,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:49:44,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:49:44,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,658 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... [2019-10-14 23:49:44,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:49:44,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:49:44,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:49:44,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:49:44,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:49:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:49:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:49:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-10-14 23:49:44,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:49:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:49:44,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:49:44,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:49:44,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:49:44,970 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-14 23:49:45,446 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-14 23:49:45,446 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-14 23:49:45,451 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:49:45,451 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:49:45,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:45 BoogieIcfgContainer [2019-10-14 23:49:45,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:49:45,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:49:45,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:49:45,458 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:49:45,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:49:44" (1/3) ... [2019-10-14 23:49:45,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd56fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:45, skipping insertion in model container [2019-10-14 23:49:45,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:49:44" (2/3) ... [2019-10-14 23:49:45,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd56fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:49:45, skipping insertion in model container [2019-10-14 23:49:45,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:49:45" (3/3) ... [2019-10-14 23:49:45,476 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_2.cil-1.c [2019-10-14 23:49:45,489 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:49:45,499 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:49:45,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:49:45,553 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:49:45,553 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:49:45,554 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:49:45,554 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:49:45,554 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:49:45,555 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:49:45,555 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:49:45,555 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:49:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-14 23:49:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-14 23:49:45,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:45,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:45,621 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:45,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1127072202, now seen corresponding path program 1 times [2019-10-14 23:49:45,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:45,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707105596] [2019-10-14 23:49:45,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:45,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:45,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:46,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707105596] [2019-10-14 23:49:46,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:46,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:46,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258992428] [2019-10-14 23:49:46,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:46,029 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:46,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:46,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:46,048 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 5 states. [2019-10-14 23:49:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:46,523 INFO L93 Difference]: Finished difference Result 337 states and 574 transitions. [2019-10-14 23:49:46,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:46,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-10-14 23:49:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:46,557 INFO L225 Difference]: With dead ends: 337 [2019-10-14 23:49:46,557 INFO L226 Difference]: Without dead ends: 180 [2019-10-14 23:49:46,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-14 23:49:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2019-10-14 23:49:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-14 23:49:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 280 transitions. [2019-10-14 23:49:46,711 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 280 transitions. Word has length 49 [2019-10-14 23:49:46,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:46,714 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 280 transitions. [2019-10-14 23:49:46,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:46,716 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 280 transitions. [2019-10-14 23:49:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 23:49:46,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:46,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:46,723 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:46,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:46,724 INFO L82 PathProgramCache]: Analyzing trace with hash 572375021, now seen corresponding path program 1 times [2019-10-14 23:49:46,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:46,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117961230] [2019-10-14 23:49:46,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:46,726 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:46,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117961230] [2019-10-14 23:49:46,876 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:46,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:46,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121115536] [2019-10-14 23:49:46,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:46,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:46,879 INFO L87 Difference]: Start difference. First operand 175 states and 280 transitions. Second operand 5 states. [2019-10-14 23:49:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:47,201 INFO L93 Difference]: Finished difference Result 385 states and 629 transitions. [2019-10-14 23:49:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:47,202 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-10-14 23:49:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:47,205 INFO L225 Difference]: With dead ends: 385 [2019-10-14 23:49:47,205 INFO L226 Difference]: Without dead ends: 221 [2019-10-14 23:49:47,210 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-10-14 23:49:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2019-10-14 23:49:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-10-14 23:49:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 357 transitions. [2019-10-14 23:49:47,258 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 357 transitions. Word has length 50 [2019-10-14 23:49:47,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:47,259 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 357 transitions. [2019-10-14 23:49:47,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 357 transitions. [2019-10-14 23:49:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-10-14 23:49:47,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:47,262 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:47,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:47,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:47,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2018770907, now seen corresponding path program 1 times [2019-10-14 23:49:47,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:47,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218131015] [2019-10-14 23:49:47,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:47,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218131015] [2019-10-14 23:49:47,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:47,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:47,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626360700] [2019-10-14 23:49:47,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:47,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:47,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:47,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:47,419 INFO L87 Difference]: Start difference. First operand 216 states and 357 transitions. Second operand 5 states. [2019-10-14 23:49:47,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:47,717 INFO L93 Difference]: Finished difference Result 450 states and 755 transitions. [2019-10-14 23:49:47,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:47,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-10-14 23:49:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:47,720 INFO L225 Difference]: With dead ends: 450 [2019-10-14 23:49:47,720 INFO L226 Difference]: Without dead ends: 247 [2019-10-14 23:49:47,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-10-14 23:49:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2019-10-14 23:49:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-10-14 23:49:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 413 transitions. [2019-10-14 23:49:47,753 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 413 transitions. Word has length 77 [2019-10-14 23:49:47,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:47,753 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 413 transitions. [2019-10-14 23:49:47,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 413 transitions. [2019-10-14 23:49:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:47,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:47,757 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:47,758 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1670289669, now seen corresponding path program 1 times [2019-10-14 23:49:47,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:47,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756201785] [2019-10-14 23:49:47,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:47,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:47,826 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:47,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756201785] [2019-10-14 23:49:47,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:47,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:47,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069140054] [2019-10-14 23:49:47,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:47,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:47,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:47,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:47,829 INFO L87 Difference]: Start difference. First operand 247 states and 413 transitions. Second operand 5 states. [2019-10-14 23:49:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,071 INFO L93 Difference]: Finished difference Result 498 states and 837 transitions. [2019-10-14 23:49:48,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:48,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,073 INFO L225 Difference]: With dead ends: 498 [2019-10-14 23:49:48,074 INFO L226 Difference]: Without dead ends: 264 [2019-10-14 23:49:48,075 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-10-14 23:49:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-10-14 23:49:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-14 23:49:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 436 transitions. [2019-10-14 23:49:48,088 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 436 transitions. Word has length 89 [2019-10-14 23:49:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,089 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 436 transitions. [2019-10-14 23:49:48,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 436 transitions. [2019-10-14 23:49:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-14 23:49:48,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,092 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:48,092 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash -288738650, now seen corresponding path program 1 times [2019-10-14 23:49:48,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075048906] [2019-10-14 23:49:48,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:48,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075048906] [2019-10-14 23:49:48,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147547535] [2019-10-14 23:49:48,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,188 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,189 INFO L87 Difference]: Start difference. First operand 262 states and 436 transitions. Second operand 5 states. [2019-10-14 23:49:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,458 INFO L93 Difference]: Finished difference Result 557 states and 936 transitions. [2019-10-14 23:49:48,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:48,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-10-14 23:49:48,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,462 INFO L225 Difference]: With dead ends: 557 [2019-10-14 23:49:48,462 INFO L226 Difference]: Without dead ends: 308 [2019-10-14 23:49:48,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-14 23:49:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 304. [2019-10-14 23:49:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 510 transitions. [2019-10-14 23:49:48,478 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 510 transitions. Word has length 89 [2019-10-14 23:49:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,478 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 510 transitions. [2019-10-14 23:49:48,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 510 transitions. [2019-10-14 23:49:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:48,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,481 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:48,481 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1782320931, now seen corresponding path program 1 times [2019-10-14 23:49:48,482 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140906490] [2019-10-14 23:49:48,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:48,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140906490] [2019-10-14 23:49:48,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072200315] [2019-10-14 23:49:48,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,548 INFO L87 Difference]: Start difference. First operand 304 states and 510 transitions. Second operand 5 states. [2019-10-14 23:49:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:48,772 INFO L93 Difference]: Finished difference Result 597 states and 1005 transitions. [2019-10-14 23:49:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:48,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:48,775 INFO L225 Difference]: With dead ends: 597 [2019-10-14 23:49:48,775 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:49:48,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:49:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2019-10-14 23:49:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-14 23:49:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 506 transitions. [2019-10-14 23:49:48,789 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 506 transitions. Word has length 90 [2019-10-14 23:49:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:48,790 INFO L462 AbstractCegarLoop]: Abstraction has 304 states and 506 transitions. [2019-10-14 23:49:48,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 506 transitions. [2019-10-14 23:49:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-14 23:49:48,791 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:48,792 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:48,792 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1133000297, now seen corresponding path program 1 times [2019-10-14 23:49:48,793 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:48,793 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032891485] [2019-10-14 23:49:48,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,793 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:48,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:49:48,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032891485] [2019-10-14 23:49:48,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:48,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:48,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227026270] [2019-10-14 23:49:48,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:48,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:48,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:48,878 INFO L87 Difference]: Start difference. First operand 304 states and 506 transitions. Second operand 5 states. [2019-10-14 23:49:49,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,113 INFO L93 Difference]: Finished difference Result 599 states and 1000 transitions. [2019-10-14 23:49:49,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-10-14 23:49:49,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,116 INFO L225 Difference]: With dead ends: 599 [2019-10-14 23:49:49,116 INFO L226 Difference]: Without dead ends: 306 [2019-10-14 23:49:49,117 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:49,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-10-14 23:49:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-10-14 23:49:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-10-14 23:49:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 501 transitions. [2019-10-14 23:49:49,131 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 501 transitions. Word has length 90 [2019-10-14 23:49:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,131 INFO L462 AbstractCegarLoop]: Abstraction has 302 states and 501 transitions. [2019-10-14 23:49:49,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 501 transitions. [2019-10-14 23:49:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-14 23:49:49,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,133 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1158896476, now seen corresponding path program 1 times [2019-10-14 23:49:49,134 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604565555] [2019-10-14 23:49:49,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,135 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-14 23:49:49,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604565555] [2019-10-14 23:49:49,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884417350] [2019-10-14 23:49:49,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,192 INFO L87 Difference]: Start difference. First operand 302 states and 501 transitions. Second operand 5 states. [2019-10-14 23:49:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,400 INFO L93 Difference]: Finished difference Result 600 states and 997 transitions. [2019-10-14 23:49:49,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-14 23:49:49,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,403 INFO L225 Difference]: With dead ends: 600 [2019-10-14 23:49:49,403 INFO L226 Difference]: Without dead ends: 311 [2019-10-14 23:49:49,404 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:49,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-10-14 23:49:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2019-10-14 23:49:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-10-14 23:49:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2019-10-14 23:49:49,423 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 102 [2019-10-14 23:49:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,423 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2019-10-14 23:49:49,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2019-10-14 23:49:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-14 23:49:49,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,427 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,428 INFO L82 PathProgramCache]: Analyzing trace with hash 344707902, now seen corresponding path program 1 times [2019-10-14 23:49:49,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27187263] [2019-10-14 23:49:49,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:49,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27187263] [2019-10-14 23:49:49,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160995231] [2019-10-14 23:49:49,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,508 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand 5 states. [2019-10-14 23:49:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:49,732 INFO L93 Difference]: Finished difference Result 640 states and 1050 transitions. [2019-10-14 23:49:49,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:49,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-10-14 23:49:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:49,735 INFO L225 Difference]: With dead ends: 640 [2019-10-14 23:49:49,735 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:49,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:49,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:49,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 554 transitions. [2019-10-14 23:49:49,757 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 554 transitions. Word has length 103 [2019-10-14 23:49:49,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:49,758 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 554 transitions. [2019-10-14 23:49:49,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:49,760 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 554 transitions. [2019-10-14 23:49:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-14 23:49:49,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:49,763 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:49,763 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:49,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:49,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1538356794, now seen corresponding path program 1 times [2019-10-14 23:49:49,764 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:49,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147053025] [2019-10-14 23:49:49,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,765 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:49,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:49,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147053025] [2019-10-14 23:49:49,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:49,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:49,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828481826] [2019-10-14 23:49:49,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:49,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:49,854 INFO L87 Difference]: Start difference. First operand 340 states and 554 transitions. Second operand 5 states. [2019-10-14 23:49:50,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,054 INFO L93 Difference]: Finished difference Result 669 states and 1093 transitions. [2019-10-14 23:49:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-14 23:49:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,057 INFO L225 Difference]: With dead ends: 669 [2019-10-14 23:49:50,057 INFO L226 Difference]: Without dead ends: 342 [2019-10-14 23:49:50,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-10-14 23:49:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2019-10-14 23:49:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-10-14 23:49:50,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 550 transitions. [2019-10-14 23:49:50,072 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 550 transitions. Word has length 104 [2019-10-14 23:49:50,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,072 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 550 transitions. [2019-10-14 23:49:50,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 550 transitions. [2019-10-14 23:49:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-14 23:49:50,074 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,074 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,074 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1488538894, now seen corresponding path program 1 times [2019-10-14 23:49:50,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54721210] [2019-10-14 23:49:50,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:50,139 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54721210] [2019-10-14 23:49:50,139 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438284415] [2019-10-14 23:49:50,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,141 INFO L87 Difference]: Start difference. First operand 340 states and 550 transitions. Second operand 5 states. [2019-10-14 23:49:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,334 INFO L93 Difference]: Finished difference Result 702 states and 1143 transitions. [2019-10-14 23:49:50,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2019-10-14 23:49:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,337 INFO L225 Difference]: With dead ends: 702 [2019-10-14 23:49:50,337 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:50,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:50,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:50,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 592 transitions. [2019-10-14 23:49:50,356 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 592 transitions. Word has length 105 [2019-10-14 23:49:50,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,356 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 592 transitions. [2019-10-14 23:49:50,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 592 transitions. [2019-10-14 23:49:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:49:50,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,359 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,359 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1690820362, now seen corresponding path program 1 times [2019-10-14 23:49:50,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096931096] [2019-10-14 23:49:50,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-14 23:49:50,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096931096] [2019-10-14 23:49:50,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,430 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131163135] [2019-10-14 23:49:50,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,431 INFO L87 Difference]: Start difference. First operand 367 states and 592 transitions. Second operand 5 states. [2019-10-14 23:49:50,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,680 INFO L93 Difference]: Finished difference Result 729 states and 1180 transitions. [2019-10-14 23:49:50,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-14 23:49:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,683 INFO L225 Difference]: With dead ends: 729 [2019-10-14 23:49:50,683 INFO L226 Difference]: Without dead ends: 375 [2019-10-14 23:49:50,684 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-10-14 23:49:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2019-10-14 23:49:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-10-14 23:49:50,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 587 transitions. [2019-10-14 23:49:50,728 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 587 transitions. Word has length 106 [2019-10-14 23:49:50,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:50,728 INFO L462 AbstractCegarLoop]: Abstraction has 367 states and 587 transitions. [2019-10-14 23:49:50,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:50,729 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 587 transitions. [2019-10-14 23:49:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-14 23:49:50,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:50,730 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:50,731 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:50,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:50,731 INFO L82 PathProgramCache]: Analyzing trace with hash 478955993, now seen corresponding path program 1 times [2019-10-14 23:49:50,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:50,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140202973] [2019-10-14 23:49:50,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,732 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:50,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:50,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140202973] [2019-10-14 23:49:50,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:50,787 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:50,787 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315899204] [2019-10-14 23:49:50,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:50,788 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:50,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:50,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:50,788 INFO L87 Difference]: Start difference. First operand 367 states and 587 transitions. Second operand 5 states. [2019-10-14 23:49:50,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:50,982 INFO L93 Difference]: Finished difference Result 747 states and 1200 transitions. [2019-10-14 23:49:50,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:50,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-14 23:49:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:50,985 INFO L225 Difference]: With dead ends: 747 [2019-10-14 23:49:50,985 INFO L226 Difference]: Without dead ends: 393 [2019-10-14 23:49:50,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-14 23:49:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-14 23:49:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 616 transitions. [2019-10-14 23:49:51,006 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 616 transitions. Word has length 110 [2019-10-14 23:49:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,007 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 616 transitions. [2019-10-14 23:49:51,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 616 transitions. [2019-10-14 23:49:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-14 23:49:51,008 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,009 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,009 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1822469329, now seen corresponding path program 1 times [2019-10-14 23:49:51,010 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371434349] [2019-10-14 23:49:51,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-14 23:49:51,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371434349] [2019-10-14 23:49:51,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,059 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:49:51,059 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101608312] [2019-10-14 23:49:51,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:49:51,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:49:51,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:51,060 INFO L87 Difference]: Start difference. First operand 388 states and 616 transitions. Second operand 5 states. [2019-10-14 23:49:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,242 INFO L93 Difference]: Finished difference Result 768 states and 1223 transitions. [2019-10-14 23:49:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:51,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2019-10-14 23:49:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,245 INFO L225 Difference]: With dead ends: 768 [2019-10-14 23:49:51,245 INFO L226 Difference]: Without dead ends: 393 [2019-10-14 23:49:51,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:49:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-10-14 23:49:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 388. [2019-10-14 23:49:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 23:49:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 610 transitions. [2019-10-14 23:49:51,266 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 610 transitions. Word has length 111 [2019-10-14 23:49:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,266 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 610 transitions. [2019-10-14 23:49:51,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:49:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 610 transitions. [2019-10-14 23:49:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-14 23:49:51,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,269 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:49:51,269 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1681254182, now seen corresponding path program 1 times [2019-10-14 23:49:51,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340492341] [2019-10-14 23:49:51,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-14 23:49:51,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340492341] [2019-10-14 23:49:51,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:51,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987811289] [2019-10-14 23:49:51,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:51,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,324 INFO L87 Difference]: Start difference. First operand 388 states and 610 transitions. Second operand 3 states. [2019-10-14 23:49:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,375 INFO L93 Difference]: Finished difference Result 763 states and 1203 transitions. [2019-10-14 23:49:51,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:51,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 126 [2019-10-14 23:49:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,380 INFO L225 Difference]: With dead ends: 763 [2019-10-14 23:49:51,381 INFO L226 Difference]: Without dead ends: 761 [2019-10-14 23:49:51,382 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-10-14 23:49:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-10-14 23:49:51,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-14 23:49:51,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1201 transitions. [2019-10-14 23:49:51,417 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1201 transitions. Word has length 126 [2019-10-14 23:49:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,418 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1201 transitions. [2019-10-14 23:49:51,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1201 transitions. [2019-10-14 23:49:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:51,421 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,421 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-14 23:49:51,422 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -837527912, now seen corresponding path program 1 times [2019-10-14 23:49:51,422 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175189608] [2019-10-14 23:49:51,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,473 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-14 23:49:51,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175189608] [2019-10-14 23:49:51,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:51,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638391785] [2019-10-14 23:49:51,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:51,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:51,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,476 INFO L87 Difference]: Start difference. First operand 761 states and 1201 transitions. Second operand 3 states. [2019-10-14 23:49:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,586 INFO L93 Difference]: Finished difference Result 1877 states and 2969 transitions. [2019-10-14 23:49:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:51,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-14 23:49:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,592 INFO L225 Difference]: With dead ends: 1877 [2019-10-14 23:49:51,593 INFO L226 Difference]: Without dead ends: 1129 [2019-10-14 23:49:51,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-10-14 23:49:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2019-10-14 23:49:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1129 states. [2019-10-14 23:49:51,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1782 transitions. [2019-10-14 23:49:51,645 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1782 transitions. Word has length 127 [2019-10-14 23:49:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,645 INFO L462 AbstractCegarLoop]: Abstraction has 1129 states and 1782 transitions. [2019-10-14 23:49:51,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:51,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1782 transitions. [2019-10-14 23:49:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-14 23:49:51,648 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,649 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-14 23:49:51,649 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 551766102, now seen corresponding path program 1 times [2019-10-14 23:49:51,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120502016] [2019-10-14 23:49:51,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,686 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-14 23:49:51,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120502016] [2019-10-14 23:49:51,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:51,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289342721] [2019-10-14 23:49:51,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:51,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:51,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,689 INFO L87 Difference]: Start difference. First operand 1129 states and 1782 transitions. Second operand 3 states. [2019-10-14 23:49:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:51,769 INFO L93 Difference]: Finished difference Result 2596 states and 4102 transitions. [2019-10-14 23:49:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:51,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-14 23:49:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:51,778 INFO L225 Difference]: With dead ends: 2596 [2019-10-14 23:49:51,778 INFO L226 Difference]: Without dead ends: 1480 [2019-10-14 23:49:51,781 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-10-14 23:49:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1480. [2019-10-14 23:49:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-14 23:49:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2333 transitions. [2019-10-14 23:49:51,853 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2333 transitions. Word has length 127 [2019-10-14 23:49:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:51,853 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2333 transitions. [2019-10-14 23:49:51,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2333 transitions. [2019-10-14 23:49:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-14 23:49:51,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:51,858 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-14 23:49:51,858 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:51,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:51,859 INFO L82 PathProgramCache]: Analyzing trace with hash -923211894, now seen corresponding path program 1 times [2019-10-14 23:49:51,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:51,859 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407209771] [2019-10-14 23:49:51,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,859 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:51,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:51,909 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-14 23:49:51,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407209771] [2019-10-14 23:49:51,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:51,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:51,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357262626] [2019-10-14 23:49:51,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:51,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:51,911 INFO L87 Difference]: Start difference. First operand 1480 states and 2333 transitions. Second operand 3 states. [2019-10-14 23:49:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,110 INFO L93 Difference]: Finished difference Result 2987 states and 4697 transitions. [2019-10-14 23:49:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:52,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-14 23:49:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,119 INFO L225 Difference]: With dead ends: 2987 [2019-10-14 23:49:52,119 INFO L226 Difference]: Without dead ends: 1520 [2019-10-14 23:49:52,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:52,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-14 23:49:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1480. [2019-10-14 23:49:52,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1480 states. [2019-10-14 23:49:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2189 transitions. [2019-10-14 23:49:52,185 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2189 transitions. Word has length 164 [2019-10-14 23:49:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,185 INFO L462 AbstractCegarLoop]: Abstraction has 1480 states and 2189 transitions. [2019-10-14 23:49:52,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2189 transitions. [2019-10-14 23:49:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-14 23:49:52,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,190 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-14 23:49:52,190 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,191 INFO L82 PathProgramCache]: Analyzing trace with hash -2015847096, now seen corresponding path program 1 times [2019-10-14 23:49:52,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116439838] [2019-10-14 23:49:52,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,281 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-14 23:49:52,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116439838] [2019-10-14 23:49:52,282 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,282 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:52,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276816473] [2019-10-14 23:49:52,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:52,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:52,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:52,284 INFO L87 Difference]: Start difference. First operand 1480 states and 2189 transitions. Second operand 3 states. [2019-10-14 23:49:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:52,623 INFO L93 Difference]: Finished difference Result 3143 states and 4661 transitions. [2019-10-14 23:49:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:52,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-14 23:49:52,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:52,632 INFO L225 Difference]: With dead ends: 3143 [2019-10-14 23:49:52,633 INFO L226 Difference]: Without dead ends: 1676 [2019-10-14 23:49:52,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2019-10-14 23:49:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1560. [2019-10-14 23:49:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1560 states. [2019-10-14 23:49:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2249 transitions. [2019-10-14 23:49:52,720 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2249 transitions. Word has length 164 [2019-10-14 23:49:52,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:52,721 INFO L462 AbstractCegarLoop]: Abstraction has 1560 states and 2249 transitions. [2019-10-14 23:49:52,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2249 transitions. [2019-10-14 23:49:52,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-14 23:49:52,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:52,726 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-14 23:49:52,726 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:52,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:52,727 INFO L82 PathProgramCache]: Analyzing trace with hash 154922403, now seen corresponding path program 1 times [2019-10-14 23:49:52,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:52,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745540] [2019-10-14 23:49:52,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:52,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:52,782 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-14 23:49:52,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745540] [2019-10-14 23:49:52,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:52,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:52,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427103112] [2019-10-14 23:49:52,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:52,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:52,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:52,785 INFO L87 Difference]: Start difference. First operand 1560 states and 2249 transitions. Second operand 3 states. [2019-10-14 23:49:53,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,013 INFO L93 Difference]: Finished difference Result 3195 states and 4598 transitions. [2019-10-14 23:49:53,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:53,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-10-14 23:49:53,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,022 INFO L225 Difference]: With dead ends: 3195 [2019-10-14 23:49:53,022 INFO L226 Difference]: Without dead ends: 1648 [2019-10-14 23:49:53,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2019-10-14 23:49:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1566. [2019-10-14 23:49:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2019-10-14 23:49:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2196 transitions. [2019-10-14 23:49:53,085 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2196 transitions. Word has length 178 [2019-10-14 23:49:53,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,086 INFO L462 AbstractCegarLoop]: Abstraction has 1566 states and 2196 transitions. [2019-10-14 23:49:53,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2196 transitions. [2019-10-14 23:49:53,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-14 23:49:53,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,092 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-14 23:49:53,092 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1961792037, now seen corresponding path program 1 times [2019-10-14 23:49:53,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402244179] [2019-10-14 23:49:53,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,174 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-14 23:49:53,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402244179] [2019-10-14 23:49:53,175 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,175 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:53,175 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746502319] [2019-10-14 23:49:53,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:53,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,180 INFO L87 Difference]: Start difference. First operand 1566 states and 2196 transitions. Second operand 3 states. [2019-10-14 23:49:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,413 INFO L93 Difference]: Finished difference Result 3198 states and 4473 transitions. [2019-10-14 23:49:53,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:53,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-10-14 23:49:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,424 INFO L225 Difference]: With dead ends: 3198 [2019-10-14 23:49:53,424 INFO L226 Difference]: Without dead ends: 1651 [2019-10-14 23:49:53,429 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-10-14 23:49:53,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-10-14 23:49:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-10-14 23:49:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2280 transitions. [2019-10-14 23:49:53,516 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2280 transitions. Word has length 194 [2019-10-14 23:49:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,516 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 2280 transitions. [2019-10-14 23:49:53,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2280 transitions. [2019-10-14 23:49:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-14 23:49:53,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,526 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-14 23:49:53,526 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1023005408, now seen corresponding path program 1 times [2019-10-14 23:49:53,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490547654] [2019-10-14 23:49:53,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,619 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-14 23:49:53,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490547654] [2019-10-14 23:49:53,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:53,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558323193] [2019-10-14 23:49:53,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:53,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:53,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,622 INFO L87 Difference]: Start difference. First operand 1635 states and 2280 transitions. Second operand 3 states. [2019-10-14 23:49:53,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:53,804 INFO L93 Difference]: Finished difference Result 3403 states and 4750 transitions. [2019-10-14 23:49:53,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:53,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2019-10-14 23:49:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:53,814 INFO L225 Difference]: With dead ends: 3403 [2019-10-14 23:49:53,814 INFO L226 Difference]: Without dead ends: 1787 [2019-10-14 23:49:53,818 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2019-10-14 23:49:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1735. [2019-10-14 23:49:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-14 23:49:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2400 transitions. [2019-10-14 23:49:53,888 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2400 transitions. Word has length 215 [2019-10-14 23:49:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:53,888 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2400 transitions. [2019-10-14 23:49:53,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2400 transitions. [2019-10-14 23:49:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-14 23:49:53,895 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:53,896 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-14 23:49:53,896 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1880660095, now seen corresponding path program 1 times [2019-10-14 23:49:53,897 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:53,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910825727] [2019-10-14 23:49:53,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:53,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:53,962 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-14 23:49:53,962 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910825727] [2019-10-14 23:49:53,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:53,963 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:53,963 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577960859] [2019-10-14 23:49:53,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:53,964 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:53,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:53,964 INFO L87 Difference]: Start difference. First operand 1735 states and 2400 transitions. Second operand 3 states. [2019-10-14 23:49:54,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,227 INFO L93 Difference]: Finished difference Result 3531 states and 4878 transitions. [2019-10-14 23:49:54,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-10-14 23:49:54,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,238 INFO L225 Difference]: With dead ends: 3531 [2019-10-14 23:49:54,238 INFO L226 Difference]: Without dead ends: 1815 [2019-10-14 23:49:54,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2019-10-14 23:49:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1735. [2019-10-14 23:49:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-14 23:49:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2392 transitions. [2019-10-14 23:49:54,336 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2392 transitions. Word has length 218 [2019-10-14 23:49:54,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,337 INFO L462 AbstractCegarLoop]: Abstraction has 1735 states and 2392 transitions. [2019-10-14 23:49:54,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2392 transitions. [2019-10-14 23:49:54,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-14 23:49:54,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,345 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-14 23:49:54,346 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1809038977, now seen corresponding path program 1 times [2019-10-14 23:49:54,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110518830] [2019-10-14 23:49:54,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,442 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-14 23:49:54,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110518830] [2019-10-14 23:49:54,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227308956] [2019-10-14 23:49:54,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,445 INFO L87 Difference]: Start difference. First operand 1735 states and 2392 transitions. Second operand 3 states. [2019-10-14 23:49:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:54,663 INFO L93 Difference]: Finished difference Result 3647 states and 5050 transitions. [2019-10-14 23:49:54,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:54,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-10-14 23:49:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:54,674 INFO L225 Difference]: With dead ends: 3647 [2019-10-14 23:49:54,675 INFO L226 Difference]: Without dead ends: 1831 [2019-10-14 23:49:54,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2019-10-14 23:49:54,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1791. [2019-10-14 23:49:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-14 23:49:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2436 transitions. [2019-10-14 23:49:54,755 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2436 transitions. Word has length 239 [2019-10-14 23:49:54,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:54,755 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2436 transitions. [2019-10-14 23:49:54,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2436 transitions. [2019-10-14 23:49:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-14 23:49:54,762 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:54,762 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-14 23:49:54,762 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:54,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -940069451, now seen corresponding path program 1 times [2019-10-14 23:49:54,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:54,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277337865] [2019-10-14 23:49:54,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:54,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:54,844 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-14 23:49:54,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277337865] [2019-10-14 23:49:54,845 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:54,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:54,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486745736] [2019-10-14 23:49:54,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:54,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:54,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:54,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:54,847 INFO L87 Difference]: Start difference. First operand 1791 states and 2436 transitions. Second operand 3 states. [2019-10-14 23:49:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,080 INFO L93 Difference]: Finished difference Result 3595 states and 4898 transitions. [2019-10-14 23:49:55,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:55,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-10-14 23:49:55,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,089 INFO L225 Difference]: With dead ends: 3595 [2019-10-14 23:49:55,089 INFO L226 Difference]: Without dead ends: 1823 [2019-10-14 23:49:55,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:55,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1823 states. [2019-10-14 23:49:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1823 to 1791. [2019-10-14 23:49:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1791 states. [2019-10-14 23:49:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2416 transitions. [2019-10-14 23:49:55,164 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2416 transitions. Word has length 241 [2019-10-14 23:49:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,164 INFO L462 AbstractCegarLoop]: Abstraction has 1791 states and 2416 transitions. [2019-10-14 23:49:55,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:55,165 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2416 transitions. [2019-10-14 23:49:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-14 23:49:55,170 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,171 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-14 23:49:55,171 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash -275540929, now seen corresponding path program 1 times [2019-10-14 23:49:55,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:55,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456725702] [2019-10-14 23:49:55,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:55,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,262 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-14 23:49:55,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456725702] [2019-10-14 23:49:55,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877730091] [2019-10-14 23:49:55,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:55,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-14 23:49:55,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:55,516 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-14 23:49:55,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:55,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:55,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966435443] [2019-10-14 23:49:55,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:55,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:55,523 INFO L87 Difference]: Start difference. First operand 1791 states and 2416 transitions. Second operand 3 states. [2019-10-14 23:49:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:55,687 INFO L93 Difference]: Finished difference Result 3585 states and 4844 transitions. [2019-10-14 23:49:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:55,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-14 23:49:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:55,697 INFO L225 Difference]: With dead ends: 3585 [2019-10-14 23:49:55,697 INFO L226 Difference]: Without dead ends: 2246 [2019-10-14 23:49:55,701 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-14 23:49:55,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2246 states. [2019-10-14 23:49:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2246 to 2246. [2019-10-14 23:49:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-10-14 23:49:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 3031 transitions. [2019-10-14 23:49:55,807 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 3031 transitions. Word has length 251 [2019-10-14 23:49:55,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:55,807 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 3031 transitions. [2019-10-14 23:49:55,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 3031 transitions. [2019-10-14 23:49:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-14 23:49:55,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:55,815 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-14 23:49:56,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:56,030 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:56,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:56,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1797967949, now seen corresponding path program 1 times [2019-10-14 23:49:56,030 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:56,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296913743] [2019-10-14 23:49:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:56,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,220 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-14 23:49:56,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296913743] [2019-10-14 23:49:56,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448647746] [2019-10-14 23:49:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:56,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:56,453 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-14 23:49:56,453 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:49:56,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:49:56,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144496024] [2019-10-14 23:49:56,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:49:56,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:49:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:49:56,456 INFO L87 Difference]: Start difference. First operand 2246 states and 3031 transitions. Second operand 4 states. [2019-10-14 23:49:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,061 INFO L93 Difference]: Finished difference Result 7160 states and 9675 transitions. [2019-10-14 23:49:57,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:49:57,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2019-10-14 23:49:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,097 INFO L225 Difference]: With dead ends: 7160 [2019-10-14 23:49:57,097 INFO L226 Difference]: Without dead ends: 4933 [2019-10-14 23:49:57,103 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-14 23:49:57,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4933 states. [2019-10-14 23:49:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4933 to 2791. [2019-10-14 23:49:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-10-14 23:49:57,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 3681 transitions. [2019-10-14 23:49:57,245 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 3681 transitions. Word has length 258 [2019-10-14 23:49:57,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:57,246 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 3681 transitions. [2019-10-14 23:49:57,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:49:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 3681 transitions. [2019-10-14 23:49:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-14 23:49:57,255 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:57,255 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-14 23:49:57,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:57,461 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:57,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1509148559, now seen corresponding path program 1 times [2019-10-14 23:49:57,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:57,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26446149] [2019-10-14 23:49:57,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:57,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:57,643 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-14 23:49:57,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26446149] [2019-10-14 23:49:57,644 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:57,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:57,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394524734] [2019-10-14 23:49:57,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:57,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:57,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:57,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:57,646 INFO L87 Difference]: Start difference. First operand 2791 states and 3681 transitions. Second operand 3 states. [2019-10-14 23:49:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:57,826 INFO L93 Difference]: Finished difference Result 7820 states and 10371 transitions. [2019-10-14 23:49:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:57,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 258 [2019-10-14 23:49:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:57,839 INFO L225 Difference]: With dead ends: 7820 [2019-10-14 23:49:57,839 INFO L226 Difference]: Without dead ends: 5048 [2019-10-14 23:49:57,847 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5048 states. [2019-10-14 23:49:58,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5048 to 5046. [2019-10-14 23:49:58,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2019-10-14 23:49:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 6701 transitions. [2019-10-14 23:49:58,043 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 6701 transitions. Word has length 258 [2019-10-14 23:49:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,043 INFO L462 AbstractCegarLoop]: Abstraction has 5046 states and 6701 transitions. [2019-10-14 23:49:58,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 6701 transitions. [2019-10-14 23:49:58,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-14 23:49:58,054 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,055 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-14 23:49:58,055 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -718445864, now seen corresponding path program 1 times [2019-10-14 23:49:58,055 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897700695] [2019-10-14 23:49:58,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,130 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-14 23:49:58,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897700695] [2019-10-14 23:49:58,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:49:58,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:49:58,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965186436] [2019-10-14 23:49:58,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:58,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:58,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:58,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:58,134 INFO L87 Difference]: Start difference. First operand 5046 states and 6701 transitions. Second operand 3 states. [2019-10-14 23:49:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:58,483 INFO L93 Difference]: Finished difference Result 10199 states and 13538 transitions. [2019-10-14 23:49:58,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:58,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 261 [2019-10-14 23:49:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:58,496 INFO L225 Difference]: With dead ends: 10199 [2019-10-14 23:49:58,497 INFO L226 Difference]: Without dead ends: 5172 [2019-10-14 23:49:58,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:49:58,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5172 states. [2019-10-14 23:49:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5172 to 5047. [2019-10-14 23:49:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-14 23:49:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6617 transitions. [2019-10-14 23:49:58,746 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6617 transitions. Word has length 261 [2019-10-14 23:49:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:58,747 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6617 transitions. [2019-10-14 23:49:58,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6617 transitions. [2019-10-14 23:49:58,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-10-14 23:49:58,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:58,758 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-14 23:49:58,758 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:49:58,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:49:58,758 INFO L82 PathProgramCache]: Analyzing trace with hash -571590843, now seen corresponding path program 1 times [2019-10-14 23:49:58,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:49:58,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610226470] [2019-10-14 23:49:58,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:49:58,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:49:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,857 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-14 23:49:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610226470] [2019-10-14 23:49:58,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176824417] [2019-10-14 23:49:58,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:49:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:49:58,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:49:58,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:49:59,098 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-14 23:49:59,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:49:59,099 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:49:59,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685945048] [2019-10-14 23:49:59,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:49:59,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:49:59,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:49:59,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:49:59,107 INFO L87 Difference]: Start difference. First operand 5047 states and 6617 transitions. Second operand 3 states. [2019-10-14 23:49:59,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:49:59,499 INFO L93 Difference]: Finished difference Result 10094 states and 13226 transitions. [2019-10-14 23:49:59,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:49:59,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 287 [2019-10-14 23:49:59,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:49:59,516 INFO L225 Difference]: With dead ends: 10094 [2019-10-14 23:49:59,517 INFO L226 Difference]: Without dead ends: 5067 [2019-10-14 23:49:59,532 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-14 23:49:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2019-10-14 23:49:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 5047. [2019-10-14 23:49:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-14 23:49:59,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6607 transitions. [2019-10-14 23:49:59,840 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6607 transitions. Word has length 287 [2019-10-14 23:49:59,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:49:59,841 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6607 transitions. [2019-10-14 23:49:59,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:49:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6607 transitions. [2019-10-14 23:49:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-14 23:49:59,858 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:49:59,859 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-14 23:50:00,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:00,066 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:00,067 INFO L82 PathProgramCache]: Analyzing trace with hash 232140181, now seen corresponding path program 1 times [2019-10-14 23:50:00,070 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:00,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818235095] [2019-10-14 23:50:00,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:00,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,350 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-14 23:50:00,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818235095] [2019-10-14 23:50:00,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804789575] [2019-10-14 23:50:00,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:00,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:00,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:00,523 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-14 23:50:00,524 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:00,524 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:00,524 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410174443] [2019-10-14 23:50:00,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:00,525 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:00,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:00,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,525 INFO L87 Difference]: Start difference. First operand 5047 states and 6607 transitions. Second operand 3 states. [2019-10-14 23:50:00,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:00,791 INFO L93 Difference]: Finished difference Result 10074 states and 13186 transitions. [2019-10-14 23:50:00,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:00,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-10-14 23:50:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:00,802 INFO L225 Difference]: With dead ends: 10074 [2019-10-14 23:50:00,802 INFO L226 Difference]: Without dead ends: 5047 [2019-10-14 23:50:00,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5047 states. [2019-10-14 23:50:00,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5047 to 5047. [2019-10-14 23:50:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5047 states. [2019-10-14 23:50:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5047 states to 5047 states and 6597 transitions. [2019-10-14 23:50:00,988 INFO L78 Accepts]: Start accepts. Automaton has 5047 states and 6597 transitions. Word has length 288 [2019-10-14 23:50:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 5047 states and 6597 transitions. [2019-10-14 23:50:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5047 states and 6597 transitions. [2019-10-14 23:50:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-14 23:50:00,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:00,999 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-14 23:50:01,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:01,210 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:01,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2074361303, now seen corresponding path program 1 times [2019-10-14 23:50:01,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:01,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302692858] [2019-10-14 23:50:01,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:01,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,482 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-14 23:50:01,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302692858] [2019-10-14 23:50:01,483 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456247755] [2019-10-14 23:50:01,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:01,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:01,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:01,674 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-14 23:50:01,675 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:01,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:01,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730735027] [2019-10-14 23:50:01,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:01,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:01,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:01,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:01,677 INFO L87 Difference]: Start difference. First operand 5047 states and 6597 transitions. Second operand 4 states. [2019-10-14 23:50:02,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:02,228 INFO L93 Difference]: Finished difference Result 11856 states and 15438 transitions. [2019-10-14 23:50:02,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:02,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 288 [2019-10-14 23:50:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:02,248 INFO L225 Difference]: With dead ends: 11856 [2019-10-14 23:50:02,249 INFO L226 Difference]: Without dead ends: 6763 [2019-10-14 23:50:02,262 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-14 23:50:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2019-10-14 23:50:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 4456. [2019-10-14 23:50:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4456 states. [2019-10-14 23:50:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4456 states to 4456 states and 5756 transitions. [2019-10-14 23:50:02,486 INFO L78 Accepts]: Start accepts. Automaton has 4456 states and 5756 transitions. Word has length 288 [2019-10-14 23:50:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:02,486 INFO L462 AbstractCegarLoop]: Abstraction has 4456 states and 5756 transitions. [2019-10-14 23:50:02,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4456 states and 5756 transitions. [2019-10-14 23:50:02,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-10-14 23:50:02,497 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:02,498 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-14 23:50:02,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:02,704 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:02,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:02,704 INFO L82 PathProgramCache]: Analyzing trace with hash 924837848, now seen corresponding path program 1 times [2019-10-14 23:50:02,704 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:02,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458336389] [2019-10-14 23:50:02,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:02,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:02,804 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-14 23:50:02,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458336389] [2019-10-14 23:50:02,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:02,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:02,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524085335] [2019-10-14 23:50:02,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:02,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:02,808 INFO L87 Difference]: Start difference. First operand 4456 states and 5756 transitions. Second operand 3 states. [2019-10-14 23:50:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,037 INFO L93 Difference]: Finished difference Result 7492 states and 9566 transitions. [2019-10-14 23:50:03,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 326 [2019-10-14 23:50:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,086 INFO L225 Difference]: With dead ends: 7492 [2019-10-14 23:50:03,086 INFO L226 Difference]: Without dead ends: 2273 [2019-10-14 23:50:03,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-10-14 23:50:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2273. [2019-10-14 23:50:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-10-14 23:50:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2893 transitions. [2019-10-14 23:50:03,176 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2893 transitions. Word has length 326 [2019-10-14 23:50:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,176 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 2893 transitions. [2019-10-14 23:50:03,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2893 transitions. [2019-10-14 23:50:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-10-14 23:50:03,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,182 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-14 23:50:03,183 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 4925057, now seen corresponding path program 1 times [2019-10-14 23:50:03,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715481534] [2019-10-14 23:50:03,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,307 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-14 23:50:03,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715481534] [2019-10-14 23:50:03,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:03,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:03,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212364013] [2019-10-14 23:50:03,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:03,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:03,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,309 INFO L87 Difference]: Start difference. First operand 2273 states and 2893 transitions. Second operand 3 states. [2019-10-14 23:50:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:03,493 INFO L93 Difference]: Finished difference Result 4511 states and 5729 transitions. [2019-10-14 23:50:03,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:03,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2019-10-14 23:50:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:03,499 INFO L225 Difference]: With dead ends: 4511 [2019-10-14 23:50:03,499 INFO L226 Difference]: Without dead ends: 2283 [2019-10-14 23:50:03,503 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:03,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2283 states. [2019-10-14 23:50:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2283 to 2273. [2019-10-14 23:50:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2273 states. [2019-10-14 23:50:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 2868 transitions. [2019-10-14 23:50:03,585 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 2868 transitions. Word has length 365 [2019-10-14 23:50:03,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:03,586 INFO L462 AbstractCegarLoop]: Abstraction has 2273 states and 2868 transitions. [2019-10-14 23:50:03,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 2868 transitions. [2019-10-14 23:50:03,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-10-14 23:50:03,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:03,594 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-14 23:50:03,595 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:03,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:03,595 INFO L82 PathProgramCache]: Analyzing trace with hash 85240782, now seen corresponding path program 1 times [2019-10-14 23:50:03,595 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:03,595 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047193308] [2019-10-14 23:50:03,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,596 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:03,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,740 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-14 23:50:03,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047193308] [2019-10-14 23:50:03,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689462459] [2019-10-14 23:50:03,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:03,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:03,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:04,017 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-14 23:50:04,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:50:04,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-10-14 23:50:04,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421262085] [2019-10-14 23:50:04,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:04,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:04,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:50:04,019 INFO L87 Difference]: Start difference. First operand 2273 states and 2868 transitions. Second operand 3 states. [2019-10-14 23:50:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:04,098 INFO L93 Difference]: Finished difference Result 2892 states and 3673 transitions. [2019-10-14 23:50:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:04,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 398 [2019-10-14 23:50:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:04,105 INFO L225 Difference]: With dead ends: 2892 [2019-10-14 23:50:04,105 INFO L226 Difference]: Without dead ends: 2800 [2019-10-14 23:50:04,106 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-14 23:50:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2800 states. [2019-10-14 23:50:04,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2800 to 2183. [2019-10-14 23:50:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2183 states. [2019-10-14 23:50:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2183 states to 2183 states and 2767 transitions. [2019-10-14 23:50:04,188 INFO L78 Accepts]: Start accepts. Automaton has 2183 states and 2767 transitions. Word has length 398 [2019-10-14 23:50:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:04,188 INFO L462 AbstractCegarLoop]: Abstraction has 2183 states and 2767 transitions. [2019-10-14 23:50:04,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2183 states and 2767 transitions. [2019-10-14 23:50:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2019-10-14 23:50:04,196 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:04,197 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-14 23:50:04,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:04,403 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:04,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:04,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1661102763, now seen corresponding path program 1 times [2019-10-14 23:50:04,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:04,404 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675971068] [2019-10-14 23:50:04,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,404 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:04,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,637 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-14 23:50:04,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675971068] [2019-10-14 23:50:04,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238718308] [2019-10-14 23:50:04,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:04,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 881 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:04,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:05,010 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-14 23:50:05,010 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:05,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:05,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655827147] [2019-10-14 23:50:05,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:05,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:05,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:05,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:05,013 INFO L87 Difference]: Start difference. First operand 2183 states and 2767 transitions. Second operand 4 states. [2019-10-14 23:50:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:05,402 INFO L93 Difference]: Finished difference Result 5269 states and 6675 transitions. [2019-10-14 23:50:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:50:05,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 538 [2019-10-14 23:50:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:05,410 INFO L225 Difference]: With dead ends: 5269 [2019-10-14 23:50:05,410 INFO L226 Difference]: Without dead ends: 3089 [2019-10-14 23:50:05,415 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-14 23:50:05,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3089 states. [2019-10-14 23:50:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3089 to 2243. [2019-10-14 23:50:05,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-10-14 23:50:05,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 2847 transitions. [2019-10-14 23:50:05,501 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 2847 transitions. Word has length 538 [2019-10-14 23:50:05,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:05,502 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 2847 transitions. [2019-10-14 23:50:05,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 2847 transitions. [2019-10-14 23:50:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-10-14 23:50:05,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:05,511 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-14 23:50:05,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:05,723 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1238623897, now seen corresponding path program 1 times [2019-10-14 23:50:05,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:05,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170691194] [2019-10-14 23:50:05,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:05,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,043 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-14 23:50:06,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170691194] [2019-10-14 23:50:06,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:06,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224053776] [2019-10-14 23:50:06,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:06,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:06,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:06,046 INFO L87 Difference]: Start difference. First operand 2243 states and 2847 transitions. Second operand 3 states. [2019-10-14 23:50:06,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:06,314 INFO L93 Difference]: Finished difference Result 4621 states and 5867 transitions. [2019-10-14 23:50:06,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:06,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 600 [2019-10-14 23:50:06,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:06,323 INFO L225 Difference]: With dead ends: 4621 [2019-10-14 23:50:06,323 INFO L226 Difference]: Without dead ends: 2423 [2019-10-14 23:50:06,328 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-10-14 23:50:06,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2413. [2019-10-14 23:50:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2413 states. [2019-10-14 23:50:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2413 states to 2413 states and 3042 transitions. [2019-10-14 23:50:06,462 INFO L78 Accepts]: Start accepts. Automaton has 2413 states and 3042 transitions. Word has length 600 [2019-10-14 23:50:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:06,463 INFO L462 AbstractCegarLoop]: Abstraction has 2413 states and 3042 transitions. [2019-10-14 23:50:06,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2413 states and 3042 transitions. [2019-10-14 23:50:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2019-10-14 23:50:06,478 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:06,479 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-14 23:50:06,479 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:06,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1437228011, now seen corresponding path program 1 times [2019-10-14 23:50:06,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:06,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750615289] [2019-10-14 23:50:06,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:06,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:06,844 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-14 23:50:06,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750615289] [2019-10-14 23:50:06,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:50:06,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:50:06,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698985948] [2019-10-14 23:50:06,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:50:06,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:06,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:50:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:06,847 INFO L87 Difference]: Start difference. First operand 2413 states and 3042 transitions. Second operand 3 states. [2019-10-14 23:50:07,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:07,040 INFO L93 Difference]: Finished difference Result 4778 states and 6009 transitions. [2019-10-14 23:50:07,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:50:07,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 662 [2019-10-14 23:50:07,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:07,043 INFO L225 Difference]: With dead ends: 4778 [2019-10-14 23:50:07,043 INFO L226 Difference]: Without dead ends: 2410 [2019-10-14 23:50:07,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:50:07,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2019-10-14 23:50:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2408. [2019-10-14 23:50:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2408 states. [2019-10-14 23:50:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 2987 transitions. [2019-10-14 23:50:07,171 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 2987 transitions. Word has length 662 [2019-10-14 23:50:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:07,172 INFO L462 AbstractCegarLoop]: Abstraction has 2408 states and 2987 transitions. [2019-10-14 23:50:07,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:50:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 2987 transitions. [2019-10-14 23:50:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 729 [2019-10-14 23:50:07,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:50:07,184 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-14 23:50:07,184 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:50:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:50:07,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1078284281, now seen corresponding path program 1 times [2019-10-14 23:50:07,185 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:50:07,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148458685] [2019-10-14 23:50:07,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:50:07,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:50:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,568 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-14 23:50:07,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148458685] [2019-10-14 23:50:07,568 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60290322] [2019-10-14 23:50:07,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 23:50:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:50:07,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:50:07,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:50:08,043 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-14 23:50:08,044 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:50:08,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-14 23:50:08,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141501028] [2019-10-14 23:50:08,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:50:08,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:50:08,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:50:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:50:08,046 INFO L87 Difference]: Start difference. First operand 2408 states and 2987 transitions. Second operand 4 states. [2019-10-14 23:50:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:50:08,331 INFO L93 Difference]: Finished difference Result 4118 states and 5143 transitions. [2019-10-14 23:50:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:50:08,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 728 [2019-10-14 23:50:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:50:08,333 INFO L225 Difference]: With dead ends: 4118 [2019-10-14 23:50:08,333 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:50:08,339 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-14 23:50:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:50:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:50:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:50:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:50:08,340 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 728 [2019-10-14 23:50:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:50:08,341 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:50:08,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:50:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:50:08,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:50:08,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:50:08,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:50:08,699 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 122 [2019-10-14 23:50:08,971 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 120 [2019-10-14 23:50:09,318 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 119 [2019-10-14 23:50:10,706 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 464 DAG size of output: 250 [2019-10-14 23:50:11,585 WARN L191 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 465 DAG size of output: 256 [2019-10-14 23:50:12,084 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 141 [2019-10-14 23:50:12,958 WARN L191 SmtUtils]: Spent 830.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 58 [2019-10-14 23:50:13,694 WARN L191 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-10-14 23:50:14,492 WARN L191 SmtUtils]: Spent 796.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 68 [2019-10-14 23:50:15,196 WARN L191 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 53 [2019-10-14 23:50:15,803 WARN L191 SmtUtils]: Spent 605.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57