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/systemc/token_ring.08.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:27:27,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:27:27,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:27:27,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:27:27,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:27:27,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:27:27,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:27:27,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:27:27,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:27:27,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:27:27,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:27:27,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:27:27,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:27:27,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:27:27,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:27:27,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:27:27,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:27:27,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:27:27,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:27:27,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:27:27,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:27:27,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:27:27,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:27:27,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:27:27,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:27:27,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:27:27,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:27:27,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:27:27,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:27:27,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:27:27,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:27:27,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:27:27,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:27:27,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:27:27,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:27:27,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:27:27,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:27:27,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:27:27,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:27:27,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:27:27,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:27:27,945 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-10 03:27:27,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:27:27,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:27:27,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:27:27,962 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:27:27,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:27:27,963 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:27:27,963 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:27:27,963 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:27:27,964 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:27:27,964 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:27:27,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:27:27,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:27:27,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:27:27,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:27:27,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:27:27,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:27:27,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:27:27,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:27:27,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:27:27,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:27:27,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:27:27,967 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:27:27,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:27:27,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:27:27,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:27:27,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:27:27,968 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:27:27,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:27:27,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:27:27,968 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:27:28,005 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:27:28,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:27:28,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:27:28,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:27:28,025 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:27:28,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.08.cil-2.c [2019-09-10 03:27:28,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3137de0/826c0eec3e444cd3854c37419f84141a/FLAG7d1120782 [2019-09-10 03:27:28,597 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:27:28,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-2.c [2019-09-10 03:27:28,610 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3137de0/826c0eec3e444cd3854c37419f84141a/FLAG7d1120782 [2019-09-10 03:27:28,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb3137de0/826c0eec3e444cd3854c37419f84141a [2019-09-10 03:27:28,932 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:27:28,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:27:28,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:27:28,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:27:28,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:27:28,939 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:27:28" (1/1) ... [2019-09-10 03:27:28,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58815698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:28, skipping insertion in model container [2019-09-10 03:27:28,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:27:28" (1/1) ... [2019-09-10 03:27:28,954 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:27:29,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:27:29,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:27:29,438 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:27:29,527 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:27:29,559 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:27:29,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29 WrapperNode [2019-09-10 03:27:29,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:27:29,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:27:29,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:27:29,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:27:29,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,602 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (1/1) ... [2019-09-10 03:27:29,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:27:29,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:27:29,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:27:29,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:27:29,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (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-10 03:27:29,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:27:29,711 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:27:29,717 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:27:29,717 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:27:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:27:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:27:29,718 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:27:29,719 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:27:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:27:29,720 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:27:29,721 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:27:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:27:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:27:29,722 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:27:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:27:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:27:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:27:29,723 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:27:29,724 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:27:29,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:27:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:27:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:27:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:27:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:27:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:27:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:27:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:27:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:27:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:27:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:27:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:27:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:27:29,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:27:29,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:27:30,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:27:30,689 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-10 03:27:30,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:27:30 BoogieIcfgContainer [2019-09-10 03:27:30,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:27:30,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:27:30,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:27:30,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:27:30,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:27:28" (1/3) ... [2019-09-10 03:27:30,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd3461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:27:30, skipping insertion in model container [2019-09-10 03:27:30,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:27:29" (2/3) ... [2019-09-10 03:27:30,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cd3461a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:27:30, skipping insertion in model container [2019-09-10 03:27:30,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:27:30" (3/3) ... [2019-09-10 03:27:30,699 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-2.c [2019-09-10 03:27:30,709 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:27:30,720 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:27:30,738 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:27:30,767 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:27:30,768 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:27:30,768 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:27:30,768 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:27:30,768 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:27:30,769 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:27:30,769 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:27:30,769 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:27:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states. [2019-09-10 03:27:30,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:30,820 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:30,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:30,823 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash -17079978, now seen corresponding path program 1 times [2019-09-10 03:27:30,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:30,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:30,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:30,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:31,263 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-10 03:27:31,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:31,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:27:31,266 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:31,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:27:31,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:27:31,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:31,292 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 4 states. [2019-09-10 03:27:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:31,641 INFO L93 Difference]: Finished difference Result 359 states and 517 transitions. [2019-09-10 03:27:31,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:27:31,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 03:27:31,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:31,678 INFO L225 Difference]: With dead ends: 359 [2019-09-10 03:27:31,679 INFO L226 Difference]: Without dead ends: 352 [2019-09-10 03:27:31,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-10 03:27:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-10 03:27:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:31,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 510 transitions. [2019-09-10 03:27:31,805 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 510 transitions. Word has length 176 [2019-09-10 03:27:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:31,808 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 510 transitions. [2019-09-10 03:27:31,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:27:31,808 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 510 transitions. [2019-09-10 03:27:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:31,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:31,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:31,824 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:31,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1752391636, now seen corresponding path program 1 times [2019-09-10 03:27:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:31,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:32,139 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-10 03:27:32,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:32,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:32,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:32,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:32,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:32,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:32,147 INFO L87 Difference]: Start difference. First operand 352 states and 510 transitions. Second operand 5 states. [2019-09-10 03:27:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:33,040 INFO L93 Difference]: Finished difference Result 406 states and 608 transitions. [2019-09-10 03:27:33,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:33,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:33,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:33,044 INFO L225 Difference]: With dead ends: 406 [2019-09-10 03:27:33,044 INFO L226 Difference]: Without dead ends: 406 [2019-09-10 03:27:33,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:33,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-10 03:27:33,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 352. [2019-09-10 03:27:33,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:33,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 509 transitions. [2019-09-10 03:27:33,082 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 509 transitions. Word has length 176 [2019-09-10 03:27:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:33,083 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 509 transitions. [2019-09-10 03:27:33,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 509 transitions. [2019-09-10 03:27:33,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:33,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:33,088 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:33,088 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1487744146, now seen corresponding path program 1 times [2019-09-10 03:27:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:33,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:33,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:33,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:33,294 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-10 03:27:33,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:33,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:33,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:33,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:33,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:33,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:33,297 INFO L87 Difference]: Start difference. First operand 352 states and 509 transitions. Second operand 5 states. [2019-09-10 03:27:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:34,094 INFO L93 Difference]: Finished difference Result 406 states and 608 transitions. [2019-09-10 03:27:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:34,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:34,098 INFO L225 Difference]: With dead ends: 406 [2019-09-10 03:27:34,098 INFO L226 Difference]: Without dead ends: 406 [2019-09-10 03:27:34,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-10 03:27:34,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 352. [2019-09-10 03:27:34,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:34,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 508 transitions. [2019-09-10 03:27:34,114 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 508 transitions. Word has length 176 [2019-09-10 03:27:34,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:34,114 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 508 transitions. [2019-09-10 03:27:34,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:34,115 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 508 transitions. [2019-09-10 03:27:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:34,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:34,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:34,118 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:34,118 INFO L82 PathProgramCache]: Analyzing trace with hash -876097516, now seen corresponding path program 1 times [2019-09-10 03:27:34,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:34,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:34,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:34,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:34,264 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-10 03:27:34,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:34,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:34,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:34,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:34,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:34,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:34,266 INFO L87 Difference]: Start difference. First operand 352 states and 508 transitions. Second operand 5 states. [2019-09-10 03:27:35,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:35,028 INFO L93 Difference]: Finished difference Result 404 states and 603 transitions. [2019-09-10 03:27:35,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:35,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:35,032 INFO L225 Difference]: With dead ends: 404 [2019-09-10 03:27:35,033 INFO L226 Difference]: Without dead ends: 404 [2019-09-10 03:27:35,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-09-10 03:27:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 352. [2019-09-10 03:27:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:35,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 507 transitions. [2019-09-10 03:27:35,046 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 507 transitions. Word has length 176 [2019-09-10 03:27:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:35,047 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 507 transitions. [2019-09-10 03:27:35,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 507 transitions. [2019-09-10 03:27:35,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:35,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:35,050 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:35,050 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:35,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2095690834, now seen corresponding path program 1 times [2019-09-10 03:27:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:35,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:35,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:35,144 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-10 03:27:35,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:35,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:35,145 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:35,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:35,146 INFO L87 Difference]: Start difference. First operand 352 states and 507 transitions. Second operand 5 states. [2019-09-10 03:27:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:35,907 INFO L93 Difference]: Finished difference Result 400 states and 594 transitions. [2019-09-10 03:27:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:35,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:35,915 INFO L225 Difference]: With dead ends: 400 [2019-09-10 03:27:35,915 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 03:27:35,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 03:27:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 352. [2019-09-10 03:27:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 506 transitions. [2019-09-10 03:27:35,932 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 506 transitions. Word has length 176 [2019-09-10 03:27:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:35,932 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 506 transitions. [2019-09-10 03:27:35,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 506 transitions. [2019-09-10 03:27:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:35,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:35,935 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:35,936 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1860988912, now seen corresponding path program 1 times [2019-09-10 03:27:35,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:35,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:35,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:35,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:36,050 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-10 03:27:36,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:36,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:36,051 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:36,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:36,052 INFO L87 Difference]: Start difference. First operand 352 states and 506 transitions. Second operand 5 states. [2019-09-10 03:27:36,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:36,801 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2019-09-10 03:27:36,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:36,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:36,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:36,806 INFO L225 Difference]: With dead ends: 398 [2019-09-10 03:27:36,806 INFO L226 Difference]: Without dead ends: 398 [2019-09-10 03:27:36,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-10 03:27:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 352. [2019-09-10 03:27:36,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 505 transitions. [2019-09-10 03:27:36,870 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 505 transitions. Word has length 176 [2019-09-10 03:27:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:36,871 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 505 transitions. [2019-09-10 03:27:36,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:36,871 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 505 transitions. [2019-09-10 03:27:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:36,873 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:36,874 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:36,874 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:36,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:36,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1434434414, now seen corresponding path program 1 times [2019-09-10 03:27:36,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:36,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:36,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:36,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:36,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:36,958 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-10 03:27:36,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:36,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:36,959 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:36,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:36,960 INFO L87 Difference]: Start difference. First operand 352 states and 505 transitions. Second operand 5 states. [2019-09-10 03:27:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:37,660 INFO L93 Difference]: Finished difference Result 396 states and 584 transitions. [2019-09-10 03:27:37,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:37,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:37,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:37,665 INFO L225 Difference]: With dead ends: 396 [2019-09-10 03:27:37,665 INFO L226 Difference]: Without dead ends: 396 [2019-09-10 03:27:37,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:37,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-10 03:27:37,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 352. [2019-09-10 03:27:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 504 transitions. [2019-09-10 03:27:37,684 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 504 transitions. Word has length 176 [2019-09-10 03:27:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:37,684 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 504 transitions. [2019-09-10 03:27:37,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2019-09-10 03:27:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:37,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:37,687 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:37,687 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:37,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:37,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1974863920, now seen corresponding path program 1 times [2019-09-10 03:27:37,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:37,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:37,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:37,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:37,816 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-10 03:27:37,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:37,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:37,817 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:37,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:37,820 INFO L87 Difference]: Start difference. First operand 352 states and 504 transitions. Second operand 5 states. [2019-09-10 03:27:38,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:38,537 INFO L93 Difference]: Finished difference Result 394 states and 579 transitions. [2019-09-10 03:27:38,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:38,538 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:38,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:38,541 INFO L225 Difference]: With dead ends: 394 [2019-09-10 03:27:38,541 INFO L226 Difference]: Without dead ends: 394 [2019-09-10 03:27:38,542 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:38,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-10 03:27:38,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 352. [2019-09-10 03:27:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 503 transitions. [2019-09-10 03:27:38,553 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 503 transitions. Word has length 176 [2019-09-10 03:27:38,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:38,553 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 503 transitions. [2019-09-10 03:27:38,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:38,554 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 503 transitions. [2019-09-10 03:27:38,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:38,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:38,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:38,556 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:38,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:38,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2130844462, now seen corresponding path program 1 times [2019-09-10 03:27:38,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:38,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:38,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:38,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:38,639 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-10 03:27:38,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:38,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:38,639 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:38,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:38,641 INFO L87 Difference]: Start difference. First operand 352 states and 503 transitions. Second operand 5 states. [2019-09-10 03:27:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:39,434 INFO L93 Difference]: Finished difference Result 392 states and 574 transitions. [2019-09-10 03:27:39,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:39,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:39,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:39,438 INFO L225 Difference]: With dead ends: 392 [2019-09-10 03:27:39,440 INFO L226 Difference]: Without dead ends: 392 [2019-09-10 03:27:39,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-10 03:27:39,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 352. [2019-09-10 03:27:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:39,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 502 transitions. [2019-09-10 03:27:39,464 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 502 transitions. Word has length 176 [2019-09-10 03:27:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:39,465 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 502 transitions. [2019-09-10 03:27:39,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 502 transitions. [2019-09-10 03:27:39,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:39,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:39,469 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:39,469 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1720234096, now seen corresponding path program 1 times [2019-09-10 03:27:39,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:39,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:39,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:39,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:39,619 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-10 03:27:39,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:39,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:39,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:39,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:39,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:39,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:39,622 INFO L87 Difference]: Start difference. First operand 352 states and 502 transitions. Second operand 5 states. [2019-09-10 03:27:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:40,362 INFO L93 Difference]: Finished difference Result 427 states and 637 transitions. [2019-09-10 03:27:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:40,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:40,367 INFO L225 Difference]: With dead ends: 427 [2019-09-10 03:27:40,367 INFO L226 Difference]: Without dead ends: 427 [2019-09-10 03:27:40,368 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:40,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-10 03:27:40,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 352. [2019-09-10 03:27:40,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2019-09-10 03:27:40,379 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 176 [2019-09-10 03:27:40,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:40,380 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2019-09-10 03:27:40,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2019-09-10 03:27:40,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:40,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:40,382 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:40,382 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:40,382 INFO L82 PathProgramCache]: Analyzing trace with hash 786863378, now seen corresponding path program 1 times [2019-09-10 03:27:40,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:40,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:40,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:40,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:40,485 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-10 03:27:40,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:40,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:40,486 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:40,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:40,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:40,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:40,487 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand 5 states. [2019-09-10 03:27:41,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:41,157 INFO L93 Difference]: Finished difference Result 421 states and 627 transitions. [2019-09-10 03:27:41,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:41,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:41,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:41,161 INFO L225 Difference]: With dead ends: 421 [2019-09-10 03:27:41,161 INFO L226 Difference]: Without dead ends: 421 [2019-09-10 03:27:41,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-10 03:27:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 352. [2019-09-10 03:27:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 500 transitions. [2019-09-10 03:27:41,172 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 500 transitions. Word has length 176 [2019-09-10 03:27:41,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:41,172 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 500 transitions. [2019-09-10 03:27:41,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 500 transitions. [2019-09-10 03:27:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:41,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:41,174 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:41,175 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1349019824, now seen corresponding path program 1 times [2019-09-10 03:27:41,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:41,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:41,286 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-10 03:27:41,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:41,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:41,287 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:41,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:41,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:41,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:41,289 INFO L87 Difference]: Start difference. First operand 352 states and 500 transitions. Second operand 5 states. [2019-09-10 03:27:41,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:41,960 INFO L93 Difference]: Finished difference Result 421 states and 623 transitions. [2019-09-10 03:27:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:41,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:41,964 INFO L225 Difference]: With dead ends: 421 [2019-09-10 03:27:41,964 INFO L226 Difference]: Without dead ends: 421 [2019-09-10 03:27:41,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:41,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-10 03:27:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 352. [2019-09-10 03:27:41,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2019-09-10 03:27:41,979 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 176 [2019-09-10 03:27:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:41,980 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2019-09-10 03:27:41,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2019-09-10 03:27:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:41,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:41,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:41,983 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:41,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:41,983 INFO L82 PathProgramCache]: Analyzing trace with hash -931131122, now seen corresponding path program 1 times [2019-09-10 03:27:41,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:41,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:41,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:41,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:42,099 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-10 03:27:42,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:42,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:42,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:42,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:42,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:42,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:42,100 INFO L87 Difference]: Start difference. First operand 352 states and 499 transitions. Second operand 5 states. [2019-09-10 03:27:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:42,803 INFO L93 Difference]: Finished difference Result 419 states and 618 transitions. [2019-09-10 03:27:42,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:42,804 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:42,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:42,807 INFO L225 Difference]: With dead ends: 419 [2019-09-10 03:27:42,807 INFO L226 Difference]: Without dead ends: 419 [2019-09-10 03:27:42,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-10 03:27:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 352. [2019-09-10 03:27:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 498 transitions. [2019-09-10 03:27:42,819 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 498 transitions. Word has length 176 [2019-09-10 03:27:42,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:42,819 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 498 transitions. [2019-09-10 03:27:42,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 498 transitions. [2019-09-10 03:27:42,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:42,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:42,821 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:42,821 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:42,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:42,822 INFO L82 PathProgramCache]: Analyzing trace with hash 467822480, now seen corresponding path program 1 times [2019-09-10 03:27:42,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:42,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:42,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:42,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:42,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:42,900 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-10 03:27:42,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:42,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:42,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:42,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:42,903 INFO L87 Difference]: Start difference. First operand 352 states and 498 transitions. Second operand 5 states. [2019-09-10 03:27:43,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:43,806 INFO L93 Difference]: Finished difference Result 417 states and 613 transitions. [2019-09-10 03:27:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:43,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:43,809 INFO L225 Difference]: With dead ends: 417 [2019-09-10 03:27:43,809 INFO L226 Difference]: Without dead ends: 417 [2019-09-10 03:27:43,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:43,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-10 03:27:43,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 352. [2019-09-10 03:27:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 497 transitions. [2019-09-10 03:27:43,820 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 497 transitions. Word has length 176 [2019-09-10 03:27:43,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:43,820 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 497 transitions. [2019-09-10 03:27:43,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:43,820 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 497 transitions. [2019-09-10 03:27:43,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:43,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:43,822 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:43,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:43,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1149617970, now seen corresponding path program 1 times [2019-09-10 03:27:43,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:43,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:43,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:43,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:43,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:43,944 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-10 03:27:43,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:43,945 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:43,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:43,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:43,946 INFO L87 Difference]: Start difference. First operand 352 states and 497 transitions. Second operand 5 states. [2019-09-10 03:27:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:44,587 INFO L93 Difference]: Finished difference Result 415 states and 608 transitions. [2019-09-10 03:27:44,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:44,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:44,590 INFO L225 Difference]: With dead ends: 415 [2019-09-10 03:27:44,591 INFO L226 Difference]: Without dead ends: 415 [2019-09-10 03:27:44,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-10 03:27:44,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 352. [2019-09-10 03:27:44,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:44,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 496 transitions. [2019-09-10 03:27:44,608 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 496 transitions. Word has length 176 [2019-09-10 03:27:44,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:44,608 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 496 transitions. [2019-09-10 03:27:44,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:44,609 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 496 transitions. [2019-09-10 03:27:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:44,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:44,611 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:44,612 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:44,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:44,612 INFO L82 PathProgramCache]: Analyzing trace with hash -786151472, now seen corresponding path program 1 times [2019-09-10 03:27:44,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:44,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:44,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:44,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:44,688 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-10 03:27:44,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:44,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:44,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:44,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:44,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:44,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:44,693 INFO L87 Difference]: Start difference. First operand 352 states and 496 transitions. Second operand 5 states. [2019-09-10 03:27:45,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:45,295 INFO L93 Difference]: Finished difference Result 413 states and 603 transitions. [2019-09-10 03:27:45,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:45,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:45,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:45,298 INFO L225 Difference]: With dead ends: 413 [2019-09-10 03:27:45,298 INFO L226 Difference]: Without dead ends: 413 [2019-09-10 03:27:45,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-10 03:27:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 352. [2019-09-10 03:27:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 495 transitions. [2019-09-10 03:27:45,310 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 495 transitions. Word has length 176 [2019-09-10 03:27:45,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:45,310 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 495 transitions. [2019-09-10 03:27:45,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 495 transitions. [2019-09-10 03:27:45,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:45,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:45,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:45,312 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:45,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:45,313 INFO L82 PathProgramCache]: Analyzing trace with hash -497332082, now seen corresponding path program 1 times [2019-09-10 03:27:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:45,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:45,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:45,451 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-10 03:27:45,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:45,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:45,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:45,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:45,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:45,453 INFO L87 Difference]: Start difference. First operand 352 states and 495 transitions. Second operand 5 states. [2019-09-10 03:27:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,141 INFO L93 Difference]: Finished difference Result 411 states and 598 transitions. [2019-09-10 03:27:46,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:46,142 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,145 INFO L225 Difference]: With dead ends: 411 [2019-09-10 03:27:46,145 INFO L226 Difference]: Without dead ends: 411 [2019-09-10 03:27:46,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:46,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-10 03:27:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 352. [2019-09-10 03:27:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-10 03:27:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 494 transitions. [2019-09-10 03:27:46,157 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 494 transitions. Word has length 176 [2019-09-10 03:27:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:46,158 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 494 transitions. [2019-09-10 03:27:46,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 494 transitions. [2019-09-10 03:27:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:46,159 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:46,160 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:46,160 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1042204656, now seen corresponding path program 1 times [2019-09-10 03:27:46,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:46,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:46,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:46,244 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-10 03:27:46,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:46,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:46,245 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:46,246 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:46,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:46,247 INFO L87 Difference]: Start difference. First operand 352 states and 494 transitions. Second operand 6 states. [2019-09-10 03:27:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,283 INFO L93 Difference]: Finished difference Result 383 states and 544 transitions. [2019-09-10 03:27:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:46,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:46,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,289 INFO L225 Difference]: With dead ends: 383 [2019-09-10 03:27:46,289 INFO L226 Difference]: Without dead ends: 383 [2019-09-10 03:27:46,289 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-10 03:27:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 357. [2019-09-10 03:27:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-10 03:27:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 499 transitions. [2019-09-10 03:27:46,300 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 499 transitions. Word has length 176 [2019-09-10 03:27:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:46,301 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 499 transitions. [2019-09-10 03:27:46,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 499 transitions. [2019-09-10 03:27:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:46,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:46,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:46,303 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:46,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1410286926, now seen corresponding path program 1 times [2019-09-10 03:27:46,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:46,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:46,384 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-10 03:27:46,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:46,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:27:46,385 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:46,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:27:46,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:27:46,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:46,388 INFO L87 Difference]: Start difference. First operand 357 states and 499 transitions. Second operand 4 states. [2019-09-10 03:27:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,738 INFO L93 Difference]: Finished difference Result 680 states and 947 transitions. [2019-09-10 03:27:46,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:27:46,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 03:27:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,748 INFO L225 Difference]: With dead ends: 680 [2019-09-10 03:27:46,748 INFO L226 Difference]: Without dead ends: 680 [2019-09-10 03:27:46,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-10 03:27:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-09-10 03:27:46,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-10 03:27:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 942 transitions. [2019-09-10 03:27:46,797 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 942 transitions. Word has length 176 [2019-09-10 03:27:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:46,798 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 942 transitions. [2019-09-10 03:27:46,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:27:46,798 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 942 transitions. [2019-09-10 03:27:46,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:46,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:46,800 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:46,801 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:46,801 INFO L82 PathProgramCache]: Analyzing trace with hash -865177009, now seen corresponding path program 1 times [2019-09-10 03:27:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:46,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:46,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:46,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:46,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:46,924 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-10 03:27:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:46,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:46,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:46,927 INFO L87 Difference]: Start difference. First operand 674 states and 942 transitions. Second operand 6 states. [2019-09-10 03:27:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:46,974 INFO L93 Difference]: Finished difference Result 702 states and 985 transitions. [2019-09-10 03:27:46,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:46,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:46,982 INFO L225 Difference]: With dead ends: 702 [2019-09-10 03:27:46,982 INFO L226 Difference]: Without dead ends: 702 [2019-09-10 03:27:46,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-10 03:27:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 679. [2019-09-10 03:27:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-10 03:27:47,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 946 transitions. [2019-09-10 03:27:47,016 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 946 transitions. Word has length 176 [2019-09-10 03:27:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:47,017 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 946 transitions. [2019-09-10 03:27:47,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 946 transitions. [2019-09-10 03:27:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:47,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:47,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:47,019 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:47,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1903761583, now seen corresponding path program 1 times [2019-09-10 03:27:47,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:47,224 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-10 03:27:47,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:47,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:47,225 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:47,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:47,229 INFO L87 Difference]: Start difference. First operand 679 states and 946 transitions. Second operand 6 states. [2019-09-10 03:27:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:47,285 INFO L93 Difference]: Finished difference Result 729 states and 1025 transitions. [2019-09-10 03:27:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:47,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:47,291 INFO L225 Difference]: With dead ends: 729 [2019-09-10 03:27:47,292 INFO L226 Difference]: Without dead ends: 729 [2019-09-10 03:27:47,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-10 03:27:47,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 689. [2019-09-10 03:27:47,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-10 03:27:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 956 transitions. [2019-09-10 03:27:47,319 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 956 transitions. Word has length 176 [2019-09-10 03:27:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:47,320 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 956 transitions. [2019-09-10 03:27:47,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 956 transitions. [2019-09-10 03:27:47,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:47,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:47,323 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:47,323 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:47,324 INFO L82 PathProgramCache]: Analyzing trace with hash -6264817, now seen corresponding path program 1 times [2019-09-10 03:27:47,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:47,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:47,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:47,460 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-10 03:27:47,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:47,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:47,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:47,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:47,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:47,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:47,463 INFO L87 Difference]: Start difference. First operand 689 states and 956 transitions. Second operand 6 states. [2019-09-10 03:27:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:47,508 INFO L93 Difference]: Finished difference Result 733 states and 1025 transitions. [2019-09-10 03:27:47,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:47,509 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:47,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:47,514 INFO L225 Difference]: With dead ends: 733 [2019-09-10 03:27:47,514 INFO L226 Difference]: Without dead ends: 733 [2019-09-10 03:27:47,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-10 03:27:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 699. [2019-09-10 03:27:47,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-09-10 03:27:47,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 966 transitions. [2019-09-10 03:27:47,546 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 966 transitions. Word has length 176 [2019-09-10 03:27:47,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:47,546 INFO L475 AbstractCegarLoop]: Abstraction has 699 states and 966 transitions. [2019-09-10 03:27:47,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:47,547 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 966 transitions. [2019-09-10 03:27:47,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:47,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:47,549 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:47,549 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:47,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:47,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1946846831, now seen corresponding path program 1 times [2019-09-10 03:27:47,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:47,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:47,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:47,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:47,698 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-10 03:27:47,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:27:47,698 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:47,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:27:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:27:47,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:47,700 INFO L87 Difference]: Start difference. First operand 699 states and 966 transitions. Second operand 4 states. [2019-09-10 03:27:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:48,077 INFO L93 Difference]: Finished difference Result 1358 states and 1871 transitions. [2019-09-10 03:27:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:27:48,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 03:27:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:48,086 INFO L225 Difference]: With dead ends: 1358 [2019-09-10 03:27:48,087 INFO L226 Difference]: Without dead ends: 1358 [2019-09-10 03:27:48,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:48,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-09-10 03:27:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1350. [2019-09-10 03:27:48,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-09-10 03:27:48,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1864 transitions. [2019-09-10 03:27:48,120 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1864 transitions. Word has length 176 [2019-09-10 03:27:48,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:48,120 INFO L475 AbstractCegarLoop]: Abstraction has 1350 states and 1864 transitions. [2019-09-10 03:27:48,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:27:48,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1864 transitions. [2019-09-10 03:27:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:48,122 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:48,122 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:48,122 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -744652496, now seen corresponding path program 1 times [2019-09-10 03:27:48,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:48,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:48,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:48,199 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-10 03:27:48,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:48,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:48,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:48,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:48,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:48,204 INFO L87 Difference]: Start difference. First operand 1350 states and 1864 transitions. Second operand 6 states. [2019-09-10 03:27:48,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:48,243 INFO L93 Difference]: Finished difference Result 1388 states and 1920 transitions. [2019-09-10 03:27:48,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:48,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:48,252 INFO L225 Difference]: With dead ends: 1388 [2019-09-10 03:27:48,253 INFO L226 Difference]: Without dead ends: 1388 [2019-09-10 03:27:48,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2019-09-10 03:27:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1360. [2019-09-10 03:27:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-09-10 03:27:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1872 transitions. [2019-09-10 03:27:48,298 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1872 transitions. Word has length 176 [2019-09-10 03:27:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:48,298 INFO L475 AbstractCegarLoop]: Abstraction has 1360 states and 1872 transitions. [2019-09-10 03:27:48,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1872 transitions. [2019-09-10 03:27:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:48,300 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:48,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:48,301 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 822105454, now seen corresponding path program 1 times [2019-09-10 03:27:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:48,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:48,387 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-10 03:27:48,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:48,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:48,388 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:48,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:48,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:48,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:48,389 INFO L87 Difference]: Start difference. First operand 1360 states and 1872 transitions. Second operand 6 states. [2019-09-10 03:27:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:48,423 INFO L93 Difference]: Finished difference Result 1424 states and 1969 transitions. [2019-09-10 03:27:48,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:48,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:48,431 INFO L225 Difference]: With dead ends: 1424 [2019-09-10 03:27:48,431 INFO L226 Difference]: Without dead ends: 1424 [2019-09-10 03:27:48,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-09-10 03:27:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1380. [2019-09-10 03:27:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-09-10 03:27:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1892 transitions. [2019-09-10 03:27:48,472 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1892 transitions. Word has length 176 [2019-09-10 03:27:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:48,473 INFO L475 AbstractCegarLoop]: Abstraction has 1380 states and 1892 transitions. [2019-09-10 03:27:48,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1892 transitions. [2019-09-10 03:27:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:48,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:48,475 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:48,475 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:48,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1088937104, now seen corresponding path program 1 times [2019-09-10 03:27:48,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:48,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:48,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:48,692 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-10 03:27:48,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:48,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:48,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:48,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:48,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:48,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:48,695 INFO L87 Difference]: Start difference. First operand 1380 states and 1892 transitions. Second operand 6 states. [2019-09-10 03:27:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:48,742 INFO L93 Difference]: Finished difference Result 1432 states and 1969 transitions. [2019-09-10 03:27:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:48,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:48,756 INFO L225 Difference]: With dead ends: 1432 [2019-09-10 03:27:48,756 INFO L226 Difference]: Without dead ends: 1432 [2019-09-10 03:27:48,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-09-10 03:27:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1400. [2019-09-10 03:27:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-09-10 03:27:48,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1912 transitions. [2019-09-10 03:27:48,810 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1912 transitions. Word has length 176 [2019-09-10 03:27:48,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:48,811 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 1912 transitions. [2019-09-10 03:27:48,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1912 transitions. [2019-09-10 03:27:48,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:48,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:48,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:48,814 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:48,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:48,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1143330002, now seen corresponding path program 1 times [2019-09-10 03:27:48,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:48,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:48,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:48,945 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-10 03:27:48,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:48,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:27:48,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:48,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:27:48,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:27:48,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:48,948 INFO L87 Difference]: Start difference. First operand 1400 states and 1912 transitions. Second operand 4 states. [2019-09-10 03:27:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:49,392 INFO L93 Difference]: Finished difference Result 2748 states and 3745 transitions. [2019-09-10 03:27:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:27:49,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 03:27:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:49,406 INFO L225 Difference]: With dead ends: 2748 [2019-09-10 03:27:49,406 INFO L226 Difference]: Without dead ends: 2748 [2019-09-10 03:27:49,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2019-09-10 03:27:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2736. [2019-09-10 03:27:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2019-09-10 03:27:49,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3734 transitions. [2019-09-10 03:27:49,478 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3734 transitions. Word has length 176 [2019-09-10 03:27:49,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:49,478 INFO L475 AbstractCegarLoop]: Abstraction has 2736 states and 3734 transitions. [2019-09-10 03:27:49,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:27:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3734 transitions. [2019-09-10 03:27:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:49,480 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:49,480 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:49,480 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash -114797841, now seen corresponding path program 1 times [2019-09-10 03:27:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:49,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:49,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:49,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:49,561 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-10 03:27:49,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:49,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:49,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:49,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:49,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:49,564 INFO L87 Difference]: Start difference. First operand 2736 states and 3734 transitions. Second operand 6 states. [2019-09-10 03:27:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:49,605 INFO L93 Difference]: Finished difference Result 2776 states and 3786 transitions. [2019-09-10 03:27:49,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:49,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:49,620 INFO L225 Difference]: With dead ends: 2776 [2019-09-10 03:27:49,620 INFO L226 Difference]: Without dead ends: 2776 [2019-09-10 03:27:49,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-09-10 03:27:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2756. [2019-09-10 03:27:49,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2019-09-10 03:27:49,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3750 transitions. [2019-09-10 03:27:49,701 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3750 transitions. Word has length 176 [2019-09-10 03:27:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:49,702 INFO L475 AbstractCegarLoop]: Abstraction has 2756 states and 3750 transitions. [2019-09-10 03:27:49,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3750 transitions. [2019-09-10 03:27:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:49,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:49,704 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:49,705 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:49,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1271987569, now seen corresponding path program 1 times [2019-09-10 03:27:49,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:49,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:49,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:49,795 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-10 03:27:49,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:49,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:27:49,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:49,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:27:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:27:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:49,797 INFO L87 Difference]: Start difference. First operand 2756 states and 3750 transitions. Second operand 4 states. [2019-09-10 03:27:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:50,242 INFO L93 Difference]: Finished difference Result 5436 states and 7391 transitions. [2019-09-10 03:27:50,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:27:50,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-10 03:27:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:50,293 INFO L225 Difference]: With dead ends: 5436 [2019-09-10 03:27:50,293 INFO L226 Difference]: Without dead ends: 5436 [2019-09-10 03:27:50,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:27:50,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-09-10 03:27:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5416. [2019-09-10 03:27:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5416 states. [2019-09-10 03:27:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5416 states to 5416 states and 7372 transitions. [2019-09-10 03:27:50,509 INFO L78 Accepts]: Start accepts. Automaton has 5416 states and 7372 transitions. Word has length 176 [2019-09-10 03:27:50,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:50,510 INFO L475 AbstractCegarLoop]: Abstraction has 5416 states and 7372 transitions. [2019-09-10 03:27:50,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:27:50,510 INFO L276 IsEmpty]: Start isEmpty. Operand 5416 states and 7372 transitions. [2019-09-10 03:27:50,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:50,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:50,512 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:50,512 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:50,513 INFO L82 PathProgramCache]: Analyzing trace with hash 570419344, now seen corresponding path program 1 times [2019-09-10 03:27:50,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:50,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:50,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:50,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:50,593 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-10 03:27:50,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:50,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:27:50,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:50,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:27:50,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:27:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:50,594 INFO L87 Difference]: Start difference. First operand 5416 states and 7372 transitions. Second operand 6 states. [2019-09-10 03:27:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:50,652 INFO L93 Difference]: Finished difference Result 5472 states and 7436 transitions. [2019-09-10 03:27:50,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:50,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-10 03:27:50,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:50,674 INFO L225 Difference]: With dead ends: 5472 [2019-09-10 03:27:50,675 INFO L226 Difference]: Without dead ends: 5472 [2019-09-10 03:27:50,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2019-09-10 03:27:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5456. [2019-09-10 03:27:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5456 states. [2019-09-10 03:27:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5456 states to 5456 states and 7404 transitions. [2019-09-10 03:27:50,801 INFO L78 Accepts]: Start accepts. Automaton has 5456 states and 7404 transitions. Word has length 176 [2019-09-10 03:27:50,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:50,801 INFO L475 AbstractCegarLoop]: Abstraction has 5456 states and 7404 transitions. [2019-09-10 03:27:50,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:27:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 5456 states and 7404 transitions. [2019-09-10 03:27:50,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:50,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:50,803 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:50,803 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:50,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:50,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1796275250, now seen corresponding path program 1 times [2019-09-10 03:27:50,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:50,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:50,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:50,805 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:50,937 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-10 03:27:50,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:50,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:50,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:50,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:50,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:50,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:50,939 INFO L87 Difference]: Start difference. First operand 5456 states and 7404 transitions. Second operand 5 states. [2019-09-10 03:27:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:51,877 INFO L93 Difference]: Finished difference Result 8032 states and 10733 transitions. [2019-09-10 03:27:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:51,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:51,920 INFO L225 Difference]: With dead ends: 8032 [2019-09-10 03:27:51,920 INFO L226 Difference]: Without dead ends: 8032 [2019-09-10 03:27:51,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-09-10 03:27:52,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7472. [2019-09-10 03:27:52,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-10 03:27:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9692 transitions. [2019-09-10 03:27:52,091 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9692 transitions. Word has length 176 [2019-09-10 03:27:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:52,092 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9692 transitions. [2019-09-10 03:27:52,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9692 transitions. [2019-09-10 03:27:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:52,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:52,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:52,096 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1548128756, now seen corresponding path program 1 times [2019-09-10 03:27:52,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:52,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:52,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:52,197 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-10 03:27:52,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:52,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:52,197 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:52,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:52,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:52,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:52,199 INFO L87 Difference]: Start difference. First operand 7472 states and 9692 transitions. Second operand 5 states. [2019-09-10 03:27:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:53,008 INFO L93 Difference]: Finished difference Result 7472 states and 9660 transitions. [2019-09-10 03:27:53,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:53,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:53,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:53,043 INFO L225 Difference]: With dead ends: 7472 [2019-09-10 03:27:53,043 INFO L226 Difference]: Without dead ends: 7472 [2019-09-10 03:27:53,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-09-10 03:27:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-09-10 03:27:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-10 03:27:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9660 transitions. [2019-09-10 03:27:53,244 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9660 transitions. Word has length 176 [2019-09-10 03:27:53,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:53,245 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9660 transitions. [2019-09-10 03:27:53,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:53,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9660 transitions. [2019-09-10 03:27:53,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:53,246 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:53,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:53,247 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:53,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:53,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1124482034, now seen corresponding path program 1 times [2019-09-10 03:27:53,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:53,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:53,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:53,345 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-10 03:27:53,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:53,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:53,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:53,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:53,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:53,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:53,350 INFO L87 Difference]: Start difference. First operand 7472 states and 9660 transitions. Second operand 5 states. [2019-09-10 03:27:54,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:54,004 INFO L93 Difference]: Finished difference Result 7472 states and 9628 transitions. [2019-09-10 03:27:54,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:54,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:54,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:54,027 INFO L225 Difference]: With dead ends: 7472 [2019-09-10 03:27:54,027 INFO L226 Difference]: Without dead ends: 7472 [2019-09-10 03:27:54,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-09-10 03:27:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-09-10 03:27:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-10 03:27:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9628 transitions. [2019-09-10 03:27:54,168 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9628 transitions. Word has length 176 [2019-09-10 03:27:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:54,169 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9628 transitions. [2019-09-10 03:27:54,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9628 transitions. [2019-09-10 03:27:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:54,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:54,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:54,171 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:54,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:54,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1798677964, now seen corresponding path program 1 times [2019-09-10 03:27:54,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:54,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:54,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:54,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:54,264 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-10 03:27:54,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:54,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:54,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:54,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:54,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:54,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:54,266 INFO L87 Difference]: Start difference. First operand 7472 states and 9628 transitions. Second operand 5 states. [2019-09-10 03:27:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:55,191 INFO L93 Difference]: Finished difference Result 10386 states and 13347 transitions. [2019-09-10 03:27:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:27:55,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:55,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:55,221 INFO L225 Difference]: With dead ends: 10386 [2019-09-10 03:27:55,222 INFO L226 Difference]: Without dead ends: 10386 [2019-09-10 03:27:55,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:27:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2019-09-10 03:27:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 10098. [2019-09-10 03:27:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-10 03:27:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12802 transitions. [2019-09-10 03:27:55,434 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12802 transitions. Word has length 176 [2019-09-10 03:27:55,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:55,434 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12802 transitions. [2019-09-10 03:27:55,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12802 transitions. [2019-09-10 03:27:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:55,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:55,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:55,438 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash -46689202, now seen corresponding path program 1 times [2019-09-10 03:27:55,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:55,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:55,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:55,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:55,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:55,574 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-10 03:27:55,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:55,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:55,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:55,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:55,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:55,576 INFO L87 Difference]: Start difference. First operand 10098 states and 12802 transitions. Second operand 5 states. [2019-09-10 03:27:56,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:56,316 INFO L93 Difference]: Finished difference Result 10098 states and 12754 transitions. [2019-09-10 03:27:56,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:56,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:56,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:56,350 INFO L225 Difference]: With dead ends: 10098 [2019-09-10 03:27:56,350 INFO L226 Difference]: Without dead ends: 10098 [2019-09-10 03:27:56,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-10 03:27:56,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-10 03:27:56,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-10 03:27:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12754 transitions. [2019-09-10 03:27:56,507 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12754 transitions. Word has length 176 [2019-09-10 03:27:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:56,508 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12754 transitions. [2019-09-10 03:27:56,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12754 transitions. [2019-09-10 03:27:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:56,510 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:56,510 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:56,510 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:56,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:56,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1076048500, now seen corresponding path program 1 times [2019-09-10 03:27:56,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:56,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:56,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:56,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:56,636 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-10 03:27:56,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:56,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:56,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:56,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:56,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:56,639 INFO L87 Difference]: Start difference. First operand 10098 states and 12754 transitions. Second operand 5 states. [2019-09-10 03:27:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:57,562 INFO L93 Difference]: Finished difference Result 10098 states and 12706 transitions. [2019-09-10 03:27:57,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:57,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:57,586 INFO L225 Difference]: With dead ends: 10098 [2019-09-10 03:27:57,587 INFO L226 Difference]: Without dead ends: 10098 [2019-09-10 03:27:57,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-10 03:27:57,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-10 03:27:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-10 03:27:57,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12706 transitions. [2019-09-10 03:27:57,735 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12706 transitions. Word has length 176 [2019-09-10 03:27:57,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:57,736 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12706 transitions. [2019-09-10 03:27:57,736 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:57,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12706 transitions. [2019-09-10 03:27:57,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:57,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:57,737 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:57,738 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:57,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:57,738 INFO L82 PathProgramCache]: Analyzing trace with hash -416516978, now seen corresponding path program 1 times [2019-09-10 03:27:57,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:57,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:57,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:57,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:57,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:57,835 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-10 03:27:57,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:57,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:57,836 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:57,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:57,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:57,838 INFO L87 Difference]: Start difference. First operand 10098 states and 12706 transitions. Second operand 5 states. [2019-09-10 03:27:58,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:58,488 INFO L93 Difference]: Finished difference Result 10098 states and 12658 transitions. [2019-09-10 03:27:58,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:58,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:58,513 INFO L225 Difference]: With dead ends: 10098 [2019-09-10 03:27:58,513 INFO L226 Difference]: Without dead ends: 10098 [2019-09-10 03:27:58,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:58,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-10 03:27:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-10 03:27:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-10 03:27:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12658 transitions. [2019-09-10 03:27:58,675 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12658 transitions. Word has length 176 [2019-09-10 03:27:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:58,678 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12658 transitions. [2019-09-10 03:27:58,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:58,678 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12658 transitions. [2019-09-10 03:27:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:58,680 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:58,680 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:58,680 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -810883764, now seen corresponding path program 1 times [2019-09-10 03:27:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:58,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:58,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:58,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:58,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:58,814 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-10 03:27:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:58,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:58,815 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:58,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:58,816 INFO L87 Difference]: Start difference. First operand 10098 states and 12658 transitions. Second operand 5 states. [2019-09-10 03:27:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:27:59,569 INFO L93 Difference]: Finished difference Result 10098 states and 12610 transitions. [2019-09-10 03:27:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:27:59,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:27:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:27:59,600 INFO L225 Difference]: With dead ends: 10098 [2019-09-10 03:27:59,601 INFO L226 Difference]: Without dead ends: 10098 [2019-09-10 03:27:59,601 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:27:59,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-10 03:27:59,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-10 03:27:59,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-10 03:27:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12610 transitions. [2019-09-10 03:27:59,761 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12610 transitions. Word has length 176 [2019-09-10 03:27:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:27:59,761 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12610 transitions. [2019-09-10 03:27:59,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:27:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12610 transitions. [2019-09-10 03:27:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:27:59,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:27:59,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:27:59,766 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:27:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:27:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1240100234, now seen corresponding path program 1 times [2019-09-10 03:27:59,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:27:59,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:59,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:27:59,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:27:59,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:27:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:27:59,888 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-10 03:27:59,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:27:59,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:27:59,889 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:27:59,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:27:59,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:27:59,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:27:59,890 INFO L87 Difference]: Start difference. First operand 10098 states and 12610 transitions. Second operand 5 states. [2019-09-10 03:28:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:01,019 INFO L93 Difference]: Finished difference Result 12298 states and 15414 transitions. [2019-09-10 03:28:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:01,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:01,062 INFO L225 Difference]: With dead ends: 12298 [2019-09-10 03:28:01,062 INFO L226 Difference]: Without dead ends: 12298 [2019-09-10 03:28:01,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12298 states. [2019-09-10 03:28:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12298 to 10946. [2019-09-10 03:28:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10946 states. [2019-09-10 03:28:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10946 states to 10946 states and 13482 transitions. [2019-09-10 03:28:01,259 INFO L78 Accepts]: Start accepts. Automaton has 10946 states and 13482 transitions. Word has length 176 [2019-09-10 03:28:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:01,259 INFO L475 AbstractCegarLoop]: Abstraction has 10946 states and 13482 transitions. [2019-09-10 03:28:01,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 10946 states and 13482 transitions. [2019-09-10 03:28:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:01,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:01,261 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:01,262 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:01,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1167713676, now seen corresponding path program 1 times [2019-09-10 03:28:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:01,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:01,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:01,349 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-10 03:28:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:01,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:01,350 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:01,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:01,351 INFO L87 Difference]: Start difference. First operand 10946 states and 13482 transitions. Second operand 5 states. [2019-09-10 03:28:02,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:02,517 INFO L93 Difference]: Finished difference Result 13598 states and 17225 transitions. [2019-09-10 03:28:02,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:02,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:02,565 INFO L225 Difference]: With dead ends: 13598 [2019-09-10 03:28:02,565 INFO L226 Difference]: Without dead ends: 13598 [2019-09-10 03:28:02,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13598 states. [2019-09-10 03:28:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13598 to 12742. [2019-09-10 03:28:02,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12742 states. [2019-09-10 03:28:02,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12742 states to 12742 states and 15454 transitions. [2019-09-10 03:28:02,856 INFO L78 Accepts]: Start accepts. Automaton has 12742 states and 15454 transitions. Word has length 176 [2019-09-10 03:28:02,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:02,857 INFO L475 AbstractCegarLoop]: Abstraction has 12742 states and 15454 transitions. [2019-09-10 03:28:02,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 12742 states and 15454 transitions. [2019-09-10 03:28:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:02,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:02,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:02,860 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:02,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1442473290, now seen corresponding path program 1 times [2019-09-10 03:28:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:02,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:02,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:02,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:02,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:03,012 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-10 03:28:03,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:03,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:03,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:03,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:03,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:03,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:03,014 INFO L87 Difference]: Start difference. First operand 12742 states and 15454 transitions. Second operand 5 states. [2019-09-10 03:28:04,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:04,450 INFO L93 Difference]: Finished difference Result 20460 states and 24978 transitions. [2019-09-10 03:28:04,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:28:04,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:04,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:04,518 INFO L225 Difference]: With dead ends: 20460 [2019-09-10 03:28:04,518 INFO L226 Difference]: Without dead ends: 20460 [2019-09-10 03:28:04,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 03:28:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20460 states. [2019-09-10 03:28:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20460 to 17194. [2019-09-10 03:28:04,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-09-10 03:28:04,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 20646 transitions. [2019-09-10 03:28:04,925 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 20646 transitions. Word has length 176 [2019-09-10 03:28:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:04,926 INFO L475 AbstractCegarLoop]: Abstraction has 17194 states and 20646 transitions. [2019-09-10 03:28:04,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 20646 transitions. [2019-09-10 03:28:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 03:28:04,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:04,930 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:04,931 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash -773030042, now seen corresponding path program 1 times [2019-09-10 03:28:04,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:04,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:04,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:04,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:05,047 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-10 03:28:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:05,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:05,048 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:05,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:05,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:05,050 INFO L87 Difference]: Start difference. First operand 17194 states and 20646 transitions. Second operand 5 states. [2019-09-10 03:28:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:05,858 INFO L93 Difference]: Finished difference Result 13814 states and 16882 transitions. [2019-09-10 03:28:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:28:05,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-09-10 03:28:05,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:05,891 INFO L225 Difference]: With dead ends: 13814 [2019-09-10 03:28:05,891 INFO L226 Difference]: Without dead ends: 13814 [2019-09-10 03:28:05,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:28:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2019-09-10 03:28:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 13390. [2019-09-10 03:28:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13390 states. [2019-09-10 03:28:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13390 states to 13390 states and 16014 transitions. [2019-09-10 03:28:06,084 INFO L78 Accepts]: Start accepts. Automaton has 13390 states and 16014 transitions. Word has length 177 [2019-09-10 03:28:06,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:06,085 INFO L475 AbstractCegarLoop]: Abstraction has 13390 states and 16014 transitions. [2019-09-10 03:28:06,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 13390 states and 16014 transitions. [2019-09-10 03:28:06,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:06,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:06,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:06,087 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:06,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:06,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2144073164, now seen corresponding path program 1 times [2019-09-10 03:28:06,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:06,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:06,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:06,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:06,188 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-10 03:28:06,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:06,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:06,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:06,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:06,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:06,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:06,190 INFO L87 Difference]: Start difference. First operand 13390 states and 16014 transitions. Second operand 5 states. [2019-09-10 03:28:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:07,264 INFO L93 Difference]: Finished difference Result 16902 states and 20649 transitions. [2019-09-10 03:28:07,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:07,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:07,304 INFO L225 Difference]: With dead ends: 16902 [2019-09-10 03:28:07,304 INFO L226 Difference]: Without dead ends: 16902 [2019-09-10 03:28:07,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-09-10 03:28:07,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14854. [2019-09-10 03:28:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14854 states. [2019-09-10 03:28:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14854 states to 14854 states and 17526 transitions. [2019-09-10 03:28:07,585 INFO L78 Accepts]: Start accepts. Automaton has 14854 states and 17526 transitions. Word has length 176 [2019-09-10 03:28:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:07,586 INFO L475 AbstractCegarLoop]: Abstraction has 14854 states and 17526 transitions. [2019-09-10 03:28:07,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14854 states and 17526 transitions. [2019-09-10 03:28:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:07,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:07,589 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:07,589 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:07,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2128261878, now seen corresponding path program 1 times [2019-09-10 03:28:07,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:07,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:07,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:07,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:07,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:07,688 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-10 03:28:07,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:07,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:07,689 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:07,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:07,690 INFO L87 Difference]: Start difference. First operand 14854 states and 17526 transitions. Second operand 5 states. [2019-09-10 03:28:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:08,730 INFO L93 Difference]: Finished difference Result 17270 states and 20929 transitions. [2019-09-10 03:28:08,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:08,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:08,774 INFO L225 Difference]: With dead ends: 17270 [2019-09-10 03:28:08,774 INFO L226 Difference]: Without dead ends: 17270 [2019-09-10 03:28:08,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17270 states. [2019-09-10 03:28:08,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17270 to 16350. [2019-09-10 03:28:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-09-10 03:28:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 19078 transitions. [2019-09-10 03:28:09,028 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 19078 transitions. Word has length 176 [2019-09-10 03:28:09,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:09,028 INFO L475 AbstractCegarLoop]: Abstraction has 16350 states and 19078 transitions. [2019-09-10 03:28:09,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:09,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 19078 transitions. [2019-09-10 03:28:09,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:09,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:09,033 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:09,034 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:09,034 INFO L82 PathProgramCache]: Analyzing trace with hash -742058484, now seen corresponding path program 1 times [2019-09-10 03:28:09,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:09,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:09,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:09,121 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-10 03:28:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:09,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:09,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:09,122 INFO L87 Difference]: Start difference. First operand 16350 states and 19078 transitions. Second operand 5 states. [2019-09-10 03:28:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:10,101 INFO L93 Difference]: Finished difference Result 17474 states and 20510 transitions. [2019-09-10 03:28:10,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:10,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:10,130 INFO L225 Difference]: With dead ends: 17474 [2019-09-10 03:28:10,131 INFO L226 Difference]: Without dead ends: 17474 [2019-09-10 03:28:10,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:10,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17474 states. [2019-09-10 03:28:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17474 to 16698. [2019-09-10 03:28:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16698 states. [2019-09-10 03:28:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16698 states to 16698 states and 19250 transitions. [2019-09-10 03:28:10,351 INFO L78 Accepts]: Start accepts. Automaton has 16698 states and 19250 transitions. Word has length 176 [2019-09-10 03:28:10,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:10,351 INFO L475 AbstractCegarLoop]: Abstraction has 16698 states and 19250 transitions. [2019-09-10 03:28:10,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:10,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16698 states and 19250 transitions. [2019-09-10 03:28:10,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:10,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:10,353 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:10,354 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:10,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:10,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1251531574, now seen corresponding path program 1 times [2019-09-10 03:28:10,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:10,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:10,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:10,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:10,442 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-10 03:28:10,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:10,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:10,443 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:10,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:10,444 INFO L87 Difference]: Start difference. First operand 16698 states and 19250 transitions. Second operand 5 states. [2019-09-10 03:28:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:11,476 INFO L93 Difference]: Finished difference Result 18934 states and 22401 transitions. [2019-09-10 03:28:11,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:11,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:11,512 INFO L225 Difference]: With dead ends: 18934 [2019-09-10 03:28:11,512 INFO L226 Difference]: Without dead ends: 18934 [2019-09-10 03:28:11,512 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2019-09-10 03:28:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 18014. [2019-09-10 03:28:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18014 states. [2019-09-10 03:28:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18014 states to 18014 states and 20550 transitions. [2019-09-10 03:28:11,730 INFO L78 Accepts]: Start accepts. Automaton has 18014 states and 20550 transitions. Word has length 176 [2019-09-10 03:28:11,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:11,730 INFO L475 AbstractCegarLoop]: Abstraction has 18014 states and 20550 transitions. [2019-09-10 03:28:11,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 18014 states and 20550 transitions. [2019-09-10 03:28:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:11,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:11,733 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:11,733 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1189491960, now seen corresponding path program 1 times [2019-09-10 03:28:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:11,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:11,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:11,817 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-10 03:28:11,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:11,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:28:11,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:11,818 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:28:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:28:11,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:28:11,819 INFO L87 Difference]: Start difference. First operand 18014 states and 20550 transitions. Second operand 5 states. [2019-09-10 03:28:12,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:12,693 INFO L93 Difference]: Finished difference Result 18906 states and 21754 transitions. [2019-09-10 03:28:12,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:28:12,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-10 03:28:12,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:12,723 INFO L225 Difference]: With dead ends: 18906 [2019-09-10 03:28:12,723 INFO L226 Difference]: Without dead ends: 18906 [2019-09-10 03:28:12,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:28:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18906 states. [2019-09-10 03:28:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18906 to 18478. [2019-09-10 03:28:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18478 states. [2019-09-10 03:28:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18478 states to 18478 states and 20882 transitions. [2019-09-10 03:28:12,924 INFO L78 Accepts]: Start accepts. Automaton has 18478 states and 20882 transitions. Word has length 176 [2019-09-10 03:28:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:12,924 INFO L475 AbstractCegarLoop]: Abstraction has 18478 states and 20882 transitions. [2019-09-10 03:28:12,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:28:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18478 states and 20882 transitions. [2019-09-10 03:28:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-10 03:28:12,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:12,926 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:12,926 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:12,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1048943350, now seen corresponding path program 1 times [2019-09-10 03:28:12,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:12,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:12,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:12,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:12,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:12,998 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-10 03:28:12,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:28:12,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:12,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:28:13,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:28:13,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:28:13,000 INFO L87 Difference]: Start difference. First operand 18478 states and 20882 transitions. Second operand 3 states. [2019-09-10 03:28:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:13,112 INFO L93 Difference]: Finished difference Result 36562 states and 41869 transitions. [2019-09-10 03:28:13,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:28:13,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-10 03:28:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:13,179 INFO L225 Difference]: With dead ends: 36562 [2019-09-10 03:28:13,180 INFO L226 Difference]: Without dead ends: 36562 [2019-09-10 03:28:13,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:28:13,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36562 states. [2019-09-10 03:28:13,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36562 to 36546. [2019-09-10 03:28:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36546 states. [2019-09-10 03:28:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36546 states to 36546 states and 41853 transitions. [2019-09-10 03:28:13,677 INFO L78 Accepts]: Start accepts. Automaton has 36546 states and 41853 transitions. Word has length 176 [2019-09-10 03:28:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:13,677 INFO L475 AbstractCegarLoop]: Abstraction has 36546 states and 41853 transitions. [2019-09-10 03:28:13,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:28:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 36546 states and 41853 transitions. [2019-09-10 03:28:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-10 03:28:13,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:13,721 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:13,721 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:13,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -673960349, now seen corresponding path program 1 times [2019-09-10 03:28:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:13,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:13,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:13,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:13,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-10 03:28:13,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:28:13,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:28:13,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:13,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:28:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:28:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:28:13,825 INFO L87 Difference]: Start difference. First operand 36546 states and 41853 transitions. Second operand 4 states. [2019-09-10 03:28:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:14,260 INFO L93 Difference]: Finished difference Result 61805 states and 70574 transitions. [2019-09-10 03:28:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:28:14,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-09-10 03:28:14,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:14,387 INFO L225 Difference]: With dead ends: 61805 [2019-09-10 03:28:14,387 INFO L226 Difference]: Without dead ends: 45362 [2019-09-10 03:28:14,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:28:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45362 states. [2019-09-10 03:28:16,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45362 to 44430. [2019-09-10 03:28:16,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44430 states. [2019-09-10 03:28:16,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44430 states to 44430 states and 50326 transitions. [2019-09-10 03:28:16,106 INFO L78 Accepts]: Start accepts. Automaton has 44430 states and 50326 transitions. Word has length 291 [2019-09-10 03:28:16,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:16,106 INFO L475 AbstractCegarLoop]: Abstraction has 44430 states and 50326 transitions. [2019-09-10 03:28:16,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:28:16,107 INFO L276 IsEmpty]: Start isEmpty. Operand 44430 states and 50326 transitions. [2019-09-10 03:28:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-09-10 03:28:16,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:16,195 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:28:16,195 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash -242940940, now seen corresponding path program 1 times [2019-09-10 03:28:16,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:16,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:16,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:16,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2019-09-10 03:28:16,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:16,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:16,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 588 with the following transitions: [2019-09-10 03:28:16,425 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [598], [601], [606], [608], [609], [612], [656], [657], [658], [661], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [986], [999], [1012], [1025], [1038], [1051], [1064], [1077], [1081], [1084], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:28:16,508 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:16,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:16,883 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:28:16,885 INFO L272 AbstractInterpreter]: Visited 189 different actions 275 times. Never merged. Never widened. Performed 1807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 112 variables. [2019-09-10 03:28:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:16,890 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:28:17,513 INFO L227 lantSequenceWeakener]: Weakened 302 states. On average, predicates are now at 69.93% of their original sizes. [2019-09-10 03:28:17,513 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:28:26,105 INFO L420 sIntCurrentIteration]: We unified 586 AI predicates to 586 [2019-09-10 03:28:26,106 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:28:26,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:28:26,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [3] total 108 [2019-09-10 03:28:26,107 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:26,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-10 03:28:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-10 03:28:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=10896, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 03:28:26,113 INFO L87 Difference]: Start difference. First operand 44430 states and 50326 transitions. Second operand 107 states. [2019-09-10 03:30:10,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:30:10,315 INFO L93 Difference]: Finished difference Result 46507 states and 53046 transitions. [2019-09-10 03:30:10,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-10 03:30:10,316 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 587 [2019-09-10 03:30:10,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:30:10,404 INFO L225 Difference]: With dead ends: 46507 [2019-09-10 03:30:10,404 INFO L226 Difference]: Without dead ends: 46507 [2019-09-10 03:30:10,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18900 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=3275, Invalid=56017, Unknown=0, NotChecked=0, Total=59292 [2019-09-10 03:30:10,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46507 states. [2019-09-10 03:30:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46507 to 46262. [2019-09-10 03:30:11,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46262 states. [2019-09-10 03:30:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46262 states to 46262 states and 52768 transitions. [2019-09-10 03:30:11,124 INFO L78 Accepts]: Start accepts. Automaton has 46262 states and 52768 transitions. Word has length 587 [2019-09-10 03:30:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:30:11,124 INFO L475 AbstractCegarLoop]: Abstraction has 46262 states and 52768 transitions. [2019-09-10 03:30:11,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-10 03:30:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 46262 states and 52768 transitions. [2019-09-10 03:30:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-10 03:30:11,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:30:11,167 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:30:11,167 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:30:11,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:11,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1931184858, now seen corresponding path program 1 times [2019-09-10 03:30:11,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:30:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:11,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:30:11,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:30:11,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:30:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:30:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-10 03:30:11,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:30:11,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:30:11,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 425 with the following transitions: [2019-09-10 03:30:11,364 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [39], [41], [43], [44], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [598], [601], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [666], [668], [670], [672], [673], [674], [677], [682], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [977], [980], [986], [990], [993], [999], [1012], [1025], [1038], [1051], [1064], [1077], [1081], [1084], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1162], [1163], [1178], [1179], [1180], [1181], [1182], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1216], [1217], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1262], [1263], [1264] [2019-09-10 03:30:11,379 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:30:11,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:30:11,600 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:30:11,602 INFO L272 AbstractInterpreter]: Visited 199 different actions 286 times. Never merged. Never widened. Performed 1921 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1921 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 112 variables. [2019-09-10 03:30:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:30:11,603 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:30:11,970 INFO L227 lantSequenceWeakener]: Weakened 298 states. On average, predicates are now at 71.73% of their original sizes. [2019-09-10 03:30:11,970 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:30:22,624 INFO L420 sIntCurrentIteration]: We unified 423 AI predicates to 423 [2019-09-10 03:30:22,624 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:30:22,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:30:22,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [129] imperfect sequences [5] total 132 [2019-09-10 03:30:22,625 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:30:22,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-09-10 03:30:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-09-10 03:30:22,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1265, Invalid=15247, Unknown=0, NotChecked=0, Total=16512 [2019-09-10 03:30:22,629 INFO L87 Difference]: Start difference. First operand 46262 states and 52768 transitions. Second operand 129 states. [2019-09-10 03:32:48,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:48,372 INFO L93 Difference]: Finished difference Result 46937 states and 53518 transitions. [2019-09-10 03:32:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-09-10 03:32:48,373 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 424 [2019-09-10 03:32:48,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:48,444 INFO L225 Difference]: With dead ends: 46937 [2019-09-10 03:32:48,444 INFO L226 Difference]: Without dead ends: 46937 [2019-09-10 03:32:48,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22223 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=4958, Invalid=66064, Unknown=0, NotChecked=0, Total=71022 [2019-09-10 03:32:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46937 states. [2019-09-10 03:32:48,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46937 to 46690. [2019-09-10 03:32:48,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46690 states. [2019-09-10 03:32:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46690 states to 46690 states and 53238 transitions. [2019-09-10 03:32:48,928 INFO L78 Accepts]: Start accepts. Automaton has 46690 states and 53238 transitions. Word has length 424 [2019-09-10 03:32:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:48,929 INFO L475 AbstractCegarLoop]: Abstraction has 46690 states and 53238 transitions. [2019-09-10 03:32:48,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-09-10 03:32:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 46690 states and 53238 transitions. [2019-09-10 03:32:48,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-09-10 03:32:48,973 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:48,974 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:48,974 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:48,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1640988600, now seen corresponding path program 1 times [2019-09-10 03:32:48,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:48,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:48,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 29 proven. 5 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-10 03:32:49,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:49,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:32:49,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 424 with the following transitions: [2019-09-10 03:32:49,178 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [598], [601], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [977], [980], [986], [990], [996], [999], [1003], [1009], [1012], [1016], [1022], [1025], [1029], [1035], [1038], [1042], [1048], [1051], [1055], [1061], [1064], [1068], [1074], [1077], [1081], [1084], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1162], [1163], [1178], [1179], [1180], [1181], [1182], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1262], [1263], [1264] [2019-09-10 03:32:49,181 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:32:49,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:32:50,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:32:50,619 INFO L272 AbstractInterpreter]: Visited 230 different actions 2098 times. Merged at 73 different actions 442 times. Widened at 1 different actions 1 times. Performed 18393 root evaluator evaluations with a maximum evaluation depth of 4. Performed 18393 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 29 fixpoints after 8 different actions. Largest state had 114 variables. [2019-09-10 03:32:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:50,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:32:50,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:50,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:32:50,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:50,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:32:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:50,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 2188 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 03:32:50,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:32:51,123 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:32:51,124 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:32:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-09-10 03:32:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:32:51,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-09-10 03:32:51,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:51,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:32:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:32:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:32:51,513 INFO L87 Difference]: Start difference. First operand 46690 states and 53238 transitions. Second operand 3 states. [2019-09-10 03:32:51,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:51,849 INFO L93 Difference]: Finished difference Result 54496 states and 62270 transitions. [2019-09-10 03:32:51,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:32:51,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2019-09-10 03:32:51,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:52,085 INFO L225 Difference]: With dead ends: 54496 [2019-09-10 03:32:52,085 INFO L226 Difference]: Without dead ends: 54496 [2019-09-10 03:32:52,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 847 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:32:52,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54496 states. [2019-09-10 03:32:54,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54496 to 54492. [2019-09-10 03:32:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54492 states. [2019-09-10 03:32:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54492 states to 54492 states and 62267 transitions. [2019-09-10 03:32:54,214 INFO L78 Accepts]: Start accepts. Automaton has 54492 states and 62267 transitions. Word has length 423 [2019-09-10 03:32:54,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:54,215 INFO L475 AbstractCegarLoop]: Abstraction has 54492 states and 62267 transitions. [2019-09-10 03:32:54,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:32:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 54492 states and 62267 transitions. [2019-09-10 03:32:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2019-09-10 03:32:54,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:54,365 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:32:54,366 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash -93531203, now seen corresponding path program 1 times [2019-09-10 03:32:54,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:54,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:54,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:54,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:54,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 1370 trivial. 0 not checked. [2019-09-10 03:32:54,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:54,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:32:54,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 822 with the following transitions: [2019-09-10 03:32:54,976 INFO L207 CegarAbsIntRunner]: [29], [32], [37], [39], [41], [43], [44], [76], [92], [94], [102], [107], [110], [121], [123], [125], [127], [131], [163], [165], [168], [179], [181], [183], [185], [189], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [400], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [588], [590], [593], [598], [601], [604], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [664], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [857], [860], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [983], [986], [990], [996], [999], [1003], [1006], [1012], [1025], [1038], [1042], [1045], [1051], [1064], [1068], [1071], [1077], [1081], [1084], [1090], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1170], [1171], [1174], [1175], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1218], [1219], [1224], [1225], [1228], [1229], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:32:54,979 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:32:54,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:32:55,135 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:32:55,135 INFO L272 AbstractInterpreter]: Visited 207 different actions 310 times. Merged at 6 different actions 6 times. Never widened. Performed 2149 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2149 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 112 variables. [2019-09-10 03:32:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:55,136 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:32:55,625 INFO L227 lantSequenceWeakener]: Weakened 328 states. On average, predicates are now at 68.93% of their original sizes. [2019-09-10 03:32:55,625 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:33:08,652 INFO L420 sIntCurrentIteration]: We unified 820 AI predicates to 820 [2019-09-10 03:33:08,652 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:33:08,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:33:08,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [130] imperfect sequences [5] total 133 [2019-09-10 03:33:08,652 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:08,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-09-10 03:33:08,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-09-10 03:33:08,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=15990, Unknown=0, NotChecked=0, Total=16770 [2019-09-10 03:33:08,656 INFO L87 Difference]: Start difference. First operand 54492 states and 62267 transitions. Second operand 130 states. [2019-09-10 03:35:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:41,317 INFO L93 Difference]: Finished difference Result 54754 states and 62571 transitions. [2019-09-10 03:35:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-09-10 03:35:41,317 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 821 [2019-09-10 03:35:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:41,449 INFO L225 Difference]: With dead ends: 54754 [2019-09-10 03:35:41,449 INFO L226 Difference]: Without dead ends: 54754 [2019-09-10 03:35:41,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 969 GetRequests, 692 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25918 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=4497, Invalid=73065, Unknown=0, NotChecked=0, Total=77562 [2019-09-10 03:35:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54754 states. [2019-09-10 03:35:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54754 to 54524. [2019-09-10 03:35:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54524 states. [2019-09-10 03:35:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54524 states to 54524 states and 62307 transitions. [2019-09-10 03:35:42,319 INFO L78 Accepts]: Start accepts. Automaton has 54524 states and 62307 transitions. Word has length 821 [2019-09-10 03:35:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:42,321 INFO L475 AbstractCegarLoop]: Abstraction has 54524 states and 62307 transitions. [2019-09-10 03:35:42,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-09-10 03:35:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 54524 states and 62307 transitions. [2019-09-10 03:35:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2019-09-10 03:35:42,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:42,433 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:35:42,433 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:42,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:42,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1450724394, now seen corresponding path program 1 times [2019-09-10 03:35:42,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:42,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:42,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 38 proven. 26 refuted. 0 times theorem prover too weak. 966 trivial. 0 not checked. [2019-09-10 03:35:42,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:42,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:35:42,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 707 with the following transitions: [2019-09-10 03:35:42,896 INFO L207 CegarAbsIntRunner]: [29], [32], [37], [39], [41], [43], [44], [163], [165], [168], [179], [181], [183], [185], [189], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [400], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [598], [601], [604], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [664], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [986], [990], [996], [999], [1003], [1009], [1012], [1016], [1022], [1025], [1029], [1035], [1038], [1042], [1048], [1051], [1055], [1061], [1064], [1068], [1071], [1081], [1084], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1174], [1175], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1228], [1229], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:35:42,900 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:35:42,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:35:46,450 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:35:46,450 INFO L272 AbstractInterpreter]: Visited 247 different actions 4749 times. Merged at 86 different actions 1229 times. Widened at 1 different actions 1 times. Performed 52459 root evaluator evaluations with a maximum evaluation depth of 4. Performed 52459 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 80 fixpoints after 14 different actions. Largest state had 114 variables. [2019-09-10 03:35:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:46,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:35:46,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:46,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:35:46,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:46,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:35:46,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:46,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 3173 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:35:46,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:35:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 592 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2019-09-10 03:35:47,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:35:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2019-09-10 03:35:47,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:35:47,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 3] total 9 [2019-09-10 03:35:47,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:47,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:35:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:35:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:35:47,633 INFO L87 Difference]: Start difference. First operand 54524 states and 62307 transitions. Second operand 3 states. [2019-09-10 03:35:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:47,817 INFO L93 Difference]: Finished difference Result 79481 states and 91325 transitions. [2019-09-10 03:35:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:35:47,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 706 [2019-09-10 03:35:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:48,031 INFO L225 Difference]: With dead ends: 79481 [2019-09-10 03:35:48,032 INFO L226 Difference]: Without dead ends: 79481 [2019-09-10 03:35:48,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1415 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:35:48,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79481 states. [2019-09-10 03:35:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79481 to 79477. [2019-09-10 03:35:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79477 states. [2019-09-10 03:35:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79477 states to 79477 states and 91322 transitions. [2019-09-10 03:35:49,139 INFO L78 Accepts]: Start accepts. Automaton has 79477 states and 91322 transitions. Word has length 706 [2019-09-10 03:35:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:49,140 INFO L475 AbstractCegarLoop]: Abstraction has 79477 states and 91322 transitions. [2019-09-10 03:35:49,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:35:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 79477 states and 91322 transitions. [2019-09-10 03:35:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 728 [2019-09-10 03:35:49,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:49,242 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:35:49,243 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1354112215, now seen corresponding path program 1 times [2019-09-10 03:35:49,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:49,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:49,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:49,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:49,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2019-09-10 03:35:49,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:49,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:35:49,782 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 728 with the following transitions: [2019-09-10 03:35:49,783 INFO L207 CegarAbsIntRunner]: [29], [32], [37], [39], [41], [43], [44], [163], [165], [168], [179], [181], [183], [185], [189], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [400], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [598], [601], [604], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [664], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [986], [990], [996], [1003], [1009], [1012], [1016], [1022], [1025], [1029], [1035], [1038], [1042], [1048], [1051], [1055], [1061], [1064], [1068], [1071], [1074], [1081], [1084], [1090], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1174], [1175], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1228], [1229], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:35:49,787 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:35:49,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:35:53,281 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:35:53,282 INFO L272 AbstractInterpreter]: Visited 248 different actions 4796 times. Merged at 88 different actions 1315 times. Widened at 1 different actions 1 times. Performed 48004 root evaluator evaluations with a maximum evaluation depth of 4. Performed 48004 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 118 fixpoints after 18 different actions. Largest state had 114 variables. [2019-09-10 03:35:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:53,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:35:53,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:53,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:35:53,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:53,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:35:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:53,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 3221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-10 03:35:53,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:35:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-09-10 03:35:53,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:35:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-09-10 03:35:54,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:35:54,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 3] total 10 [2019-09-10 03:35:54,461 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:54,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:35:54,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:35:54,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:35:54,462 INFO L87 Difference]: Start difference. First operand 79477 states and 91322 transitions. Second operand 3 states. [2019-09-10 03:35:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:54,806 INFO L93 Difference]: Finished difference Result 127926 states and 149710 transitions. [2019-09-10 03:35:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:35:54,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 727 [2019-09-10 03:35:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:55,182 INFO L225 Difference]: With dead ends: 127926 [2019-09-10 03:35:55,183 INFO L226 Difference]: Without dead ends: 127926 [2019-09-10 03:35:55,183 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1464 GetRequests, 1456 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-10 03:35:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127926 states. [2019-09-10 03:35:56,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127926 to 127922. [2019-09-10 03:35:56,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127922 states. [2019-09-10 03:35:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127922 states to 127922 states and 149707 transitions. [2019-09-10 03:35:57,129 INFO L78 Accepts]: Start accepts. Automaton has 127922 states and 149707 transitions. Word has length 727 [2019-09-10 03:35:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:57,130 INFO L475 AbstractCegarLoop]: Abstraction has 127922 states and 149707 transitions. [2019-09-10 03:35:57,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:35:57,130 INFO L276 IsEmpty]: Start isEmpty. Operand 127922 states and 149707 transitions. [2019-09-10 03:35:57,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 924 [2019-09-10 03:35:57,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:57,289 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:35:57,290 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:57,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:57,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1123576882, now seen corresponding path program 1 times [2019-09-10 03:35:57,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:57,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:57,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 55 proven. 142 refuted. 0 times theorem prover too weak. 1833 trivial. 0 not checked. [2019-09-10 03:36:01,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:36:01,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:36:01,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 924 with the following transitions: [2019-09-10 03:36:01,105 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [37], [39], [41], [43], [44], [49], [52], [63], [65], [67], [69], [73], [76], [92], [94], [102], [163], [165], [168], [179], [181], [183], [185], [189], [194], [197], [208], [210], [212], [214], [218], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [400], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [588], [590], [593], [596], [598], [601], [604], [606], [608], [609], [612], [614], [617], [656], [657], [658], [661], [664], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [857], [860], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [983], [986], [990], [996], [1003], [1006], [1012], [1016], [1019], [1025], [1038], [1051], [1055], [1058], [1064], [1068], [1071], [1077], [1081], [1084], [1090], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1166], [1167], [1174], [1175], [1176], [1177], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1218], [1219], [1220], [1221], [1226], [1227], [1228], [1229], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:36:01,109 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:36:01,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:36:01,237 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:36:01,239 INFO L272 AbstractInterpreter]: Visited 211 different actions 318 times. Merged at 8 different actions 8 times. Never widened. Performed 2264 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2264 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 112 variables. [2019-09-10 03:36:01,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:01,240 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:36:01,594 INFO L227 lantSequenceWeakener]: Weakened 333 states. On average, predicates are now at 69.29% of their original sizes. [2019-09-10 03:36:01,595 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:36:12,687 INFO L420 sIntCurrentIteration]: We unified 922 AI predicates to 922 [2019-09-10 03:36:12,687 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:36:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:36:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [133] imperfect sequences [5] total 136 [2019-09-10 03:36:12,688 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:12,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-09-10 03:36:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-09-10 03:36:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=762, Invalid=16794, Unknown=0, NotChecked=0, Total=17556 [2019-09-10 03:36:12,690 INFO L87 Difference]: Start difference. First operand 127922 states and 149707 transitions. Second operand 133 states. [2019-09-10 03:38:31,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:31,178 INFO L93 Difference]: Finished difference Result 128719 states and 150655 transitions. [2019-09-10 03:38:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-10 03:38:31,178 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 923 [2019-09-10 03:38:31,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:31,407 INFO L225 Difference]: With dead ends: 128719 [2019-09-10 03:38:31,407 INFO L226 Difference]: Without dead ends: 128719 [2019-09-10 03:38:31,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1077 GetRequests, 791 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27483 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=4640, Invalid=78016, Unknown=0, NotChecked=0, Total=82656 [2019-09-10 03:38:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128719 states. [2019-09-10 03:38:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128719 to 128438. [2019-09-10 03:38:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128438 states. [2019-09-10 03:38:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128438 states to 128438 states and 150344 transitions. [2019-09-10 03:38:32,929 INFO L78 Accepts]: Start accepts. Automaton has 128438 states and 150344 transitions. Word has length 923 [2019-09-10 03:38:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:32,930 INFO L475 AbstractCegarLoop]: Abstraction has 128438 states and 150344 transitions. [2019-09-10 03:38:32,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-09-10 03:38:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 128438 states and 150344 transitions. [2019-09-10 03:38:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2019-09-10 03:38:33,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:33,107 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 03:38:33,107 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:33,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1355478685, now seen corresponding path program 1 times [2019-09-10 03:38:33,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 39 proven. 106 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-09-10 03:38:34,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:34,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:34,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 907 with the following transitions: [2019-09-10 03:38:34,317 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [37], [39], [41], [43], [44], [47], [63], [65], [73], [107], [110], [121], [123], [125], [127], [131], [163], [165], [168], [179], [181], [183], [185], [189], [194], [197], [208], [210], [212], [214], [218], [221], [223], [226], [237], [239], [241], [243], [247], [248], [253], [256], [258], [261], [265], [266], [267], [277], [279], [281], [282], [287], [293], [299], [305], [311], [317], [323], [329], [335], [341], [347], [353], [359], [365], [371], [377], [383], [389], [391], [392], [395], [398], [400], [402], [404], [406], [407], [517], [527], [529], [531], [532], [534], [535], [537], [540], [542], [545], [550], [553], [558], [561], [566], [569], [574], [577], [582], [585], [590], [593], [596], [598], [601], [604], [606], [608], [609], [612], [656], [657], [658], [661], [664], [666], [668], [670], [672], [673], [674], [684], [686], [688], [689], [694], [700], [706], [712], [718], [724], [730], [736], [742], [748], [754], [760], [766], [772], [778], [784], [790], [796], [798], [801], [807], [813], [819], [825], [831], [837], [843], [849], [853], [854], [864], [866], [868], [869], [870], [873], [875], [878], [889], [891], [893], [897], [935], [938], [939], [940], [950], [952], [954], [955], [956], [965], [968], [971], [973], [977], [980], [983], [990], [996], [1003], [1009], [1012], [1016], [1019], [1025], [1038], [1042], [1045], [1051], [1055], [1058], [1064], [1068], [1071], [1081], [1084], [1095], [1096], [1106], [1108], [1110], [1111], [1112], [1113], [1127], [1129], [1131], [1133], [1138], [1146], [1149], [1154], [1162], [1163], [1170], [1171], [1174], [1175], [1176], [1177], [1178], [1179], [1180], [1181], [1182], [1184], [1185], [1186], [1187], [1188], [1189], [1190], [1191], [1192], [1193], [1194], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1203], [1204], [1205], [1206], [1207], [1208], [1212], [1213], [1214], [1215], [1220], [1221], [1224], [1225], [1226], [1227], [1228], [1229], [1230], [1231], [1232], [1233], [1234], [1235], [1236], [1237], [1238], [1239], [1240], [1241], [1242], [1243], [1244], [1245], [1246], [1247], [1248], [1249], [1250], [1251], [1252], [1253], [1260], [1261], [1262], [1263], [1264] [2019-09-10 03:38:34,324 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:34,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:34,490 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:34,491 INFO L272 AbstractInterpreter]: Visited 206 different actions 310 times. Merged at 8 different actions 8 times. Never widened. Performed 2157 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2157 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 112 variables. [2019-09-10 03:38:34,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:34,492 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:34,851 INFO L227 lantSequenceWeakener]: Weakened 319 states. On average, predicates are now at 69.43% of their original sizes. [2019-09-10 03:38:34,851 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:45,336 INFO L420 sIntCurrentIteration]: We unified 905 AI predicates to 905 [2019-09-10 03:38:45,336 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:45,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:45,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [126] imperfect sequences [5] total 129 [2019-09-10 03:38:45,336 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:45,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-09-10 03:38:45,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-09-10 03:38:45,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=764, Invalid=14986, Unknown=0, NotChecked=0, Total=15750 [2019-09-10 03:38:45,339 INFO L87 Difference]: Start difference. First operand 128438 states and 150344 transitions. Second operand 126 states.