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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:27:24,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:27:24,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:27:24,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:27:24,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:27:24,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:27:24,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:27:24,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:27:24,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:27:24,878 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:27:24,879 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:27:24,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:27:24,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:27:24,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:27:24,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:27:24,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:27:24,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:27:24,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:27:24,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:27:24,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:27:24,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:27:24,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:27:24,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:27:24,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:27:24,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:27:24,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:27:24,898 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:27:24,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:27:24,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:27:24,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:27:24,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:27:24,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:27:24,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:27:24,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:27:24,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:27:24,905 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:27:24,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:27:24,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:27:24,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:27:24,907 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:27:24,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:27:24,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:27:24,925 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:27:24,925 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:27:24,925 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:27:24,926 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:27:24,926 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:27:24,926 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:27:24,927 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:27:24,927 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:27:24,927 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:27:24,927 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:27:24,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:27:24,928 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:27:24,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:27:24,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:27:24,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:27:24,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:27:24,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:27:24,930 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:27:24,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:27:24,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:27:24,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:27:24,931 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:27:24,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:27:24,931 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:27:24,932 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:27:24,932 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:27:24,932 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:27:24,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:27:24,933 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:27:24,933 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:27:24,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:27:25,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:27:25,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:27:25,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:27:25,011 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:27:25,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c [2019-09-20 13:27:25,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68e00e0c/9178909e67cc4ac68c1598dfe181daf8/FLAG8acceeb74 [2019-09-20 13:27:25,662 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:27:25,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ssh/s3_srvr.blast.08.i.cil-1.c [2019-09-20 13:27:25,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68e00e0c/9178909e67cc4ac68c1598dfe181daf8/FLAG8acceeb74 [2019-09-20 13:27:25,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e68e00e0c/9178909e67cc4ac68c1598dfe181daf8 [2019-09-20 13:27:25,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:27:25,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:27:25,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:25,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:27:25,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:27:25,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:25" (1/1) ... [2019-09-20 13:27:25,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79f2e4ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:25, skipping insertion in model container [2019-09-20 13:27:25,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:27:25" (1/1) ... [2019-09-20 13:27:25,978 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:27:26,055 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:27:26,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:26,671 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:27:26,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:27:26,828 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:27:26,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26 WrapperNode [2019-09-20 13:27:26,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:27:26,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:27:26,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:27:26,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:27:26,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (1/1) ... [2019-09-20 13:27:26,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:27:26,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:27:26,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:27:26,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:27:26,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (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-09-20 13:27:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:27:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:27:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_get_server_method [2019-09-20 13:27:27,075 INFO L138 BoogieDeclarations]: Found implementation of procedure SSLv3_server_method [2019-09-20 13:27:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:27:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2019-09-20 13:27:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure sslv3_base_method [2019-09-20 13:27:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-20 13:27:27,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-20 13:27:27,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:27:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:27:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-20 13:27:27,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:27:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:27:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:27:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-20 13:27:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure SSLv3_server_method [2019-09-20 13:27:27,078 INFO L130 BoogieDeclarations]: Found specification of procedure sslv3_base_method [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_get_server_method [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:27:27,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-20 13:27:27,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:27:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:27:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:27:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:27:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:27:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-20 13:27:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-20 13:27:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-20 13:27:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-20 13:27:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:27:27,720 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:27:28,387 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-09-20 13:27:28,388 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-09-20 13:27:28,410 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:27:28,411 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 13:27:28,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:28 BoogieIcfgContainer [2019-09-20 13:27:28,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:27:28,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:27:28,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:27:28,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:27:28,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:27:25" (1/3) ... [2019-09-20 13:27:28,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e203527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:28, skipping insertion in model container [2019-09-20 13:27:28,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:27:26" (2/3) ... [2019-09-20 13:27:28,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e203527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:27:28, skipping insertion in model container [2019-09-20 13:27:28,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:27:28" (3/3) ... [2019-09-20 13:27:28,422 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08.i.cil-1.c [2019-09-20 13:27:28,431 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:27:28,442 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:27:28,458 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:27:28,491 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:27:28,492 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:27:28,492 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:27:28,492 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:27:28,492 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:27:28,492 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:27:28,492 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:27:28,493 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:27:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2019-09-20 13:27:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-20 13:27:28,523 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:28,524 INFO L407 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-09-20 13:27:28,526 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:28,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:28,531 INFO L82 PathProgramCache]: Analyzing trace with hash 2110190190, now seen corresponding path program 1 times [2019-09-20 13:27:28,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:28,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:28,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:28,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:28,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:28,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:28,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:28,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:28,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:28,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:28,968 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 4 states. [2019-09-20 13:27:29,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,365 INFO L93 Difference]: Finished difference Result 191 states and 312 transitions. [2019-09-20 13:27:29,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-09-20 13:27:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,380 INFO L225 Difference]: With dead ends: 191 [2019-09-20 13:27:29,380 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:27:29,382 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:27:29,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2019-09-20 13:27:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-20 13:27:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 234 transitions. [2019-09-20 13:27:29,434 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 234 transitions. Word has length 49 [2019-09-20 13:27:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,434 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 234 transitions. [2019-09-20 13:27:29,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 234 transitions. [2019-09-20 13:27:29,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-20 13:27:29,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,438 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:27:29,438 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1494873476, now seen corresponding path program 1 times [2019-09-20 13:27:29,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,443 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:29,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:29,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:29,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:29,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:29,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:29,559 INFO L87 Difference]: Start difference. First operand 153 states and 234 transitions. Second operand 4 states. [2019-09-20 13:27:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:29,916 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2019-09-20 13:27:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:29,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-09-20 13:27:29,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:29,921 INFO L225 Difference]: With dead ends: 170 [2019-09-20 13:27:29,921 INFO L226 Difference]: Without dead ends: 170 [2019-09-20 13:27:29,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-09-20 13:27:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 153. [2019-09-20 13:27:29,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-20 13:27:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 233 transitions. [2019-09-20 13:27:29,955 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 233 transitions. Word has length 62 [2019-09-20 13:27:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:29,962 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 233 transitions. [2019-09-20 13:27:29,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 233 transitions. [2019-09-20 13:27:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:29,969 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:29,969 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:29,969 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:29,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:29,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1779153132, now seen corresponding path program 1 times [2019-09-20 13:27:29,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:29,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:29,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:29,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:30,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:30,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:30,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:30,131 INFO L87 Difference]: Start difference. First operand 153 states and 233 transitions. Second operand 4 states. [2019-09-20 13:27:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:30,444 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2019-09-20 13:27:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:30,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:30,447 INFO L225 Difference]: With dead ends: 169 [2019-09-20 13:27:30,447 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:27:30,447 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:27:30,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 153. [2019-09-20 13:27:30,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-20 13:27:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2019-09-20 13:27:30,459 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 63 [2019-09-20 13:27:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:30,460 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2019-09-20 13:27:30,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2019-09-20 13:27:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:30,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:30,463 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:30,463 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -628910720, now seen corresponding path program 1 times [2019-09-20 13:27:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:30,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:30,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:30,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:30,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:27:30,581 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:30,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:27:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:27:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:30,582 INFO L87 Difference]: Start difference. First operand 153 states and 232 transitions. Second operand 5 states. [2019-09-20 13:27:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,040 INFO L93 Difference]: Finished difference Result 174 states and 260 transitions. [2019-09-20 13:27:31,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:27:31,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-20 13:27:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,045 INFO L225 Difference]: With dead ends: 174 [2019-09-20 13:27:31,046 INFO L226 Difference]: Without dead ends: 174 [2019-09-20 13:27:31,046 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:27:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-20 13:27:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-20 13:27:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2019-09-20 13:27:31,070 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 63 [2019-09-20 13:27:31,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,073 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2019-09-20 13:27:31,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:27:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2019-09-20 13:27:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:31,081 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,081 INFO L407 BasicCegarLoop]: trace histogram [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-09-20 13:27:31,082 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash 553656120, now seen corresponding path program 1 times [2019-09-20 13:27:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:31,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,201 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand 4 states. [2019-09-20 13:27:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,494 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-09-20 13:27:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,496 INFO L225 Difference]: With dead ends: 188 [2019-09-20 13:27:31,496 INFO L226 Difference]: Without dead ends: 188 [2019-09-20 13:27:31,497 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-09-20 13:27:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 173. [2019-09-20 13:27:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2019-09-20 13:27:31,505 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 63 [2019-09-20 13:27:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,506 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2019-09-20 13:27:31,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2019-09-20 13:27:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-20 13:27:31,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,508 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:27:31,508 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,508 INFO L82 PathProgramCache]: Analyzing trace with hash 486096119, now seen corresponding path program 1 times [2019-09-20 13:27:31,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:31,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,583 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 4 states. [2019-09-20 13:27:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:31,812 INFO L93 Difference]: Finished difference Result 186 states and 273 transitions. [2019-09-20 13:27:31,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:31,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-09-20 13:27:31,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:31,814 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:27:31,814 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:27:31,814 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:27:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-20 13:27:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 257 transitions. [2019-09-20 13:27:31,821 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 257 transitions. Word has length 63 [2019-09-20 13:27:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:31,821 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 257 transitions. [2019-09-20 13:27:31,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 257 transitions. [2019-09-20 13:27:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-20 13:27:31,823 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:31,823 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:31,823 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:31,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash 163370881, now seen corresponding path program 1 times [2019-09-20 13:27:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:31,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:31,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:31,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:31,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:31,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:31,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:31,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:31,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:31,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:31,883 INFO L87 Difference]: Start difference. First operand 173 states and 257 transitions. Second operand 4 states. [2019-09-20 13:27:32,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,145 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2019-09-20 13:27:32,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-09-20 13:27:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,147 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:27:32,148 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:27:32,148 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:27:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-20 13:27:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2019-09-20 13:27:32,153 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 64 [2019-09-20 13:27:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,154 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2019-09-20 13:27:32,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2019-09-20 13:27:32,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-20 13:27:32,155 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,156 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,156 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1804750988, now seen corresponding path program 1 times [2019-09-20 13:27:32,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:32,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,207 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,208 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand 4 states. [2019-09-20 13:27:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,479 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2019-09-20 13:27:32,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-09-20 13:27:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,480 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:27:32,481 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:27:32,481 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:27:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-20 13:27:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 255 transitions. [2019-09-20 13:27:32,489 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 255 transitions. Word has length 65 [2019-09-20 13:27:32,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,490 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 255 transitions. [2019-09-20 13:27:32,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 255 transitions. [2019-09-20 13:27:32,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:32,491 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,491 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:32,493 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2134048964, now seen corresponding path program 1 times [2019-09-20 13:27:32,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:32,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,571 INFO L87 Difference]: Start difference. First operand 173 states and 255 transitions. Second operand 4 states. [2019-09-20 13:27:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:32,802 INFO L93 Difference]: Finished difference Result 186 states and 270 transitions. [2019-09-20 13:27:32,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:32,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:32,805 INFO L225 Difference]: With dead ends: 186 [2019-09-20 13:27:32,805 INFO L226 Difference]: Without dead ends: 186 [2019-09-20 13:27:32,806 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-20 13:27:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2019-09-20 13:27:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-20 13:27:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2019-09-20 13:27:32,812 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 66 [2019-09-20 13:27:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:32,812 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2019-09-20 13:27:32,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2019-09-20 13:27:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-20 13:27:32,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:32,813 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:27:32,814 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1942820251, now seen corresponding path program 1 times [2019-09-20 13:27:32,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:32,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:32,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:32,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:32,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:32,869 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:32,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:32,870 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand 4 states. [2019-09-20 13:27:33,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,146 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2019-09-20 13:27:33,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-09-20 13:27:33,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,147 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:27:33,147 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:27:33,148 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:27:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-09-20 13:27:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 291 transitions. [2019-09-20 13:27:33,154 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 291 transitions. Word has length 66 [2019-09-20 13:27:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,154 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 291 transitions. [2019-09-20 13:27:33,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,155 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 291 transitions. [2019-09-20 13:27:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-20 13:27:33,156 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,156 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,156 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1095553487, now seen corresponding path program 1 times [2019-09-20 13:27:33,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,233 INFO L87 Difference]: Start difference. First operand 195 states and 291 transitions. Second operand 4 states. [2019-09-20 13:27:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,459 INFO L93 Difference]: Finished difference Result 198 states and 294 transitions. [2019-09-20 13:27:33,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-09-20 13:27:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,462 INFO L225 Difference]: With dead ends: 198 [2019-09-20 13:27:33,462 INFO L226 Difference]: Without dead ends: 198 [2019-09-20 13:27:33,463 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-20 13:27:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2019-09-20 13:27:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 290 transitions. [2019-09-20 13:27:33,469 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 290 transitions. Word has length 67 [2019-09-20 13:27:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,470 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 290 transitions. [2019-09-20 13:27:33,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 290 transitions. [2019-09-20 13:27:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-20 13:27:33,471 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,471 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,471 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash -480173193, now seen corresponding path program 1 times [2019-09-20 13:27:33,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:33,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,537 INFO L87 Difference]: Start difference. First operand 195 states and 290 transitions. Second operand 4 states. [2019-09-20 13:27:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:33,803 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2019-09-20 13:27:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:33,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-20 13:27:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:33,805 INFO L225 Difference]: With dead ends: 215 [2019-09-20 13:27:33,805 INFO L226 Difference]: Without dead ends: 215 [2019-09-20 13:27:33,805 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-20 13:27:33,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 195. [2019-09-20 13:27:33,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:33,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 289 transitions. [2019-09-20 13:27:33,811 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 289 transitions. Word has length 79 [2019-09-20 13:27:33,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:33,812 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 289 transitions. [2019-09-20 13:27:33,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 289 transitions. [2019-09-20 13:27:33,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:33,813 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:33,814 INFO L407 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:33,814 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -543248475, now seen corresponding path program 1 times [2019-09-20 13:27:33,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:33,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:33,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:33,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:33,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:33,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:33,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:33,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:33,889 INFO L87 Difference]: Start difference. First operand 195 states and 289 transitions. Second operand 4 states. [2019-09-20 13:27:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,180 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2019-09-20 13:27:34,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,183 INFO L225 Difference]: With dead ends: 214 [2019-09-20 13:27:34,183 INFO L226 Difference]: Without dead ends: 214 [2019-09-20 13:27:34,184 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-20 13:27:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 195. [2019-09-20 13:27:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2019-09-20 13:27:34,189 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 288 transitions. Word has length 80 [2019-09-20 13:27:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,189 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 288 transitions. [2019-09-20 13:27:34,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2019-09-20 13:27:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-20 13:27:34,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,191 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,191 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -610808476, now seen corresponding path program 1 times [2019-09-20 13:27:34,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,269 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,270 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand 4 states. [2019-09-20 13:27:34,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,545 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2019-09-20 13:27:34,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-09-20 13:27:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,547 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:34,547 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:34,548 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:34,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:34,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-20 13:27:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 287 transitions. [2019-09-20 13:27:34,553 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 287 transitions. Word has length 80 [2019-09-20 13:27:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,553 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 287 transitions. [2019-09-20 13:27:34,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 287 transitions. [2019-09-20 13:27:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-20 13:27:34,555 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,555 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-20 13:27:34,555 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 519066804, now seen corresponding path program 1 times [2019-09-20 13:27:34,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:34,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:34,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:34,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:34,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:34,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:34,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,634 INFO L87 Difference]: Start difference. First operand 195 states and 287 transitions. Second operand 4 states. [2019-09-20 13:27:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:34,957 INFO L93 Difference]: Finished difference Result 212 states and 308 transitions. [2019-09-20 13:27:34,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:34,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-09-20 13:27:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:34,960 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:34,960 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:34,961 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:34,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-20 13:27:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 286 transitions. [2019-09-20 13:27:34,974 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 286 transitions. Word has length 81 [2019-09-20 13:27:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:34,975 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 286 transitions. [2019-09-20 13:27:34,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 286 transitions. [2019-09-20 13:27:34,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-20 13:27:34,977 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:34,977 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:34,978 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:34,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:34,978 INFO L82 PathProgramCache]: Analyzing trace with hash 631888033, now seen corresponding path program 1 times [2019-09-20 13:27:34,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:34,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:34,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:34,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,092 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:35,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,096 INFO L87 Difference]: Start difference. First operand 195 states and 286 transitions. Second operand 4 states. [2019-09-20 13:27:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,517 INFO L93 Difference]: Finished difference Result 212 states and 307 transitions. [2019-09-20 13:27:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-09-20 13:27:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,519 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:35,519 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:35,520 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:35,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-20 13:27:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:35,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 285 transitions. [2019-09-20 13:27:35,525 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 285 transitions. Word has length 82 [2019-09-20 13:27:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,526 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 285 transitions. [2019-09-20 13:27:35,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 285 transitions. [2019-09-20 13:27:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-20 13:27:35,527 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,527 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-20 13:27:35,527 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,528 INFO L82 PathProgramCache]: Analyzing trace with hash 387316655, now seen corresponding path program 1 times [2019-09-20 13:27:35,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,587 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,588 INFO L87 Difference]: Start difference. First operand 195 states and 285 transitions. Second operand 4 states. [2019-09-20 13:27:35,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:35,863 INFO L93 Difference]: Finished difference Result 212 states and 306 transitions. [2019-09-20 13:27:35,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:35,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-20 13:27:35,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:35,865 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:27:35,865 INFO L226 Difference]: Without dead ends: 212 [2019-09-20 13:27:35,866 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-09-20 13:27:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 195. [2019-09-20 13:27:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2019-09-20 13:27:35,871 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 83 [2019-09-20 13:27:35,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:35,872 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2019-09-20 13:27:35,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2019-09-20 13:27:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-20 13:27:35,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:35,873 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:35,873 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:35,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:35,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1948476348, now seen corresponding path program 1 times [2019-09-20 13:27:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:35,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:35,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:27:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:35,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:35,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:35,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:35,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:35,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:35,967 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand 4 states. [2019-09-20 13:27:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,239 INFO L93 Difference]: Finished difference Result 202 states and 293 transitions. [2019-09-20 13:27:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2019-09-20 13:27:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,242 INFO L225 Difference]: With dead ends: 202 [2019-09-20 13:27:36,242 INFO L226 Difference]: Without dead ends: 202 [2019-09-20 13:27:36,242 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-20 13:27:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195. [2019-09-20 13:27:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-20 13:27:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 283 transitions. [2019-09-20 13:27:36,249 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 283 transitions. Word has length 84 [2019-09-20 13:27:36,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,250 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 283 transitions. [2019-09-20 13:27:36,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,250 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 283 transitions. [2019-09-20 13:27:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:27:36,251 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,252 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,252 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1002887916, now seen corresponding path program 1 times [2019-09-20 13:27:36,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,365 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,366 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,369 INFO L87 Difference]: Start difference. First operand 195 states and 283 transitions. Second operand 4 states. [2019-09-20 13:27:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:36,760 INFO L93 Difference]: Finished difference Result 302 states and 446 transitions. [2019-09-20 13:27:36,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:27:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:36,764 INFO L225 Difference]: With dead ends: 302 [2019-09-20 13:27:36,764 INFO L226 Difference]: Without dead ends: 302 [2019-09-20 13:27:36,765 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-09-20 13:27:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 236. [2019-09-20 13:27:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-09-20 13:27:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 356 transitions. [2019-09-20 13:27:36,775 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 356 transitions. Word has length 88 [2019-09-20 13:27:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:36,776 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 356 transitions. [2019-09-20 13:27:36,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 356 transitions. [2019-09-20 13:27:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-20 13:27:36,778 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:36,778 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:36,778 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash -579241194, now seen corresponding path program 1 times [2019-09-20 13:27:36,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:36,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:36,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:36,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:36,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:36,894 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:36,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:36,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:36,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:36,895 INFO L87 Difference]: Start difference. First operand 236 states and 356 transitions. Second operand 4 states. [2019-09-20 13:27:37,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,196 INFO L93 Difference]: Finished difference Result 284 states and 427 transitions. [2019-09-20 13:27:37,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-20 13:27:37,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,199 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:37,199 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:37,199 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2019-09-20 13:27:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-20 13:27:37,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2019-09-20 13:27:37,207 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 88 [2019-09-20 13:27:37,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,207 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2019-09-20 13:27:37,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,207 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2019-09-20 13:27:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-20 13:27:37,209 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,209 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,209 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1319252016, now seen corresponding path program 1 times [2019-09-20 13:27:37,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,300 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,301 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand 4 states. [2019-09-20 13:27:37,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:37,737 INFO L93 Difference]: Finished difference Result 318 states and 475 transitions. [2019-09-20 13:27:37,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:37,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-20 13:27:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:37,740 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:27:37,740 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:27:37,741 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:27:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2019-09-20 13:27:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 398 transitions. [2019-09-20 13:27:37,748 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 398 transitions. Word has length 89 [2019-09-20 13:27:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:37,749 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 398 transitions. [2019-09-20 13:27:37,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 398 transitions. [2019-09-20 13:27:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:37,751 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:37,751 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:37,751 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1662632094, now seen corresponding path program 1 times [2019-09-20 13:27:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:37,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:37,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:37,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:37,846 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:37,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:37,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:37,847 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:37,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:37,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:37,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:37,848 INFO L87 Difference]: Start difference. First operand 261 states and 398 transitions. Second operand 4 states. [2019-09-20 13:27:38,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,241 INFO L93 Difference]: Finished difference Result 318 states and 474 transitions. [2019-09-20 13:27:38,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:38,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,243 INFO L225 Difference]: With dead ends: 318 [2019-09-20 13:27:38,243 INFO L226 Difference]: Without dead ends: 318 [2019-09-20 13:27:38,244 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-09-20 13:27:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 261. [2019-09-20 13:27:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 397 transitions. [2019-09-20 13:27:38,251 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 397 transitions. Word has length 101 [2019-09-20 13:27:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,251 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 397 transitions. [2019-09-20 13:27:38,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 397 transitions. [2019-09-20 13:27:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-20 13:27:38,253 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,253 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,253 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1756316196, now seen corresponding path program 1 times [2019-09-20 13:27:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,314 INFO L87 Difference]: Start difference. First operand 261 states and 397 transitions. Second operand 4 states. [2019-09-20 13:27:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:38,598 INFO L93 Difference]: Finished difference Result 285 states and 426 transitions. [2019-09-20 13:27:38,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:38,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-09-20 13:27:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:38,604 INFO L225 Difference]: With dead ends: 285 [2019-09-20 13:27:38,604 INFO L226 Difference]: Without dead ends: 285 [2019-09-20 13:27:38,605 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-20 13:27:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 261. [2019-09-20 13:27:38,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 396 transitions. [2019-09-20 13:27:38,611 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 396 transitions. Word has length 101 [2019-09-20 13:27:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:38,611 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 396 transitions. [2019-09-20 13:27:38,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 396 transitions. [2019-09-20 13:27:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:38,613 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:38,613 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:38,613 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1459205982, now seen corresponding path program 1 times [2019-09-20 13:27:38,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:38,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:38,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:38,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:38,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:38,701 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:38,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:38,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:38,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:38,702 INFO L87 Difference]: Start difference. First operand 261 states and 396 transitions. Second operand 4 states. [2019-09-20 13:27:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,159 INFO L93 Difference]: Finished difference Result 317 states and 471 transitions. [2019-09-20 13:27:39,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,162 INFO L225 Difference]: With dead ends: 317 [2019-09-20 13:27:39,162 INFO L226 Difference]: Without dead ends: 317 [2019-09-20 13:27:39,163 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-20 13:27:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 261. [2019-09-20 13:27:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:39,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 395 transitions. [2019-09-20 13:27:39,170 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 395 transitions. Word has length 102 [2019-09-20 13:27:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,170 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 395 transitions. [2019-09-20 13:27:39,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 395 transitions. [2019-09-20 13:27:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:39,172 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,172 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,172 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1391645981, now seen corresponding path program 1 times [2019-09-20 13:27:39,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,237 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:39,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,239 INFO L87 Difference]: Start difference. First operand 261 states and 395 transitions. Second operand 4 states. [2019-09-20 13:27:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:39,668 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2019-09-20 13:27:39,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:39,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:39,670 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:27:39,671 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:27:39,671 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:39,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:27:39,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-20 13:27:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 394 transitions. [2019-09-20 13:27:39,677 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 394 transitions. Word has length 102 [2019-09-20 13:27:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:39,677 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 394 transitions. [2019-09-20 13:27:39,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 394 transitions. [2019-09-20 13:27:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:39,700 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:39,700 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:39,700 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:39,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:39,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1448975904, now seen corresponding path program 1 times [2019-09-20 13:27:39,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:39,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:39,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:39,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:39,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:39,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:39,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:39,763 INFO L87 Difference]: Start difference. First operand 261 states and 394 transitions. Second operand 4 states. [2019-09-20 13:27:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,047 INFO L93 Difference]: Finished difference Result 284 states and 422 transitions. [2019-09-20 13:27:40,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:40,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,049 INFO L225 Difference]: With dead ends: 284 [2019-09-20 13:27:40,049 INFO L226 Difference]: Without dead ends: 284 [2019-09-20 13:27:40,050 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-09-20 13:27:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 261. [2019-09-20 13:27:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 393 transitions. [2019-09-20 13:27:40,056 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 393 transitions. Word has length 102 [2019-09-20 13:27:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,057 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 393 transitions. [2019-09-20 13:27:40,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 393 transitions. [2019-09-20 13:27:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-20 13:27:40,058 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,059 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,059 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1516535905, now seen corresponding path program 1 times [2019-09-20 13:27:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:40,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,146 INFO L87 Difference]: Start difference. First operand 261 states and 393 transitions. Second operand 4 states. [2019-09-20 13:27:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,483 INFO L93 Difference]: Finished difference Result 282 states and 419 transitions. [2019-09-20 13:27:40,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-09-20 13:27:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,486 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:40,486 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:40,486 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-20 13:27:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 392 transitions. [2019-09-20 13:27:40,492 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 392 transitions. Word has length 102 [2019-09-20 13:27:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,493 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 392 transitions. [2019-09-20 13:27:40,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 392 transitions. [2019-09-20 13:27:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:40,494 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,495 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,495 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1829354469, now seen corresponding path program 1 times [2019-09-20 13:27:40,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:40,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,546 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,547 INFO L87 Difference]: Start difference. First operand 261 states and 392 transitions. Second operand 4 states. [2019-09-20 13:27:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:40,914 INFO L93 Difference]: Finished difference Result 315 states and 465 transitions. [2019-09-20 13:27:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:40,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:40,917 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:27:40,917 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:27:40,918 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:27:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-20 13:27:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 391 transitions. [2019-09-20 13:27:40,924 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 391 transitions. Word has length 103 [2019-09-20 13:27:40,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:40,924 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 391 transitions. [2019-09-20 13:27:40,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 391 transitions. [2019-09-20 13:27:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-20 13:27:40,926 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:40,926 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:40,926 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:40,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1788679719, now seen corresponding path program 1 times [2019-09-20 13:27:40,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:40,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:40,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:40,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:40,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:40,981 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:40,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:40,982 INFO L87 Difference]: Start difference. First operand 261 states and 391 transitions. Second operand 4 states. [2019-09-20 13:27:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,251 INFO L93 Difference]: Finished difference Result 282 states and 417 transitions. [2019-09-20 13:27:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-09-20 13:27:41,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,253 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:41,253 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:41,254 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:41,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-20 13:27:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:41,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 390 transitions. [2019-09-20 13:27:41,260 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 390 transitions. Word has length 103 [2019-09-20 13:27:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,260 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 390 transitions. [2019-09-20 13:27:41,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 390 transitions. [2019-09-20 13:27:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:41,261 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,261 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,262 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,262 INFO L82 PathProgramCache]: Analyzing trace with hash 845272602, now seen corresponding path program 1 times [2019-09-20 13:27:41,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:41,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,319 INFO L87 Difference]: Start difference. First operand 261 states and 390 transitions. Second operand 4 states. [2019-09-20 13:27:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:41,697 INFO L93 Difference]: Finished difference Result 315 states and 463 transitions. [2019-09-20 13:27:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:41,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:41,700 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:27:41,700 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:27:41,701 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:41,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:27:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-20 13:27:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 389 transitions. [2019-09-20 13:27:41,707 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 389 transitions. Word has length 104 [2019-09-20 13:27:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:41,708 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 389 transitions. [2019-09-20 13:27:41,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 389 transitions. [2019-09-20 13:27:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-20 13:27:41,709 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:41,709 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:41,710 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:41,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2106189852, now seen corresponding path program 1 times [2019-09-20 13:27:41,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:41,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:41,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:41,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:41,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:41,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:41,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:41,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:41,792 INFO L87 Difference]: Start difference. First operand 261 states and 389 transitions. Second operand 4 states. [2019-09-20 13:27:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,051 INFO L93 Difference]: Finished difference Result 282 states and 415 transitions. [2019-09-20 13:27:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-09-20 13:27:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,054 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:42,055 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:42,055 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:42,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-20 13:27:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 388 transitions. [2019-09-20 13:27:42,060 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 388 transitions. Word has length 104 [2019-09-20 13:27:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,061 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 388 transitions. [2019-09-20 13:27:42,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 388 transitions. [2019-09-20 13:27:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:42,062 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,062 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,062 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1587696298, now seen corresponding path program 1 times [2019-09-20 13:27:42,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,130 INFO L87 Difference]: Start difference. First operand 261 states and 388 transitions. Second operand 4 states. [2019-09-20 13:27:42,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,489 INFO L93 Difference]: Finished difference Result 315 states and 461 transitions. [2019-09-20 13:27:42,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:42,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,491 INFO L225 Difference]: With dead ends: 315 [2019-09-20 13:27:42,491 INFO L226 Difference]: Without dead ends: 315 [2019-09-20 13:27:42,491 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-20 13:27:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 261. [2019-09-20 13:27:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 387 transitions. [2019-09-20 13:27:42,496 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 387 transitions. Word has length 105 [2019-09-20 13:27:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,497 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 387 transitions. [2019-09-20 13:27:42,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 387 transitions. [2019-09-20 13:27:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-20 13:27:42,498 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,498 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,498 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1153967212, now seen corresponding path program 1 times [2019-09-20 13:27:42,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:42,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,561 INFO L87 Difference]: Start difference. First operand 261 states and 387 transitions. Second operand 4 states. [2019-09-20 13:27:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:42,817 INFO L93 Difference]: Finished difference Result 282 states and 413 transitions. [2019-09-20 13:27:42,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:42,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-20 13:27:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:42,820 INFO L225 Difference]: With dead ends: 282 [2019-09-20 13:27:42,820 INFO L226 Difference]: Without dead ends: 282 [2019-09-20 13:27:42,821 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-20 13:27:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 261. [2019-09-20 13:27:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 386 transitions. [2019-09-20 13:27:42,826 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 386 transitions. Word has length 105 [2019-09-20 13:27:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:42,826 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 386 transitions. [2019-09-20 13:27:42,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 386 transitions. [2019-09-20 13:27:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:42,828 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:42,828 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:42,828 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:42,828 INFO L82 PathProgramCache]: Analyzing trace with hash 852616949, now seen corresponding path program 1 times [2019-09-20 13:27:42,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:42,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:42,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:42,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:42,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:42,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:42,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:42,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:42,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:42,896 INFO L87 Difference]: Start difference. First operand 261 states and 386 transitions. Second operand 4 states. [2019-09-20 13:27:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,238 INFO L93 Difference]: Finished difference Result 305 states and 447 transitions. [2019-09-20 13:27:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,240 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:43,241 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:43,241 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 261. [2019-09-20 13:27:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:43,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 385 transitions. [2019-09-20 13:27:43,246 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 385 transitions. Word has length 106 [2019-09-20 13:27:43,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,247 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 385 transitions. [2019-09-20 13:27:43,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 385 transitions. [2019-09-20 13:27:43,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:27:43,248 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,248 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,248 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1413316727, now seen corresponding path program 1 times [2019-09-20 13:27:43,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:43,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,303 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,304 INFO L87 Difference]: Start difference. First operand 261 states and 385 transitions. Second operand 4 states. [2019-09-20 13:27:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:43,533 INFO L93 Difference]: Finished difference Result 272 states and 399 transitions. [2019-09-20 13:27:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:43,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-09-20 13:27:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:43,535 INFO L225 Difference]: With dead ends: 272 [2019-09-20 13:27:43,535 INFO L226 Difference]: Without dead ends: 272 [2019-09-20 13:27:43,536 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-09-20 13:27:43,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 261. [2019-09-20 13:27:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2019-09-20 13:27:43,541 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 106 [2019-09-20 13:27:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:43,541 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2019-09-20 13:27:43,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2019-09-20 13:27:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:27:43,542 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:43,543 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:43,571 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:43,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1368313697, now seen corresponding path program 1 times [2019-09-20 13:27:43,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:43,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:43,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:43,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-20 13:27:43,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:43,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:43,643 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:43,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:43,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:43,644 INFO L87 Difference]: Start difference. First operand 261 states and 384 transitions. Second operand 4 states. [2019-09-20 13:27:44,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,012 INFO L93 Difference]: Finished difference Result 305 states and 445 transitions. [2019-09-20 13:27:44,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-20 13:27:44,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,014 INFO L225 Difference]: With dead ends: 305 [2019-09-20 13:27:44,014 INFO L226 Difference]: Without dead ends: 305 [2019-09-20 13:27:44,015 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:44,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-20 13:27:44,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 261. [2019-09-20 13:27:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-09-20 13:27:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 383 transitions. [2019-09-20 13:27:44,020 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 383 transitions. Word has length 110 [2019-09-20 13:27:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,020 INFO L475 AbstractCegarLoop]: Abstraction has 261 states and 383 transitions. [2019-09-20 13:27:44,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 383 transitions. [2019-09-20 13:27:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:27:44,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,022 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:44,022 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash 950917091, now seen corresponding path program 1 times [2019-09-20 13:27:44,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,128 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-20 13:27:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:44,129 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:44,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:44,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:44,130 INFO L87 Difference]: Start difference. First operand 261 states and 383 transitions. Second operand 3 states. [2019-09-20 13:27:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,174 INFO L93 Difference]: Finished difference Result 495 states and 729 transitions. [2019-09-20 13:27:44,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:44,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2019-09-20 13:27:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,179 INFO L225 Difference]: With dead ends: 495 [2019-09-20 13:27:44,179 INFO L226 Difference]: Without dead ends: 495 [2019-09-20 13:27:44,179 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:27:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-09-20 13:27:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2019-09-20 13:27:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-20 13:27:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 729 transitions. [2019-09-20 13:27:44,187 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 729 transitions. Word has length 110 [2019-09-20 13:27:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,188 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 729 transitions. [2019-09-20 13:27:44,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 729 transitions. [2019-09-20 13:27:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:27:44,189 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,190 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:27:44,190 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,190 INFO L82 PathProgramCache]: Analyzing trace with hash -450757812, now seen corresponding path program 1 times [2019-09-20 13:27:44,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,264 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:44,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,266 INFO L87 Difference]: Start difference. First operand 495 states and 729 transitions. Second operand 4 states. [2019-09-20 13:27:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:44,668 INFO L93 Difference]: Finished difference Result 703 states and 1044 transitions. [2019-09-20 13:27:44,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:44,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-20 13:27:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:44,673 INFO L225 Difference]: With dead ends: 703 [2019-09-20 13:27:44,673 INFO L226 Difference]: Without dead ends: 703 [2019-09-20 13:27:44,674 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:44,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-09-20 13:27:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 573. [2019-09-20 13:27:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-09-20 13:27:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 871 transitions. [2019-09-20 13:27:44,683 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 871 transitions. Word has length 129 [2019-09-20 13:27:44,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:44,683 INFO L475 AbstractCegarLoop]: Abstraction has 573 states and 871 transitions. [2019-09-20 13:27:44,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 871 transitions. [2019-09-20 13:27:44,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-20 13:27:44,685 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:44,685 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 13:27:44,686 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:44,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1255416056, now seen corresponding path program 1 times [2019-09-20 13:27:44,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:44,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:44,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:44,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:44,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:44,760 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:44,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:44,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:44,761 INFO L87 Difference]: Start difference. First operand 573 states and 871 transitions. Second operand 4 states. [2019-09-20 13:27:45,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,171 INFO L93 Difference]: Finished difference Result 689 states and 1024 transitions. [2019-09-20 13:27:45,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-20 13:27:45,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,174 INFO L225 Difference]: With dead ends: 689 [2019-09-20 13:27:45,174 INFO L226 Difference]: Without dead ends: 689 [2019-09-20 13:27:45,175 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-20 13:27:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 543. [2019-09-20 13:27:45,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 813 transitions. [2019-09-20 13:27:45,185 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 813 transitions. Word has length 130 [2019-09-20 13:27:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,185 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 813 transitions. [2019-09-20 13:27:45,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 813 transitions. [2019-09-20 13:27:45,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-20 13:27:45,187 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,187 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,188 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash -901724826, now seen corresponding path program 1 times [2019-09-20 13:27:45,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:45,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,262 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,264 INFO L87 Difference]: Start difference. First operand 543 states and 813 transitions. Second operand 4 states. [2019-09-20 13:27:45,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:45,771 INFO L93 Difference]: Finished difference Result 689 states and 1022 transitions. [2019-09-20 13:27:45,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:45,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-09-20 13:27:45,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:45,775 INFO L225 Difference]: With dead ends: 689 [2019-09-20 13:27:45,775 INFO L226 Difference]: Without dead ends: 689 [2019-09-20 13:27:45,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:45,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-09-20 13:27:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 543. [2019-09-20 13:27:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:45,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 811 transitions. [2019-09-20 13:27:45,789 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 811 transitions. Word has length 142 [2019-09-20 13:27:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:45,789 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 811 transitions. [2019-09-20 13:27:45,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 811 transitions. [2019-09-20 13:27:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:27:45,792 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:45,792 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:45,792 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -726447210, now seen corresponding path program 1 times [2019-09-20 13:27:45,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:45,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:45,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:45,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:45,884 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:45,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:45,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:45,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:45,885 INFO L87 Difference]: Start difference. First operand 543 states and 811 transitions. Second operand 4 states. [2019-09-20 13:27:46,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,325 INFO L93 Difference]: Finished difference Result 687 states and 1018 transitions. [2019-09-20 13:27:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:27:46,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,331 INFO L225 Difference]: With dead ends: 687 [2019-09-20 13:27:46,331 INFO L226 Difference]: Without dead ends: 687 [2019-09-20 13:27:46,331 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:46,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-09-20 13:27:46,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 543. [2019-09-20 13:27:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:46,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 809 transitions. [2019-09-20 13:27:46,340 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 809 transitions. Word has length 143 [2019-09-20 13:27:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,340 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 809 transitions. [2019-09-20 13:27:46,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,341 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 809 transitions. [2019-09-20 13:27:46,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-20 13:27:46,342 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,342 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,343 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,343 INFO L82 PathProgramCache]: Analyzing trace with hash -794007211, now seen corresponding path program 1 times [2019-09-20 13:27:46,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:46,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,411 INFO L87 Difference]: Start difference. First operand 543 states and 809 transitions. Second operand 4 states. [2019-09-20 13:27:46,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:46,795 INFO L93 Difference]: Finished difference Result 683 states and 1012 transitions. [2019-09-20 13:27:46,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:46,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-20 13:27:46,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:46,799 INFO L225 Difference]: With dead ends: 683 [2019-09-20 13:27:46,799 INFO L226 Difference]: Without dead ends: 683 [2019-09-20 13:27:46,800 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:46,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-20 13:27:46,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-20 13:27:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 807 transitions. [2019-09-20 13:27:46,809 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 807 transitions. Word has length 143 [2019-09-20 13:27:46,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:46,809 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 807 transitions. [2019-09-20 13:27:46,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:46,810 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 807 transitions. [2019-09-20 13:27:46,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-20 13:27:46,811 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:46,812 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:46,812 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:46,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:46,812 INFO L82 PathProgramCache]: Analyzing trace with hash -865126685, now seen corresponding path program 1 times [2019-09-20 13:27:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:46,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:46,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:46,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:46,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:46,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:46,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:46,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:46,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:46,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:46,887 INFO L87 Difference]: Start difference. First operand 543 states and 807 transitions. Second operand 4 states. [2019-09-20 13:27:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,292 INFO L93 Difference]: Finished difference Result 683 states and 1010 transitions. [2019-09-20 13:27:47,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-09-20 13:27:47,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,296 INFO L225 Difference]: With dead ends: 683 [2019-09-20 13:27:47,296 INFO L226 Difference]: Without dead ends: 683 [2019-09-20 13:27:47,297 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-20 13:27:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-20 13:27:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 805 transitions. [2019-09-20 13:27:47,305 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 805 transitions. Word has length 144 [2019-09-20 13:27:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,305 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 805 transitions. [2019-09-20 13:27:47,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 805 transitions. [2019-09-20 13:27:47,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-20 13:27:47,307 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,307 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,308 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,308 INFO L82 PathProgramCache]: Analyzing trace with hash 671562834, now seen corresponding path program 1 times [2019-09-20 13:27:47,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:47,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,386 INFO L87 Difference]: Start difference. First operand 543 states and 805 transitions. Second operand 4 states. [2019-09-20 13:27:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:47,773 INFO L93 Difference]: Finished difference Result 683 states and 1008 transitions. [2019-09-20 13:27:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:47,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-20 13:27:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:47,778 INFO L225 Difference]: With dead ends: 683 [2019-09-20 13:27:47,778 INFO L226 Difference]: Without dead ends: 683 [2019-09-20 13:27:47,778 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-20 13:27:47,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-20 13:27:47,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:47,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 803 transitions. [2019-09-20 13:27:47,787 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 803 transitions. Word has length 145 [2019-09-20 13:27:47,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:47,787 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 803 transitions. [2019-09-20 13:27:47,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:47,787 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 803 transitions. [2019-09-20 13:27:47,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-20 13:27:47,789 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:47,789 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:47,789 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:47,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1617235486, now seen corresponding path program 1 times [2019-09-20 13:27:47,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:47,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:47,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:47,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:47,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:47,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:47,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:47,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:47,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:47,893 INFO L87 Difference]: Start difference. First operand 543 states and 803 transitions. Second operand 4 states. [2019-09-20 13:27:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,285 INFO L93 Difference]: Finished difference Result 683 states and 1006 transitions. [2019-09-20 13:27:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-09-20 13:27:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,289 INFO L225 Difference]: With dead ends: 683 [2019-09-20 13:27:48,289 INFO L226 Difference]: Without dead ends: 683 [2019-09-20 13:27:48,289 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-09-20 13:27:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 543. [2019-09-20 13:27:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 801 transitions. [2019-09-20 13:27:48,296 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 801 transitions. Word has length 146 [2019-09-20 13:27:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,296 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 801 transitions. [2019-09-20 13:27:48,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 801 transitions. [2019-09-20 13:27:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-20 13:27:48,297 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,298 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:48,298 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1421254445, now seen corresponding path program 1 times [2019-09-20 13:27:48,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:48,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,372 INFO L87 Difference]: Start difference. First operand 543 states and 801 transitions. Second operand 4 states. [2019-09-20 13:27:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:48,735 INFO L93 Difference]: Finished difference Result 663 states and 980 transitions. [2019-09-20 13:27:48,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:48,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-09-20 13:27:48,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:48,740 INFO L225 Difference]: With dead ends: 663 [2019-09-20 13:27:48,740 INFO L226 Difference]: Without dead ends: 663 [2019-09-20 13:27:48,740 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-20 13:27:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 543. [2019-09-20 13:27:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-09-20 13:27:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 799 transitions. [2019-09-20 13:27:48,748 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 799 transitions. Word has length 147 [2019-09-20 13:27:48,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:48,748 INFO L475 AbstractCegarLoop]: Abstraction has 543 states and 799 transitions. [2019-09-20 13:27:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 799 transitions. [2019-09-20 13:27:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-20 13:27:48,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:48,750 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-09-20 13:27:48,751 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:48,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:48,751 INFO L82 PathProgramCache]: Analyzing trace with hash 91007897, now seen corresponding path program 1 times [2019-09-20 13:27:48,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:48,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:48,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:48,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:48,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:48,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:48,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:48,819 INFO L87 Difference]: Start difference. First operand 543 states and 799 transitions. Second operand 4 states. [2019-09-20 13:27:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,203 INFO L93 Difference]: Finished difference Result 663 states and 978 transitions. [2019-09-20 13:27:49,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-20 13:27:49,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,209 INFO L225 Difference]: With dead ends: 663 [2019-09-20 13:27:49,209 INFO L226 Difference]: Without dead ends: 663 [2019-09-20 13:27:49,210 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:49,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-09-20 13:27:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 495. [2019-09-20 13:27:49,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-09-20 13:27:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 729 transitions. [2019-09-20 13:27:49,218 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 729 transitions. Word has length 151 [2019-09-20 13:27:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,218 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 729 transitions. [2019-09-20 13:27:49,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 729 transitions. [2019-09-20 13:27:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-20 13:27:49,220 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,220 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,220 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash -357566710, now seen corresponding path program 1 times [2019-09-20 13:27:49,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,293 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,294 INFO L87 Difference]: Start difference. First operand 495 states and 729 transitions. Second operand 4 states. [2019-09-20 13:27:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:49,656 INFO L93 Difference]: Finished difference Result 655 states and 966 transitions. [2019-09-20 13:27:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:49,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-09-20 13:27:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:49,661 INFO L225 Difference]: With dead ends: 655 [2019-09-20 13:27:49,661 INFO L226 Difference]: Without dead ends: 655 [2019-09-20 13:27:49,662 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:49,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-20 13:27:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 545. [2019-09-20 13:27:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-20 13:27:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 799 transitions. [2019-09-20 13:27:49,669 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 799 transitions. Word has length 152 [2019-09-20 13:27:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:49,670 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 799 transitions. [2019-09-20 13:27:49,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 799 transitions. [2019-09-20 13:27:49,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-20 13:27:49,671 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:49,672 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:49,672 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash 2085165897, now seen corresponding path program 1 times [2019-09-20 13:27:49,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:49,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:49,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:49,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:49,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:49,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:49,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:49,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:49,754 INFO L87 Difference]: Start difference. First operand 545 states and 799 transitions. Second operand 4 states. [2019-09-20 13:27:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,145 INFO L93 Difference]: Finished difference Result 655 states and 964 transitions. [2019-09-20 13:27:50,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-09-20 13:27:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,150 INFO L225 Difference]: With dead ends: 655 [2019-09-20 13:27:50,150 INFO L226 Difference]: Without dead ends: 655 [2019-09-20 13:27:50,150 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:50,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-09-20 13:27:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 551. [2019-09-20 13:27:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2019-09-20 13:27:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 809 transitions. [2019-09-20 13:27:50,158 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 809 transitions. Word has length 154 [2019-09-20 13:27:50,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,158 INFO L475 AbstractCegarLoop]: Abstraction has 551 states and 809 transitions. [2019-09-20 13:27:50,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 809 transitions. [2019-09-20 13:27:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-20 13:27:50,160 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,160 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:50,160 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2123080456, now seen corresponding path program 1 times [2019-09-20 13:27:50,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,230 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:50,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,231 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,234 INFO L87 Difference]: Start difference. First operand 551 states and 809 transitions. Second operand 4 states. [2019-09-20 13:27:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:50,608 INFO L93 Difference]: Finished difference Result 639 states and 936 transitions. [2019-09-20 13:27:50,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:50,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-20 13:27:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:50,613 INFO L225 Difference]: With dead ends: 639 [2019-09-20 13:27:50,613 INFO L226 Difference]: Without dead ends: 639 [2019-09-20 13:27:50,614 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:50,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-20 13:27:50,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 553. [2019-09-20 13:27:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2019-09-20 13:27:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 811 transitions. [2019-09-20 13:27:50,623 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 811 transitions. Word has length 155 [2019-09-20 13:27:50,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:50,624 INFO L475 AbstractCegarLoop]: Abstraction has 553 states and 811 transitions. [2019-09-20 13:27:50,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:50,624 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 811 transitions. [2019-09-20 13:27:50,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-20 13:27:50,627 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:50,627 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:50,628 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:50,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:50,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1812033251, now seen corresponding path program 1 times [2019-09-20 13:27:50,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:50,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:50,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:50,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:50,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:50,735 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:50,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:50,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:50,738 INFO L87 Difference]: Start difference. First operand 553 states and 811 transitions. Second operand 4 states. [2019-09-20 13:27:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,160 INFO L93 Difference]: Finished difference Result 639 states and 934 transitions. [2019-09-20 13:27:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-09-20 13:27:51,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,164 INFO L225 Difference]: With dead ends: 639 [2019-09-20 13:27:51,165 INFO L226 Difference]: Without dead ends: 639 [2019-09-20 13:27:51,165 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:51,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-20 13:27:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 555. [2019-09-20 13:27:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-20 13:27:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 813 transitions. [2019-09-20 13:27:51,173 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 813 transitions. Word has length 156 [2019-09-20 13:27:51,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,173 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 813 transitions. [2019-09-20 13:27:51,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 813 transitions. [2019-09-20 13:27:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:51,176 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,176 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-09-20 13:27:51,177 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1318648782, now seen corresponding path program 1 times [2019-09-20 13:27:51,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:51,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,252 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,253 INFO L87 Difference]: Start difference. First operand 555 states and 813 transitions. Second operand 4 states. [2019-09-20 13:27:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:51,587 INFO L93 Difference]: Finished difference Result 639 states and 932 transitions. [2019-09-20 13:27:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:51,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:51,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:51,592 INFO L225 Difference]: With dead ends: 639 [2019-09-20 13:27:51,592 INFO L226 Difference]: Without dead ends: 639 [2019-09-20 13:27:51,592 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:51,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-20 13:27:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 555. [2019-09-20 13:27:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-09-20 13:27:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 811 transitions. [2019-09-20 13:27:51,599 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 811 transitions. Word has length 157 [2019-09-20 13:27:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:51,600 INFO L475 AbstractCegarLoop]: Abstraction has 555 states and 811 transitions. [2019-09-20 13:27:51,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 811 transitions. [2019-09-20 13:27:51,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:27:51,601 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:51,601 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:51,602 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:51,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1923363890, now seen corresponding path program 1 times [2019-09-20 13:27:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:51,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:51,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:51,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:51,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:51,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:51,680 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:51,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:51,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:51,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:51,681 INFO L87 Difference]: Start difference. First operand 555 states and 811 transitions. Second operand 4 states. [2019-09-20 13:27:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,005 INFO L93 Difference]: Finished difference Result 635 states and 926 transitions. [2019-09-20 13:27:52,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-09-20 13:27:52,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,010 INFO L225 Difference]: With dead ends: 635 [2019-09-20 13:27:52,010 INFO L226 Difference]: Without dead ends: 635 [2019-09-20 13:27:52,010 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-20 13:27:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 557. [2019-09-20 13:27:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-20 13:27:52,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 813 transitions. [2019-09-20 13:27:52,016 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 813 transitions. Word has length 157 [2019-09-20 13:27:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,016 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 813 transitions. [2019-09-20 13:27:52,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 813 transitions. [2019-09-20 13:27:52,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:27:52,019 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,019 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,019 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,019 INFO L82 PathProgramCache]: Analyzing trace with hash 787486495, now seen corresponding path program 1 times [2019-09-20 13:27:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:52,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,103 INFO L87 Difference]: Start difference. First operand 557 states and 813 transitions. Second operand 4 states. [2019-09-20 13:27:52,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,423 INFO L93 Difference]: Finished difference Result 631 states and 918 transitions. [2019-09-20 13:27:52,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:27:52,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,427 INFO L225 Difference]: With dead ends: 631 [2019-09-20 13:27:52,427 INFO L226 Difference]: Without dead ends: 631 [2019-09-20 13:27:52,427 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:52,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2019-09-20 13:27:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 557. [2019-09-20 13:27:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2019-09-20 13:27:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 811 transitions. [2019-09-20 13:27:52,433 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 811 transitions. Word has length 158 [2019-09-20 13:27:52,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,433 INFO L475 AbstractCegarLoop]: Abstraction has 557 states and 811 transitions. [2019-09-20 13:27:52,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 811 transitions. [2019-09-20 13:27:52,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-20 13:27:52,435 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,435 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-20 13:27:52,436 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1680077375, now seen corresponding path program 1 times [2019-09-20 13:27:52,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:52,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,513 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,514 INFO L87 Difference]: Start difference. First operand 557 states and 811 transitions. Second operand 4 states. [2019-09-20 13:27:52,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:52,797 INFO L93 Difference]: Finished difference Result 625 states and 908 transitions. [2019-09-20 13:27:52,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:52,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-09-20 13:27:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:52,800 INFO L225 Difference]: With dead ends: 625 [2019-09-20 13:27:52,800 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 13:27:52,801 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 13:27:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 559. [2019-09-20 13:27:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-09-20 13:27:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 813 transitions. [2019-09-20 13:27:52,808 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 813 transitions. Word has length 158 [2019-09-20 13:27:52,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:52,808 INFO L475 AbstractCegarLoop]: Abstraction has 559 states and 813 transitions. [2019-09-20 13:27:52,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:52,809 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 813 transitions. [2019-09-20 13:27:52,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:27:52,810 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:52,810 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:52,811 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:52,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1610871587, now seen corresponding path program 1 times [2019-09-20 13:27:52,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:52,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:52,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:52,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:52,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:52,881 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:52,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:52,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:52,882 INFO L87 Difference]: Start difference. First operand 559 states and 813 transitions. Second operand 4 states. [2019-09-20 13:27:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,178 INFO L93 Difference]: Finished difference Result 625 states and 906 transitions. [2019-09-20 13:27:53,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-09-20 13:27:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,182 INFO L225 Difference]: With dead ends: 625 [2019-09-20 13:27:53,183 INFO L226 Difference]: Without dead ends: 625 [2019-09-20 13:27:53,183 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-20 13:27:53,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 561. [2019-09-20 13:27:53,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-09-20 13:27:53,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 815 transitions. [2019-09-20 13:27:53,189 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 815 transitions. Word has length 160 [2019-09-20 13:27:53,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,189 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 815 transitions. [2019-09-20 13:27:53,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 815 transitions. [2019-09-20 13:27:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:27:53,190 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,190 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,190 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1881046551, now seen corresponding path program 1 times [2019-09-20 13:27:53,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:53,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,273 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,274 INFO L87 Difference]: Start difference. First operand 561 states and 815 transitions. Second operand 4 states. [2019-09-20 13:27:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,564 INFO L93 Difference]: Finished difference Result 617 states and 894 transitions. [2019-09-20 13:27:53,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-20 13:27:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,567 INFO L225 Difference]: With dead ends: 617 [2019-09-20 13:27:53,568 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:27:53,568 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:53,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:27:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 563. [2019-09-20 13:27:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2019-09-20 13:27:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 817 transitions. [2019-09-20 13:27:53,574 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 817 transitions. Word has length 161 [2019-09-20 13:27:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,574 INFO L475 AbstractCegarLoop]: Abstraction has 563 states and 817 transitions. [2019-09-20 13:27:53,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 817 transitions. [2019-09-20 13:27:53,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-20 13:27:53,575 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,575 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,575 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1768488536, now seen corresponding path program 1 times [2019-09-20 13:27:53,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:53,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:53,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:53,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:53,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:53,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:53,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:53,645 INFO L87 Difference]: Start difference. First operand 563 states and 817 transitions. Second operand 4 states. [2019-09-20 13:27:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:53,931 INFO L93 Difference]: Finished difference Result 617 states and 892 transitions. [2019-09-20 13:27:53,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:53,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-20 13:27:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:53,935 INFO L225 Difference]: With dead ends: 617 [2019-09-20 13:27:53,935 INFO L226 Difference]: Without dead ends: 617 [2019-09-20 13:27:53,935 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-20 13:27:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 565. [2019-09-20 13:27:53,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-09-20 13:27:53,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 819 transitions. [2019-09-20 13:27:53,941 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 819 transitions. Word has length 161 [2019-09-20 13:27:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:53,942 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 819 transitions. [2019-09-20 13:27:53,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 819 transitions. [2019-09-20 13:27:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-20 13:27:53,943 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:53,944 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:53,944 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:53,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:53,944 INFO L82 PathProgramCache]: Analyzing trace with hash 688851092, now seen corresponding path program 1 times [2019-09-20 13:27:53,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:53,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:53,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:54,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,032 INFO L87 Difference]: Start difference. First operand 565 states and 819 transitions. Second operand 4 states. [2019-09-20 13:27:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,340 INFO L93 Difference]: Finished difference Result 613 states and 886 transitions. [2019-09-20 13:27:54,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-09-20 13:27:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,344 INFO L225 Difference]: With dead ends: 613 [2019-09-20 13:27:54,344 INFO L226 Difference]: Without dead ends: 613 [2019-09-20 13:27:54,344 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:54,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-20 13:27:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 567. [2019-09-20 13:27:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-09-20 13:27:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 821 transitions. [2019-09-20 13:27:54,350 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 821 transitions. Word has length 162 [2019-09-20 13:27:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,351 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 821 transitions. [2019-09-20 13:27:54,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 821 transitions. [2019-09-20 13:27:54,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-20 13:27:54,352 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,352 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,353 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1153739747, now seen corresponding path program 1 times [2019-09-20 13:27:54,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:54,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,435 INFO L87 Difference]: Start difference. First operand 567 states and 821 transitions. Second operand 4 states. [2019-09-20 13:27:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:54,719 INFO L93 Difference]: Finished difference Result 613 states and 884 transitions. [2019-09-20 13:27:54,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:54,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-09-20 13:27:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:54,723 INFO L225 Difference]: With dead ends: 613 [2019-09-20 13:27:54,723 INFO L226 Difference]: Without dead ends: 613 [2019-09-20 13:27:54,724 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-09-20 13:27:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 569. [2019-09-20 13:27:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-09-20 13:27:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 823 transitions. [2019-09-20 13:27:54,729 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 823 transitions. Word has length 163 [2019-09-20 13:27:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:54,730 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 823 transitions. [2019-09-20 13:27:54,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 823 transitions. [2019-09-20 13:27:54,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-20 13:27:54,731 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:54,731 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:54,731 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:54,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:54,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1198007505, now seen corresponding path program 1 times [2019-09-20 13:27:54,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:54,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:54,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:54,820 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:54,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:54,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:54,820 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:54,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:54,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:54,821 INFO L87 Difference]: Start difference. First operand 569 states and 823 transitions. Second operand 4 states. [2019-09-20 13:27:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,100 INFO L93 Difference]: Finished difference Result 609 states and 878 transitions. [2019-09-20 13:27:55,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-20 13:27:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,104 INFO L225 Difference]: With dead ends: 609 [2019-09-20 13:27:55,104 INFO L226 Difference]: Without dead ends: 609 [2019-09-20 13:27:55,104 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-09-20 13:27:55,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 571. [2019-09-20 13:27:55,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-09-20 13:27:55,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 825 transitions. [2019-09-20 13:27:55,112 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 825 transitions. Word has length 164 [2019-09-20 13:27:55,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,113 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 825 transitions. [2019-09-20 13:27:55,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 825 transitions. [2019-09-20 13:27:55,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-20 13:27:55,114 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,114 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,119 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1845634934, now seen corresponding path program 1 times [2019-09-20 13:27:55,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-20 13:27:55,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:55,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:55,187 INFO L87 Difference]: Start difference. First operand 571 states and 825 transitions. Second operand 3 states. [2019-09-20 13:27:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,248 INFO L93 Difference]: Finished difference Result 837 states and 1209 transitions. [2019-09-20 13:27:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:55,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-20 13:27:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,252 INFO L225 Difference]: With dead ends: 837 [2019-09-20 13:27:55,252 INFO L226 Difference]: Without dead ends: 837 [2019-09-20 13:27:55,253 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:27:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2019-09-20 13:27:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 837. [2019-09-20 13:27:55,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:27:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1209 transitions. [2019-09-20 13:27:55,263 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1209 transitions. Word has length 172 [2019-09-20 13:27:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,264 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1209 transitions. [2019-09-20 13:27:55,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1209 transitions. [2019-09-20 13:27:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-20 13:27:55,265 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,266 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,266 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1319413782, now seen corresponding path program 1 times [2019-09-20 13:27:55,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-20 13:27:55,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:55,329 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:55,330 INFO L87 Difference]: Start difference. First operand 837 states and 1209 transitions. Second operand 4 states. [2019-09-20 13:27:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,611 INFO L93 Difference]: Finished difference Result 894 states and 1282 transitions. [2019-09-20 13:27:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:55,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-09-20 13:27:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,615 INFO L225 Difference]: With dead ends: 894 [2019-09-20 13:27:55,615 INFO L226 Difference]: Without dead ends: 894 [2019-09-20 13:27:55,615 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-09-20 13:27:55,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2019-09-20 13:27:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 837. [2019-09-20 13:27:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2019-09-20 13:27:55,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1206 transitions. [2019-09-20 13:27:55,627 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1206 transitions. Word has length 173 [2019-09-20 13:27:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,627 INFO L475 AbstractCegarLoop]: Abstraction has 837 states and 1206 transitions. [2019-09-20 13:27:55,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1206 transitions. [2019-09-20 13:27:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-20 13:27:55,629 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,629 INFO L407 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:55,630 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1924816579, now seen corresponding path program 1 times [2019-09-20 13:27:55,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-20 13:27:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:55,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:55,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:55,714 INFO L87 Difference]: Start difference. First operand 837 states and 1206 transitions. Second operand 3 states. [2019-09-20 13:27:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,768 INFO L93 Difference]: Finished difference Result 1104 states and 1590 transitions. [2019-09-20 13:27:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:55,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-20 13:27:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,775 INFO L225 Difference]: With dead ends: 1104 [2019-09-20 13:27:55,775 INFO L226 Difference]: Without dead ends: 1104 [2019-09-20 13:27:55,775 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:27:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-09-20 13:27:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1104. [2019-09-20 13:27:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1104 states. [2019-09-20 13:27:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1590 transitions. [2019-09-20 13:27:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1590 transitions. Word has length 173 [2019-09-20 13:27:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:55,795 INFO L475 AbstractCegarLoop]: Abstraction has 1104 states and 1590 transitions. [2019-09-20 13:27:55,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1590 transitions. [2019-09-20 13:27:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-20 13:27:55,798 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:55,798 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-09-20 13:27:55,798 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:55,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:55,799 INFO L82 PathProgramCache]: Analyzing trace with hash -442937119, now seen corresponding path program 1 times [2019-09-20 13:27:55,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:55,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:55,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-20 13:27:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:55,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:55,922 INFO L87 Difference]: Start difference. First operand 1104 states and 1590 transitions. Second operand 3 states. [2019-09-20 13:27:55,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:55,975 INFO L93 Difference]: Finished difference Result 1376 states and 1986 transitions. [2019-09-20 13:27:55,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:55,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 211 [2019-09-20 13:27:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:55,979 INFO L225 Difference]: With dead ends: 1376 [2019-09-20 13:27:55,979 INFO L226 Difference]: Without dead ends: 1376 [2019-09-20 13:27:55,979 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:27:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-09-20 13:27:56,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2019-09-20 13:27:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-09-20 13:27:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 1986 transitions. [2019-09-20 13:27:56,005 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 1986 transitions. Word has length 211 [2019-09-20 13:27:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,005 INFO L475 AbstractCegarLoop]: Abstraction has 1376 states and 1986 transitions. [2019-09-20 13:27:56,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 1986 transitions. [2019-09-20 13:27:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-20 13:27:56,008 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,009 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,009 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -846883203, now seen corresponding path program 1 times [2019-09-20 13:27:56,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-09-20 13:27:56,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:27:56,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,219 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:27:56,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:27:56,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:27:56,219 INFO L87 Difference]: Start difference. First operand 1376 states and 1986 transitions. Second operand 4 states. [2019-09-20 13:27:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,640 INFO L93 Difference]: Finished difference Result 1886 states and 2753 transitions. [2019-09-20 13:27:56,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:27:56,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 297 [2019-09-20 13:27:56,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,645 INFO L225 Difference]: With dead ends: 1886 [2019-09-20 13:27:56,645 INFO L226 Difference]: Without dead ends: 1886 [2019-09-20 13:27:56,645 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:27:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2019-09-20 13:27:56,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1581. [2019-09-20 13:27:56,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2019-09-20 13:27:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2361 transitions. [2019-09-20 13:27:56,662 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2361 transitions. Word has length 297 [2019-09-20 13:27:56,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,662 INFO L475 AbstractCegarLoop]: Abstraction has 1581 states and 2361 transitions. [2019-09-20 13:27:56,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:27:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2361 transitions. [2019-09-20 13:27:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-20 13:27:56,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,666 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:27:56,666 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1281388801, now seen corresponding path program 1 times [2019-09-20 13:27:56,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:56,797 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-09-20 13:27:56,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:27:56,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:27:56,797 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:56,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:27:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:27:56,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:27:56,798 INFO L87 Difference]: Start difference. First operand 1581 states and 2361 transitions. Second operand 3 states. [2019-09-20 13:27:56,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:56,846 INFO L93 Difference]: Finished difference Result 1889 states and 2820 transitions. [2019-09-20 13:27:56,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:27:56,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-09-20 13:27:56,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:56,850 INFO L225 Difference]: With dead ends: 1889 [2019-09-20 13:27:56,850 INFO L226 Difference]: Without dead ends: 1889 [2019-09-20 13:27:56,851 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:27:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-09-20 13:27:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2019-09-20 13:27:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2019-09-20 13:27:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2820 transitions. [2019-09-20 13:27:56,870 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2820 transitions. Word has length 297 [2019-09-20 13:27:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:56,870 INFO L475 AbstractCegarLoop]: Abstraction has 1889 states and 2820 transitions. [2019-09-20 13:27:56,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:27:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2820 transitions. [2019-09-20 13:27:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-20 13:27:56,873 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:27:56,874 INFO L407 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2019-09-20 13:27:56,874 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:27:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:56,874 INFO L82 PathProgramCache]: Analyzing trace with hash 461909867, now seen corresponding path program 1 times [2019-09-20 13:27:56,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:27:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:27:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:27:56,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:27:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:27:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 439 proven. 55 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2019-09-20 13:27:57,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:27:57,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:27:57,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2019-09-20 13:27:57,094 INFO L207 CegarAbsIntRunner]: [0], [43], [48], [50], [61], [63], [67], [76], [78], [83], [88], [93], [98], [103], [108], [113], [118], [121], [123], [128], [133], [136], [138], [141], [143], [146], [148], [153], [158], [163], [168], [173], [178], [183], [188], [193], [198], [203], [208], [213], [218], [221], [223], [228], [231], [233], [238], [241], [312], [315], [323], [325], [328], [330], [336], [339], [341], [343], [345], [348], [357], [506], [509], [511], [516], [519], [527], [532], [534], [536], [541], [544], [546], [549], [562], [567], [569], [572], [590], [593], [597], [618], [652], [654], [666], [669], [670], [682], [690], [691], [692] [2019-09-20 13:27:57,148 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:27:57,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:27:57,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:27:57,213 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 22 variables. [2019-09-20 13:27:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:27:57,218 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:27:57,350 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:27:57,350 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:27:57,361 INFO L420 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2019-09-20 13:27:57,361 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:27:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:27:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2019-09-20 13:27:57,363 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:27:57,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:27:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:27:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:57,365 INFO L87 Difference]: Start difference. First operand 1889 states and 2820 transitions. Second operand 2 states. [2019-09-20 13:27:57,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:27:57,365 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:27:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:27:57,365 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 298 [2019-09-20 13:27:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:27:57,366 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:27:57,366 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:27:57,366 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:27:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:27:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:27:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:27:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:27:57,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 298 [2019-09-20 13:27:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:27:57,367 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:27:57,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:27:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:27:57,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:27:57,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:27:57 BoogieIcfgContainer [2019-09-20 13:27:57,372 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:27:57,375 INFO L168 Benchmark]: Toolchain (without parser) took 31411.75 ms. Allocated memory was 130.5 MB in the beginning and 664.3 MB in the end (delta: 533.7 MB). Free memory was 84.4 MB in the beginning and 553.9 MB in the end (delta: -469.6 MB). Peak memory consumption was 64.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,376 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.86 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 84.2 MB in the beginning and 154.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,378 INFO L168 Benchmark]: Boogie Preprocessor took 158.93 ms. Allocated memory is still 198.7 MB. Free memory was 154.0 MB in the beginning and 145.7 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,379 INFO L168 Benchmark]: RCFGBuilder took 1423.46 ms. Allocated memory was 198.7 MB in the beginning and 218.1 MB in the end (delta: 19.4 MB). Free memory was 145.7 MB in the beginning and 161.1 MB in the end (delta: -15.4 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,384 INFO L168 Benchmark]: TraceAbstraction took 28959.27 ms. Allocated memory was 218.1 MB in the beginning and 664.3 MB in the end (delta: 446.2 MB). Free memory was 161.1 MB in the beginning and 553.9 MB in the end (delta: -392.9 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-09-20 13:27:57,392 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 130.5 MB. Free memory was 104.8 MB in the beginning and 104.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 865.86 ms. Allocated memory was 130.5 MB in the beginning and 198.7 MB in the end (delta: 68.2 MB). Free memory was 84.2 MB in the beginning and 154.0 MB in the end (delta: -69.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.93 ms. Allocated memory is still 198.7 MB. Free memory was 154.0 MB in the beginning and 145.7 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1423.46 ms. Allocated memory was 198.7 MB in the beginning and 218.1 MB in the end (delta: 19.4 MB). Free memory was 145.7 MB in the beginning and 161.1 MB in the end (delta: -15.4 MB). Peak memory consumption was 85.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28959.27 ms. Allocated memory was 218.1 MB in the beginning and 664.3 MB in the end (delta: 446.2 MB). Free memory was 161.1 MB in the beginning and 553.9 MB in the end (delta: -392.9 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1727]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 187 locations, 1 error locations. SAFE Result, 28.8s OverallTime, 68 OverallIterations, 9 TraceHistogramMax, 21.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15845 SDtfs, 4634 SDslu, 21811 SDs, 0 SdLazy, 13050 SolverSat, 519 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 437 SyntacticMatches, 33 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1889occurred in iteration=67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.1919191919191918 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 68 MinimizatonAttempts, 3721 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 8450 NumberOfCodeBlocks, 8450 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 8382 ConstructedInterpolants, 0 QuantifiedInterpolants, 2722781 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 67 PerfectInterpolantSequences, 8483/8538 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...