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/transmitter.10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:47:22,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:47:22,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:47:22,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:47:22,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:47:22,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:47:22,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:47:22,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:47:22,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:47:22,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:47:22,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:47:22,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:47:22,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:47:22,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:47:22,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:47:22,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:47:22,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:47:22,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:47:22,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:47:22,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:47:22,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:47:22,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:47:22,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:47:22,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:47:22,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:47:22,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:47:22,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:47:22,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:47:22,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:47:22,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:47:22,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:47:22,955 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:47:22,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:47:22,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:47:22,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:47:22,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:47:22,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:47:22,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:47:22,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:47:22,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:47:22,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:47:22,962 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:47:22,976 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:47:22,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:47:22,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:47:22,977 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:47:22,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:47:22,977 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:47:22,978 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:47:22,978 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:47:22,978 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:47:22,978 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:47:22,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:47:22,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:47:22,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:47:22,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:47:22,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:47:22,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:47:22,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:47:22,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:47:22,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:47:22,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:47:22,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:47:22,981 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:47:22,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:47:22,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:47:22,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:47:22,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:47:22,982 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:47:22,982 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:47:22,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:47:22,983 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:47:23,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:47:23,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:47:23,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:47:23,028 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:47:23,028 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:47:23,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.10.cil.c [2019-09-10 03:47:23,100 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092300463/546035f1289b43bb8f203cd4d915fa64/FLAGc09c2a226 [2019-09-10 03:47:23,609 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:47:23,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.10.cil.c [2019-09-10 03:47:23,628 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092300463/546035f1289b43bb8f203cd4d915fa64/FLAGc09c2a226 [2019-09-10 03:47:23,944 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/092300463/546035f1289b43bb8f203cd4d915fa64 [2019-09-10 03:47:23,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:47:23,955 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:47:23,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:47:23,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:47:23,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:47:23,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:47:23" (1/1) ... [2019-09-10 03:47:23,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f59eba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:23, skipping insertion in model container [2019-09-10 03:47:23,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:47:23" (1/1) ... [2019-09-10 03:47:23,971 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:47:24,030 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:47:24,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:47:24,420 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:47:24,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:47:24,528 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:47:24,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24 WrapperNode [2019-09-10 03:47:24,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:47:24,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:47:24,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:47:24,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:47:24,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,565 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,593 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (1/1) ... [2019-09-10 03:47:24,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:47:24,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:47:24,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:47:24,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:47:24,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (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:47:24,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:47:24,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:47:24,730 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:47:24,731 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:47:24,731 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:47:24,731 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:47:24,732 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:47:24,732 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:47:24,733 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:47:24,733 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:47:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:47:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:47:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:47:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:47:24,734 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:47:24,735 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:47:24,735 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:47:24,735 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:47:24,735 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:47:24,735 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:47:24,736 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:47:24,736 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:47:24,736 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:47:24,736 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:47:24,737 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:47:24,738 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:47:24,738 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:47:24,738 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:47:24,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:47:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:47:24,740 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:47:24,741 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:47:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:47:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:47:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:47:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:47:24,742 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:47:24,743 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:47:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:47:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:47:24,744 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:47:24,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:47:24,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:47:25,894 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:47:25,894 INFO L283 CfgBuilder]: Removed 14 assume(true) statements. [2019-09-10 03:47:25,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:47:25 BoogieIcfgContainer [2019-09-10 03:47:25,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:47:25,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:47:25,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:47:25,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:47:25,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:47:23" (1/3) ... [2019-09-10 03:47:25,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29148aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:47:25, skipping insertion in model container [2019-09-10 03:47:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:47:24" (2/3) ... [2019-09-10 03:47:25,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29148aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:47:25, skipping insertion in model container [2019-09-10 03:47:25,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:47:25" (3/3) ... [2019-09-10 03:47:25,909 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.10.cil.c [2019-09-10 03:47:25,923 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:47:25,949 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:47:25,969 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:47:26,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:47:26,008 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:47:26,008 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:47:26,008 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:47:26,008 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:47:26,009 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:47:26,009 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:47:26,009 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:47:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-09-10 03:47:26,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:26,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:26,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:26,109 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:26,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:26,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1517839845, now seen corresponding path program 1 times [2019-09-10 03:47:26,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:26,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:26,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:26,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:26,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:26,567 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:47:26,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:26,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:47:26,571 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:26,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:47:26,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:47:26,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:47:26,596 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-09-10 03:47:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:26,987 INFO L93 Difference]: Finished difference Result 407 states and 587 transitions. [2019-09-10 03:47:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:47:26,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 03:47:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:27,006 INFO L225 Difference]: With dead ends: 407 [2019-09-10 03:47:27,007 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 03:47:27,008 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:47:27,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 03:47:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-10 03:47:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:27,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 580 transitions. [2019-09-10 03:47:27,083 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 580 transitions. Word has length 210 [2019-09-10 03:47:27,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:27,085 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 580 transitions. [2019-09-10 03:47:27,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:47:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 580 transitions. [2019-09-10 03:47:27,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:27,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:27,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:27,091 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:27,093 INFO L82 PathProgramCache]: Analyzing trace with hash -696543773, now seen corresponding path program 1 times [2019-09-10 03:47:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:27,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:27,331 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:47:27,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:27,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:47:27,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:27,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:47:27,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:47:27,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:47:27,337 INFO L87 Difference]: Start difference. First operand 400 states and 580 transitions. Second operand 4 states. [2019-09-10 03:47:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:27,577 INFO L93 Difference]: Finished difference Result 400 states and 579 transitions. [2019-09-10 03:47:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:47:27,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 03:47:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:27,584 INFO L225 Difference]: With dead ends: 400 [2019-09-10 03:47:27,584 INFO L226 Difference]: Without dead ends: 400 [2019-09-10 03:47:27,587 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:47:27,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-10 03:47:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2019-09-10 03:47:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 579 transitions. [2019-09-10 03:47:27,629 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 579 transitions. Word has length 210 [2019-09-10 03:47:27,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:27,630 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 579 transitions. [2019-09-10 03:47:27,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:47:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 579 transitions. [2019-09-10 03:47:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:27,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:27,635 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:27,635 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -688544799, now seen corresponding path program 1 times [2019-09-10 03:47:27,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:27,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:27,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:27,879 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:47:27,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:27,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:27,879 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:27,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:27,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:27,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:27,881 INFO L87 Difference]: Start difference. First operand 400 states and 579 transitions. Second operand 5 states. [2019-09-10 03:47:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:28,738 INFO L93 Difference]: Finished difference Result 460 states and 689 transitions. [2019-09-10 03:47:28,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:28,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:28,741 INFO L225 Difference]: With dead ends: 460 [2019-09-10 03:47:28,742 INFO L226 Difference]: Without dead ends: 460 [2019-09-10 03:47:28,742 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:47:28,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-10 03:47:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2019-09-10 03:47:28,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:28,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 578 transitions. [2019-09-10 03:47:28,762 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 578 transitions. Word has length 210 [2019-09-10 03:47:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:28,763 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 578 transitions. [2019-09-10 03:47:28,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 578 transitions. [2019-09-10 03:47:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:28,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:28,768 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:28,768 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash -216205153, now seen corresponding path program 1 times [2019-09-10 03:47:28,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:28,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:28,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:28,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:28,912 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:47:28,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:28,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:28,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:28,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:28,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:28,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:28,915 INFO L87 Difference]: Start difference. First operand 400 states and 578 transitions. Second operand 5 states. [2019-09-10 03:47:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:29,753 INFO L93 Difference]: Finished difference Result 460 states and 689 transitions. [2019-09-10 03:47:29,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:29,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:29,758 INFO L225 Difference]: With dead ends: 460 [2019-09-10 03:47:29,758 INFO L226 Difference]: Without dead ends: 460 [2019-09-10 03:47:29,758 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:47:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-10 03:47:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 400. [2019-09-10 03:47:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:29,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 577 transitions. [2019-09-10 03:47:29,776 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 577 transitions. Word has length 210 [2019-09-10 03:47:29,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:29,777 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 577 transitions. [2019-09-10 03:47:29,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 577 transitions. [2019-09-10 03:47:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:29,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:29,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,782 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:29,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:29,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1032252383, now seen corresponding path program 1 times [2019-09-10 03:47:29,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:29,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:29,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:29,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:29,899 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:47:29,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:29,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:29,905 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:29,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:29,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:29,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:29,907 INFO L87 Difference]: Start difference. First operand 400 states and 577 transitions. Second operand 5 states. [2019-09-10 03:47:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:30,694 INFO L93 Difference]: Finished difference Result 458 states and 684 transitions. [2019-09-10 03:47:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:30,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:30,698 INFO L225 Difference]: With dead ends: 458 [2019-09-10 03:47:30,698 INFO L226 Difference]: Without dead ends: 458 [2019-09-10 03:47:30,699 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:47:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-09-10 03:47:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 400. [2019-09-10 03:47:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:30,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 576 transitions. [2019-09-10 03:47:30,720 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 576 transitions. Word has length 210 [2019-09-10 03:47:30,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:30,721 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 576 transitions. [2019-09-10 03:47:30,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 576 transitions. [2019-09-10 03:47:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:30,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:30,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,725 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:30,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:30,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1296728159, now seen corresponding path program 1 times [2019-09-10 03:47:30,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:30,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:30,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:30,844 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:47:30,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:30,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:30,845 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:30,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:30,846 INFO L87 Difference]: Start difference. First operand 400 states and 576 transitions. Second operand 5 states. [2019-09-10 03:47:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:31,794 INFO L93 Difference]: Finished difference Result 456 states and 679 transitions. [2019-09-10 03:47:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:31,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:31,798 INFO L225 Difference]: With dead ends: 456 [2019-09-10 03:47:31,798 INFO L226 Difference]: Without dead ends: 456 [2019-09-10 03:47:31,798 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:47:31,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2019-09-10 03:47:31,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 400. [2019-09-10 03:47:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:31,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 575 transitions. [2019-09-10 03:47:31,811 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 575 transitions. Word has length 210 [2019-09-10 03:47:31,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:31,812 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 575 transitions. [2019-09-10 03:47:31,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:31,812 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 575 transitions. [2019-09-10 03:47:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:31,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:31,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,815 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1399090079, now seen corresponding path program 1 times [2019-09-10 03:47:31,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:31,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:31,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:31,906 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:47:31,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:31,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:31,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:31,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:31,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:31,908 INFO L87 Difference]: Start difference. First operand 400 states and 575 transitions. Second operand 5 states. [2019-09-10 03:47:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:32,676 INFO L93 Difference]: Finished difference Result 454 states and 674 transitions. [2019-09-10 03:47:32,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:32,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:32,680 INFO L225 Difference]: With dead ends: 454 [2019-09-10 03:47:32,681 INFO L226 Difference]: Without dead ends: 454 [2019-09-10 03:47:32,681 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:47:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-09-10 03:47:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 400. [2019-09-10 03:47:32,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 574 transitions. [2019-09-10 03:47:32,694 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 574 transitions. Word has length 210 [2019-09-10 03:47:32,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:32,694 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 574 transitions. [2019-09-10 03:47:32,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:32,694 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 574 transitions. [2019-09-10 03:47:32,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:32,697 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:32,697 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:32,697 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:32,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:32,698 INFO L82 PathProgramCache]: Analyzing trace with hash -793315297, now seen corresponding path program 1 times [2019-09-10 03:47:32,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:32,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:32,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:32,802 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:47:32,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:32,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:32,803 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:32,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:32,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:32,805 INFO L87 Difference]: Start difference. First operand 400 states and 574 transitions. Second operand 5 states. [2019-09-10 03:47:33,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:33,587 INFO L93 Difference]: Finished difference Result 452 states and 669 transitions. [2019-09-10 03:47:33,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:33,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:33,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:33,592 INFO L225 Difference]: With dead ends: 452 [2019-09-10 03:47:33,593 INFO L226 Difference]: Without dead ends: 452 [2019-09-10 03:47:33,593 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:47:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-10 03:47:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 400. [2019-09-10 03:47:33,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:33,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 573 transitions. [2019-09-10 03:47:33,611 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 573 transitions. Word has length 210 [2019-09-10 03:47:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:33,612 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 573 transitions. [2019-09-10 03:47:33,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:33,614 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 573 transitions. [2019-09-10 03:47:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:33,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:33,618 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:33,618 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -773774175, now seen corresponding path program 1 times [2019-09-10 03:47:33,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:33,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:33,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:33,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:33,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:33,824 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:47:33,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:33,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:33,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:33,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:33,827 INFO L87 Difference]: Start difference. First operand 400 states and 573 transitions. Second operand 5 states. [2019-09-10 03:47:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:34,583 INFO L93 Difference]: Finished difference Result 448 states and 660 transitions. [2019-09-10 03:47:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:34,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:34,588 INFO L225 Difference]: With dead ends: 448 [2019-09-10 03:47:34,588 INFO L226 Difference]: Without dead ends: 448 [2019-09-10 03:47:34,588 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:47:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-10 03:47:34,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 400. [2019-09-10 03:47:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 572 transitions. [2019-09-10 03:47:34,603 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 572 transitions. Word has length 210 [2019-09-10 03:47:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:34,603 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 572 transitions. [2019-09-10 03:47:34,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 572 transitions. [2019-09-10 03:47:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:34,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:34,606 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,607 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -246380125, now seen corresponding path program 1 times [2019-09-10 03:47:34,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:34,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:34,707 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:47:34,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:34,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:34,708 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:34,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:34,709 INFO L87 Difference]: Start difference. First operand 400 states and 572 transitions. Second operand 5 states. [2019-09-10 03:47:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:35,446 INFO L93 Difference]: Finished difference Result 446 states and 655 transitions. [2019-09-10 03:47:35,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:35,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:35,452 INFO L225 Difference]: With dead ends: 446 [2019-09-10 03:47:35,452 INFO L226 Difference]: Without dead ends: 446 [2019-09-10 03:47:35,453 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:47:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-10 03:47:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 400. [2019-09-10 03:47:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 571 transitions. [2019-09-10 03:47:35,468 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 571 transitions. Word has length 210 [2019-09-10 03:47:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:35,469 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 571 transitions. [2019-09-10 03:47:35,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 571 transitions. [2019-09-10 03:47:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:35,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:35,471 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:35,471 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:35,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1614840735, now seen corresponding path program 1 times [2019-09-10 03:47:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:35,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:35,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:35,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:35,620 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:47:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:35,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:35,620 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:35,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:35,622 INFO L87 Difference]: Start difference. First operand 400 states and 571 transitions. Second operand 5 states. [2019-09-10 03:47:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:36,395 INFO L93 Difference]: Finished difference Result 444 states and 650 transitions. [2019-09-10 03:47:36,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:36,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:36,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:36,398 INFO L225 Difference]: With dead ends: 444 [2019-09-10 03:47:36,398 INFO L226 Difference]: Without dead ends: 444 [2019-09-10 03:47:36,399 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:47:36,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-10 03:47:36,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 400. [2019-09-10 03:47:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 570 transitions. [2019-09-10 03:47:36,409 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 570 transitions. Word has length 210 [2019-09-10 03:47:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:36,410 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 570 transitions. [2019-09-10 03:47:36,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 570 transitions. [2019-09-10 03:47:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:36,412 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:36,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,412 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:36,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash -966247965, now seen corresponding path program 1 times [2019-09-10 03:47:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:36,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:36,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:36,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:36,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:36,519 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:47:36,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:36,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:36,520 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:36,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:36,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:36,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:36,522 INFO L87 Difference]: Start difference. First operand 400 states and 570 transitions. Second operand 5 states. [2019-09-10 03:47:37,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:37,402 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-09-10 03:47:37,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:37,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:37,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:37,405 INFO L225 Difference]: With dead ends: 442 [2019-09-10 03:47:37,405 INFO L226 Difference]: Without dead ends: 442 [2019-09-10 03:47:37,406 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:47:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-10 03:47:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 400. [2019-09-10 03:47:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 569 transitions. [2019-09-10 03:47:37,429 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 569 transitions. Word has length 210 [2019-09-10 03:47:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:37,431 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 569 transitions. [2019-09-10 03:47:37,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 569 transitions. [2019-09-10 03:47:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:37,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:37,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:37,435 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:37,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1825621025, now seen corresponding path program 1 times [2019-09-10 03:47:37,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:37,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:37,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:37,438 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:37,591 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:47:37,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:37,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:37,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:37,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:37,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:37,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:37,596 INFO L87 Difference]: Start difference. First operand 400 states and 569 transitions. Second operand 5 states. [2019-09-10 03:47:38,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:38,579 INFO L93 Difference]: Finished difference Result 483 states and 720 transitions. [2019-09-10 03:47:38,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:38,580 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:38,583 INFO L225 Difference]: With dead ends: 483 [2019-09-10 03:47:38,583 INFO L226 Difference]: Without dead ends: 483 [2019-09-10 03:47:38,584 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:47:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-09-10 03:47:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 400. [2019-09-10 03:47:38,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 568 transitions. [2019-09-10 03:47:38,597 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 568 transitions. Word has length 210 [2019-09-10 03:47:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:38,598 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 568 transitions. [2019-09-10 03:47:38,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 568 transitions. [2019-09-10 03:47:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:38,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:38,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,601 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:38,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:38,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1915681315, now seen corresponding path program 1 times [2019-09-10 03:47:38,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:38,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:38,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:38,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:38,748 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:47:38,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:38,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:38,749 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:38,750 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:38,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:38,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:38,751 INFO L87 Difference]: Start difference. First operand 400 states and 568 transitions. Second operand 5 states. [2019-09-10 03:47:39,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:39,517 INFO L93 Difference]: Finished difference Result 481 states and 715 transitions. [2019-09-10 03:47:39,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:39,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:39,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:39,522 INFO L225 Difference]: With dead ends: 481 [2019-09-10 03:47:39,522 INFO L226 Difference]: Without dead ends: 481 [2019-09-10 03:47:39,524 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:47:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-09-10 03:47:39,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 400. [2019-09-10 03:47:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 567 transitions. [2019-09-10 03:47:39,538 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 567 transitions. Word has length 210 [2019-09-10 03:47:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:39,539 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 567 transitions. [2019-09-10 03:47:39,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 567 transitions. [2019-09-10 03:47:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:39,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:39,542 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:39,542 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:39,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1225849825, now seen corresponding path program 1 times [2019-09-10 03:47:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:39,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:39,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:39,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:39,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:39,654 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:47:39,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:39,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:39,655 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:39,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:39,657 INFO L87 Difference]: Start difference. First operand 400 states and 567 transitions. Second operand 5 states. [2019-09-10 03:47:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:40,417 INFO L93 Difference]: Finished difference Result 479 states and 710 transitions. [2019-09-10 03:47:40,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:40,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:40,421 INFO L225 Difference]: With dead ends: 479 [2019-09-10 03:47:40,421 INFO L226 Difference]: Without dead ends: 479 [2019-09-10 03:47:40,421 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:47:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-09-10 03:47:40,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 400. [2019-09-10 03:47:40,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:40,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 566 transitions. [2019-09-10 03:47:40,434 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 566 transitions. Word has length 210 [2019-09-10 03:47:40,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:40,434 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 566 transitions. [2019-09-10 03:47:40,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:40,434 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 566 transitions. [2019-09-10 03:47:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:40,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:40,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:40,437 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:40,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -181876125, now seen corresponding path program 1 times [2019-09-10 03:47:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:40,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:40,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:40,577 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:47:40,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:40,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:40,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:40,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:40,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:40,579 INFO L87 Difference]: Start difference. First operand 400 states and 566 transitions. Second operand 5 states. [2019-09-10 03:47:41,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:41,250 INFO L93 Difference]: Finished difference Result 475 states and 701 transitions. [2019-09-10 03:47:41,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:41,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:41,253 INFO L225 Difference]: With dead ends: 475 [2019-09-10 03:47:41,253 INFO L226 Difference]: Without dead ends: 475 [2019-09-10 03:47:41,254 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:47:41,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2019-09-10 03:47:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 400. [2019-09-10 03:47:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 565 transitions. [2019-09-10 03:47:41,265 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 565 transitions. Word has length 210 [2019-09-10 03:47:41,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:41,265 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 565 transitions. [2019-09-10 03:47:41,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 565 transitions. [2019-09-10 03:47:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:41,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:41,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:41,267 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:41,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2105126555, now seen corresponding path program 1 times [2019-09-10 03:47:41,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:41,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:41,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:41,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:41,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:41,373 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:47:41,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:41,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:41,374 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:41,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:41,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:41,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:41,376 INFO L87 Difference]: Start difference. First operand 400 states and 565 transitions. Second operand 5 states. [2019-09-10 03:47:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:42,138 INFO L93 Difference]: Finished difference Result 473 states and 696 transitions. [2019-09-10 03:47:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:42,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:42,142 INFO L225 Difference]: With dead ends: 473 [2019-09-10 03:47:42,142 INFO L226 Difference]: Without dead ends: 473 [2019-09-10 03:47:42,142 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:47:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-09-10 03:47:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 400. [2019-09-10 03:47:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 564 transitions. [2019-09-10 03:47:42,153 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 564 transitions. Word has length 210 [2019-09-10 03:47:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:42,153 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 564 transitions. [2019-09-10 03:47:42,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 564 transitions. [2019-09-10 03:47:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:42,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:42,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:42,155 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:42,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 465232419, now seen corresponding path program 1 times [2019-09-10 03:47:42,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:42,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:42,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:42,259 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:47:42,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:42,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:42,260 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:42,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:42,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:42,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:42,261 INFO L87 Difference]: Start difference. First operand 400 states and 564 transitions. Second operand 5 states. [2019-09-10 03:47:43,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:43,042 INFO L93 Difference]: Finished difference Result 471 states and 691 transitions. [2019-09-10 03:47:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:43,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:43,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:43,046 INFO L225 Difference]: With dead ends: 471 [2019-09-10 03:47:43,047 INFO L226 Difference]: Without dead ends: 471 [2019-09-10 03:47:43,048 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:47:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-09-10 03:47:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 400. [2019-09-10 03:47:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 563 transitions. [2019-09-10 03:47:43,062 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 563 transitions. Word has length 210 [2019-09-10 03:47:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:43,063 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 563 transitions. [2019-09-10 03:47:43,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 563 transitions. [2019-09-10 03:47:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:43,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:43,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:43,065 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:43,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:43,065 INFO L82 PathProgramCache]: Analyzing trace with hash 963789221, now seen corresponding path program 1 times [2019-09-10 03:47:43,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:43,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:43,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:43,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:43,165 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:47:43,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:43,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:43,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:43,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:43,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:43,167 INFO L87 Difference]: Start difference. First operand 400 states and 563 transitions. Second operand 5 states. [2019-09-10 03:47:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:43,923 INFO L93 Difference]: Finished difference Result 469 states and 686 transitions. [2019-09-10 03:47:43,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:43,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:43,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:43,927 INFO L225 Difference]: With dead ends: 469 [2019-09-10 03:47:43,927 INFO L226 Difference]: Without dead ends: 469 [2019-09-10 03:47:43,927 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:47:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-09-10 03:47:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 400. [2019-09-10 03:47:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:43,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 562 transitions. [2019-09-10 03:47:43,953 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 562 transitions. Word has length 210 [2019-09-10 03:47:43,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:43,954 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 562 transitions. [2019-09-10 03:47:43,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:43,954 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 562 transitions. [2019-09-10 03:47:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:43,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:43,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:43,956 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1534061027, now seen corresponding path program 1 times [2019-09-10 03:47:43,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:43,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:43,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:43,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:44,055 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:47:44,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:44,056 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:44,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:44,057 INFO L87 Difference]: Start difference. First operand 400 states and 562 transitions. Second operand 5 states. [2019-09-10 03:47:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:44,820 INFO L93 Difference]: Finished difference Result 467 states and 681 transitions. [2019-09-10 03:47:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:44,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:44,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:44,824 INFO L225 Difference]: With dead ends: 467 [2019-09-10 03:47:44,824 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 03:47:44,825 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:47:44,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 03:47:44,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 400. [2019-09-10 03:47:44,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:44,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 561 transitions. [2019-09-10 03:47:44,835 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 561 transitions. Word has length 210 [2019-09-10 03:47:44,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:44,835 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 561 transitions. [2019-09-10 03:47:44,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:44,836 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 561 transitions. [2019-09-10 03:47:44,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:44,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:44,837 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:44,838 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:44,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:44,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1357037083, now seen corresponding path program 1 times [2019-09-10 03:47:44,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:44,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:44,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:44,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:44,917 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:47:44,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:44,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:44,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:44,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:44,918 INFO L87 Difference]: Start difference. First operand 400 states and 561 transitions. Second operand 5 states. [2019-09-10 03:47:45,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:45,689 INFO L93 Difference]: Finished difference Result 465 states and 676 transitions. [2019-09-10 03:47:45,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:45,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-10 03:47:45,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:45,693 INFO L225 Difference]: With dead ends: 465 [2019-09-10 03:47:45,693 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 03:47:45,694 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:47:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 03:47:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 400. [2019-09-10 03:47:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-09-10 03:47:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 560 transitions. [2019-09-10 03:47:45,704 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 560 transitions. Word has length 210 [2019-09-10 03:47:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:45,705 INFO L475 AbstractCegarLoop]: Abstraction has 400 states and 560 transitions. [2019-09-10 03:47:45,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 560 transitions. [2019-09-10 03:47:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:45,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:45,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:45,707 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:45,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2143034973, now seen corresponding path program 1 times [2019-09-10 03:47:45,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:45,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:45,779 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:47:45,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:45,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:45,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:45,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:45,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:45,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:45,781 INFO L87 Difference]: Start difference. First operand 400 states and 560 transitions. Second operand 6 states. [2019-09-10 03:47:45,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:45,826 INFO L93 Difference]: Finished difference Result 437 states and 620 transitions. [2019-09-10 03:47:45,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:45,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:45,831 INFO L225 Difference]: With dead ends: 437 [2019-09-10 03:47:45,831 INFO L226 Difference]: Without dead ends: 437 [2019-09-10 03:47:45,832 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:47:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-09-10 03:47:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 405. [2019-09-10 03:47:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:47:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 565 transitions. [2019-09-10 03:47:45,845 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 565 transitions. Word has length 210 [2019-09-10 03:47:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:45,845 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 565 transitions. [2019-09-10 03:47:45,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 565 transitions. [2019-09-10 03:47:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:45,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:45,847 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:45,847 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash -211909339, now seen corresponding path program 1 times [2019-09-10 03:47:45,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:45,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:45,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:45,928 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:47:45,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:45,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:45,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:45,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:45,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:45,929 INFO L87 Difference]: Start difference. First operand 405 states and 565 transitions. Second operand 6 states. [2019-09-10 03:47:45,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:45,962 INFO L93 Difference]: Finished difference Result 439 states and 620 transitions. [2019-09-10 03:47:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:45,962 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:45,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:45,964 INFO L225 Difference]: With dead ends: 439 [2019-09-10 03:47:45,965 INFO L226 Difference]: Without dead ends: 439 [2019-09-10 03:47:45,965 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:47:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-09-10 03:47:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 410. [2019-09-10 03:47:45,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2019-09-10 03:47:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 570 transitions. [2019-09-10 03:47:45,977 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 570 transitions. Word has length 210 [2019-09-10 03:47:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:45,977 INFO L475 AbstractCegarLoop]: Abstraction has 410 states and 570 transitions. [2019-09-10 03:47:45,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 570 transitions. [2019-09-10 03:47:45,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:45,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:45,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:45,979 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1947174755, now seen corresponding path program 1 times [2019-09-10 03:47:45,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:45,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:45,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,093 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:47:46,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:46,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:46,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:46,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:46,095 INFO L87 Difference]: Start difference. First operand 410 states and 570 transitions. Second operand 6 states. [2019-09-10 03:47:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,136 INFO L93 Difference]: Finished difference Result 441 states and 620 transitions. [2019-09-10 03:47:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:46,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:46,139 INFO L225 Difference]: With dead ends: 441 [2019-09-10 03:47:46,139 INFO L226 Difference]: Without dead ends: 441 [2019-09-10 03:47:46,142 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:47:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-09-10 03:47:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 415. [2019-09-10 03:47:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2019-09-10 03:47:46,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 575 transitions. [2019-09-10 03:47:46,154 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 575 transitions. Word has length 210 [2019-09-10 03:47:46,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:46,154 INFO L475 AbstractCegarLoop]: Abstraction has 415 states and 575 transitions. [2019-09-10 03:47:46,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:46,155 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 575 transitions. [2019-09-10 03:47:46,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:46,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:46,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,156 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:46,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,157 INFO L82 PathProgramCache]: Analyzing trace with hash 999122789, now seen corresponding path program 1 times [2019-09-10 03:47:46,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:46,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,231 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:47:46,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:46,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:46,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:46,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:46,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:46,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:46,233 INFO L87 Difference]: Start difference. First operand 415 states and 575 transitions. Second operand 6 states. [2019-09-10 03:47:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,263 INFO L93 Difference]: Finished difference Result 443 states and 620 transitions. [2019-09-10 03:47:46,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:46,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:46,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:46,268 INFO L225 Difference]: With dead ends: 443 [2019-09-10 03:47:46,268 INFO L226 Difference]: Without dead ends: 443 [2019-09-10 03:47:46,268 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:47:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-09-10 03:47:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 420. [2019-09-10 03:47:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-09-10 03:47:46,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 580 transitions. [2019-09-10 03:47:46,279 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 580 transitions. Word has length 210 [2019-09-10 03:47:46,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:46,279 INFO L475 AbstractCegarLoop]: Abstraction has 420 states and 580 transitions. [2019-09-10 03:47:46,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:46,279 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 580 transitions. [2019-09-10 03:47:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:46,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:46,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,281 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:46,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,282 INFO L82 PathProgramCache]: Analyzing trace with hash -93512413, now seen corresponding path program 1 times [2019-09-10 03:47:46,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:46,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,358 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:47:46,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:46,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:46,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:46,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:46,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:46,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:46,360 INFO L87 Difference]: Start difference. First operand 420 states and 580 transitions. Second operand 6 states. [2019-09-10 03:47:46,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,392 INFO L93 Difference]: Finished difference Result 445 states and 620 transitions. [2019-09-10 03:47:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:46,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:46,395 INFO L225 Difference]: With dead ends: 445 [2019-09-10 03:47:46,395 INFO L226 Difference]: Without dead ends: 445 [2019-09-10 03:47:46,395 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:47:46,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-09-10 03:47:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 425. [2019-09-10 03:47:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-10 03:47:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 585 transitions. [2019-09-10 03:47:46,405 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 585 transitions. Word has length 210 [2019-09-10 03:47:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:46,406 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 585 transitions. [2019-09-10 03:47:46,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 585 transitions. [2019-09-10 03:47:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:46,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:46,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,408 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1740875355, now seen corresponding path program 1 times [2019-09-10 03:47:46,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:46,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,492 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:47:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:47:46,492 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:46,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:47:46,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:47:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:47:46,493 INFO L87 Difference]: Start difference. First operand 425 states and 585 transitions. Second operand 4 states. [2019-09-10 03:47:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,854 INFO L93 Difference]: Finished difference Result 814 states and 1116 transitions. [2019-09-10 03:47:46,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:47:46,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 03:47:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:46,861 INFO L225 Difference]: With dead ends: 814 [2019-09-10 03:47:46,862 INFO L226 Difference]: Without dead ends: 814 [2019-09-10 03:47:46,862 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:47:46,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2019-09-10 03:47:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 809. [2019-09-10 03:47:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-09-10 03:47:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1112 transitions. [2019-09-10 03:47:46,884 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1112 transitions. Word has length 210 [2019-09-10 03:47:46,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:46,884 INFO L475 AbstractCegarLoop]: Abstraction has 809 states and 1112 transitions. [2019-09-10 03:47:46,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:47:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1112 transitions. [2019-09-10 03:47:46,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:46,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:46,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,887 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2107333572, now seen corresponding path program 1 times [2019-09-10 03:47:46,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:46,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:46,965 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:47:46,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:46,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:46,966 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:46,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:46,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:46,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:46,967 INFO L87 Difference]: Start difference. First operand 809 states and 1112 transitions. Second operand 6 states. [2019-09-10 03:47:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:46,996 INFO L93 Difference]: Finished difference Result 831 states and 1145 transitions. [2019-09-10 03:47:46,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:46,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:47,002 INFO L225 Difference]: With dead ends: 831 [2019-09-10 03:47:47,002 INFO L226 Difference]: Without dead ends: 831 [2019-09-10 03:47:47,003 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:47:47,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2019-09-10 03:47:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 814. [2019-09-10 03:47:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 814 states. [2019-09-10 03:47:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1116 transitions. [2019-09-10 03:47:47,020 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1116 transitions. Word has length 210 [2019-09-10 03:47:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:47,024 INFO L475 AbstractCegarLoop]: Abstraction has 814 states and 1116 transitions. [2019-09-10 03:47:47,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1116 transitions. [2019-09-10 03:47:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:47,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:47,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,026 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 240624898, now seen corresponding path program 1 times [2019-09-10 03:47:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:47,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:47,164 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:47:47,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:47,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:47,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:47,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:47,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:47,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:47,166 INFO L87 Difference]: Start difference. First operand 814 states and 1116 transitions. Second operand 6 states. [2019-09-10 03:47:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:47,199 INFO L93 Difference]: Finished difference Result 852 states and 1175 transitions. [2019-09-10 03:47:47,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:47,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:47,203 INFO L225 Difference]: With dead ends: 852 [2019-09-10 03:47:47,203 INFO L226 Difference]: Without dead ends: 852 [2019-09-10 03:47:47,205 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:47:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2019-09-10 03:47:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 824. [2019-09-10 03:47:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2019-09-10 03:47:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1126 transitions. [2019-09-10 03:47:47,225 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1126 transitions. Word has length 210 [2019-09-10 03:47:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:47,225 INFO L475 AbstractCegarLoop]: Abstraction has 824 states and 1126 transitions. [2019-09-10 03:47:47,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1126 transitions. [2019-09-10 03:47:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:47,227 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:47,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,227 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash -642884092, now seen corresponding path program 1 times [2019-09-10 03:47:47,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:47,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:47,327 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:47:47,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:47,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:47:47,328 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:47,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:47:47,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:47:47,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:47:47,329 INFO L87 Difference]: Start difference. First operand 824 states and 1126 transitions. Second operand 4 states. [2019-09-10 03:47:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:47,669 INFO L93 Difference]: Finished difference Result 1606 states and 2188 transitions. [2019-09-10 03:47:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:47:47,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 03:47:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:47,676 INFO L225 Difference]: With dead ends: 1606 [2019-09-10 03:47:47,676 INFO L226 Difference]: Without dead ends: 1606 [2019-09-10 03:47:47,676 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:47:47,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-09-10 03:47:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1599. [2019-09-10 03:47:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1599 states. [2019-09-10 03:47:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2182 transitions. [2019-09-10 03:47:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2182 transitions. Word has length 210 [2019-09-10 03:47:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:47,711 INFO L475 AbstractCegarLoop]: Abstraction has 1599 states and 2182 transitions. [2019-09-10 03:47:47,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:47:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2182 transitions. [2019-09-10 03:47:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:47,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:47,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,713 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:47,713 INFO L82 PathProgramCache]: Analyzing trace with hash -680330781, now seen corresponding path program 1 times [2019-09-10 03:47:47,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:47,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:47,806 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:47:47,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:47,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:47,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:47,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:47,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:47,809 INFO L87 Difference]: Start difference. First operand 1599 states and 2182 transitions. Second operand 6 states. [2019-09-10 03:47:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:47,854 INFO L93 Difference]: Finished difference Result 1631 states and 2228 transitions. [2019-09-10 03:47:47,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:47,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:47,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:47,863 INFO L225 Difference]: With dead ends: 1631 [2019-09-10 03:47:47,863 INFO L226 Difference]: Without dead ends: 1631 [2019-09-10 03:47:47,864 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:47:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2019-09-10 03:47:47,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1609. [2019-09-10 03:47:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-09-10 03:47:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2190 transitions. [2019-09-10 03:47:47,914 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2190 transitions. Word has length 210 [2019-09-10 03:47:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:47,915 INFO L475 AbstractCegarLoop]: Abstraction has 1609 states and 2190 transitions. [2019-09-10 03:47:47,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:47,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2190 transitions. [2019-09-10 03:47:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:47,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,919 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1735505569, now seen corresponding path program 1 times [2019-09-10 03:47:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:47,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:48,030 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:47:48,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:48,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:48,031 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:48,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:48,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:48,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:48,033 INFO L87 Difference]: Start difference. First operand 1609 states and 2190 transitions. Second operand 6 states. [2019-09-10 03:47:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:48,080 INFO L93 Difference]: Finished difference Result 1661 states and 2267 transitions. [2019-09-10 03:47:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:48,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:48,087 INFO L225 Difference]: With dead ends: 1661 [2019-09-10 03:47:48,088 INFO L226 Difference]: Without dead ends: 1661 [2019-09-10 03:47:48,088 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:47:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-09-10 03:47:48,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1629. [2019-09-10 03:47:48,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2019-09-10 03:47:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2210 transitions. [2019-09-10 03:47:48,142 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2210 transitions. Word has length 210 [2019-09-10 03:47:48,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:48,143 INFO L475 AbstractCegarLoop]: Abstraction has 1629 states and 2210 transitions. [2019-09-10 03:47:48,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2210 transitions. [2019-09-10 03:47:48,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:48,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:48,147 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,147 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash -825357277, now seen corresponding path program 1 times [2019-09-10 03:47:48,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:48,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:48,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:48,274 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:47:48,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:48,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:48,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:48,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:48,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:48,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:48,276 INFO L87 Difference]: Start difference. First operand 1629 states and 2210 transitions. Second operand 6 states. [2019-09-10 03:47:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:48,321 INFO L93 Difference]: Finished difference Result 1669 states and 2267 transitions. [2019-09-10 03:47:48,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:48,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-10 03:47:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:48,329 INFO L225 Difference]: With dead ends: 1669 [2019-09-10 03:47:48,329 INFO L226 Difference]: Without dead ends: 1669 [2019-09-10 03:47:48,331 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:47:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-10 03:47:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1649. [2019-09-10 03:47:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-10 03:47:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2230 transitions. [2019-09-10 03:47:48,369 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2230 transitions. Word has length 210 [2019-09-10 03:47:48,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:48,370 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2230 transitions. [2019-09-10 03:47:48,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2230 transitions. [2019-09-10 03:47:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-10 03:47:48,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:48,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,372 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:48,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:48,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1557324703, now seen corresponding path program 1 times [2019-09-10 03:47:48,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:48,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:48,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:48,481 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:47:48,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:48,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:47:48,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:48,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:47:48,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:47:48,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:47:48,483 INFO L87 Difference]: Start difference. First operand 1649 states and 2230 transitions. Second operand 4 states. [2019-09-10 03:47:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:48,809 INFO L93 Difference]: Finished difference Result 3245 states and 4380 transitions. [2019-09-10 03:47:48,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:47:48,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-09-10 03:47:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:48,822 INFO L225 Difference]: With dead ends: 3245 [2019-09-10 03:47:48,822 INFO L226 Difference]: Without dead ends: 3245 [2019-09-10 03:47:48,823 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:47:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-09-10 03:47:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 3236. [2019-09-10 03:47:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3236 states. [2019-09-10 03:47:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4371 transitions. [2019-09-10 03:47:48,904 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4371 transitions. Word has length 210 [2019-09-10 03:47:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:48,904 INFO L475 AbstractCegarLoop]: Abstraction has 3236 states and 4371 transitions. [2019-09-10 03:47:48,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:47:48,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4371 transitions. [2019-09-10 03:47:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:48,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:48,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:48,916 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:48,916 INFO L82 PathProgramCache]: Analyzing trace with hash -566654174, now seen corresponding path program 1 times [2019-09-10 03:47:48,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:48,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:48,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:49,012 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:49,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:49,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:47:49,012 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:49,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:47:49,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:47:49,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:47:49,013 INFO L87 Difference]: Start difference. First operand 3236 states and 4371 transitions. Second operand 6 states. [2019-09-10 03:47:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:49,051 INFO L93 Difference]: Finished difference Result 3264 states and 4403 transitions. [2019-09-10 03:47:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:47:49,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 237 [2019-09-10 03:47:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:49,073 INFO L225 Difference]: With dead ends: 3264 [2019-09-10 03:47:49,073 INFO L226 Difference]: Without dead ends: 3264 [2019-09-10 03:47:49,073 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:47:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3264 states. [2019-09-10 03:47:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3264 to 3256. [2019-09-10 03:47:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2019-09-10 03:47:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 4387 transitions. [2019-09-10 03:47:49,144 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 4387 transitions. Word has length 237 [2019-09-10 03:47:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:49,145 INFO L475 AbstractCegarLoop]: Abstraction has 3256 states and 4387 transitions. [2019-09-10 03:47:49,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:47:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 4387 transitions. [2019-09-10 03:47:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:49,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:49,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:49,150 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:49,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1849182176, now seen corresponding path program 1 times [2019-09-10 03:47:49,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:49,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:49,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:49,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:49,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:49,256 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:49,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:49,257 INFO L87 Difference]: Start difference. First operand 3256 states and 4387 transitions. Second operand 5 states. [2019-09-10 03:47:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:50,430 INFO L93 Difference]: Finished difference Result 5952 states and 7734 transitions. [2019-09-10 03:47:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:47:50,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:50,446 INFO L225 Difference]: With dead ends: 5952 [2019-09-10 03:47:50,447 INFO L226 Difference]: Without dead ends: 5952 [2019-09-10 03:47:50,447 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:47:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2019-09-10 03:47:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4680. [2019-09-10 03:47:50,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:50,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6179 transitions. [2019-09-10 03:47:50,551 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6179 transitions. Word has length 237 [2019-09-10 03:47:50,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:50,552 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6179 transitions. [2019-09-10 03:47:50,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:50,552 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6179 transitions. [2019-09-10 03:47:50,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:50,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:50,557 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:50,557 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:50,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:50,558 INFO L82 PathProgramCache]: Analyzing trace with hash 706679710, now seen corresponding path program 1 times [2019-09-10 03:47:50,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:50,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:50,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:50,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:50,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:50,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:50,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:50,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:50,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:50,701 INFO L87 Difference]: Start difference. First operand 4680 states and 6179 transitions. Second operand 5 states. [2019-09-10 03:47:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:51,474 INFO L93 Difference]: Finished difference Result 4680 states and 6155 transitions. [2019-09-10 03:47:51,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:51,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:51,491 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:51,491 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:51,491 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:47:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:51,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:51,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6155 transitions. [2019-09-10 03:47:51,569 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6155 transitions. Word has length 237 [2019-09-10 03:47:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:51,569 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6155 transitions. [2019-09-10 03:47:51,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6155 transitions. [2019-09-10 03:47:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:51,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:51,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:51,574 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:51,574 INFO L82 PathProgramCache]: Analyzing trace with hash 946919456, now seen corresponding path program 1 times [2019-09-10 03:47:51,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:51,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:51,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:51,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:51,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:51,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:51,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:51,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:51,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:51,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:51,739 INFO L87 Difference]: Start difference. First operand 4680 states and 6155 transitions. Second operand 5 states. [2019-09-10 03:47:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:52,467 INFO L93 Difference]: Finished difference Result 4680 states and 6131 transitions. [2019-09-10 03:47:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:52,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:52,485 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:52,485 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:52,486 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:47:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6131 transitions. [2019-09-10 03:47:52,559 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6131 transitions. Word has length 237 [2019-09-10 03:47:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:52,559 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6131 transitions. [2019-09-10 03:47:52,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6131 transitions. [2019-09-10 03:47:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:52,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:52,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:52,564 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:52,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1785953118, now seen corresponding path program 1 times [2019-09-10 03:47:52,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:52,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:52,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:52,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:52,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:52,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:52,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:52,729 INFO L87 Difference]: Start difference. First operand 4680 states and 6131 transitions. Second operand 5 states. [2019-09-10 03:47:53,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:53,431 INFO L93 Difference]: Finished difference Result 4680 states and 6107 transitions. [2019-09-10 03:47:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:53,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:53,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:53,444 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:53,444 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:53,444 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:47:53,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6107 transitions. [2019-09-10 03:47:53,518 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6107 transitions. Word has length 237 [2019-09-10 03:47:53,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:53,519 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6107 transitions. [2019-09-10 03:47:53,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:53,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6107 transitions. [2019-09-10 03:47:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:53,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:53,523 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:53,523 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1813018720, now seen corresponding path program 1 times [2019-09-10 03:47:53,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:53,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:53,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:53,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:53,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:53,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:53,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:53,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:53,643 INFO L87 Difference]: Start difference. First operand 4680 states and 6107 transitions. Second operand 5 states. [2019-09-10 03:47:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:54,362 INFO L93 Difference]: Finished difference Result 4680 states and 6083 transitions. [2019-09-10 03:47:54,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:54,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:54,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:54,374 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:54,374 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:54,374 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:47:54,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6083 transitions. [2019-09-10 03:47:54,443 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6083 transitions. Word has length 237 [2019-09-10 03:47:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:54,444 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6083 transitions. [2019-09-10 03:47:54,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6083 transitions. [2019-09-10 03:47:54,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:54,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:54,448 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:54,449 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:54,449 INFO L82 PathProgramCache]: Analyzing trace with hash -264318178, now seen corresponding path program 1 times [2019-09-10 03:47:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:54,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:54,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:54,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:54,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:54,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:54,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:54,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:54,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:54,578 INFO L87 Difference]: Start difference. First operand 4680 states and 6083 transitions. Second operand 5 states. [2019-09-10 03:47:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:55,382 INFO L93 Difference]: Finished difference Result 4680 states and 6059 transitions. [2019-09-10 03:47:55,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:55,383 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:55,399 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:55,399 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:55,399 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:47:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:55,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:55,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6059 transitions. [2019-09-10 03:47:55,464 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6059 transitions. Word has length 237 [2019-09-10 03:47:55,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:55,465 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6059 transitions. [2019-09-10 03:47:55,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:55,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6059 transitions. [2019-09-10 03:47:55,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:55,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:55,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:55,469 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:55,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:55,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1469786272, now seen corresponding path program 1 times [2019-09-10 03:47:55,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:55,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:55,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:55,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:55,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:55,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:55,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:55,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:55,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:55,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:55,584 INFO L87 Difference]: Start difference. First operand 4680 states and 6059 transitions. Second operand 5 states. [2019-09-10 03:47:56,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:56,313 INFO L93 Difference]: Finished difference Result 4680 states and 6035 transitions. [2019-09-10 03:47:56,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:56,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:56,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:56,325 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:56,325 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:56,326 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:47:56,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:56,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:56,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6035 transitions. [2019-09-10 03:47:56,401 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6035 transitions. Word has length 237 [2019-09-10 03:47:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:56,402 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6035 transitions. [2019-09-10 03:47:56,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6035 transitions. [2019-09-10 03:47:56,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:56,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:56,408 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:56,408 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:56,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:56,408 INFO L82 PathProgramCache]: Analyzing trace with hash -441256286, now seen corresponding path program 1 times [2019-09-10 03:47:56,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:56,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:56,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:56,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:56,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:56,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:56,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:56,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:56,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:56,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:56,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:56,515 INFO L87 Difference]: Start difference. First operand 4680 states and 6035 transitions. Second operand 5 states. [2019-09-10 03:47:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:57,225 INFO L93 Difference]: Finished difference Result 4680 states and 6011 transitions. [2019-09-10 03:47:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:57,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:57,235 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:57,235 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:57,236 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:47:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:57,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 6011 transitions. [2019-09-10 03:47:57,307 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 6011 transitions. Word has length 237 [2019-09-10 03:47:57,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:57,308 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 6011 transitions. [2019-09-10 03:47:57,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 6011 transitions. [2019-09-10 03:47:57,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:57,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:57,313 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,313 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:57,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:57,314 INFO L82 PathProgramCache]: Analyzing trace with hash -364355488, now seen corresponding path program 1 times [2019-09-10 03:47:57,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:57,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:57,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:57,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:57,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:57,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:57,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:57,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:57,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:57,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:57,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:57,445 INFO L87 Difference]: Start difference. First operand 4680 states and 6011 transitions. Second operand 5 states. [2019-09-10 03:47:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:58,191 INFO L93 Difference]: Finished difference Result 4680 states and 5987 transitions. [2019-09-10 03:47:58,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:58,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:58,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:58,201 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:58,201 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:58,202 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:47:58,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:58,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:58,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5987 transitions. [2019-09-10 03:47:58,268 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5987 transitions. Word has length 237 [2019-09-10 03:47:58,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:58,269 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5987 transitions. [2019-09-10 03:47:58,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:58,269 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5987 transitions. [2019-09-10 03:47:58,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:58,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:58,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:58,274 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:58,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:58,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1331706142, now seen corresponding path program 1 times [2019-09-10 03:47:58,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:58,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:58,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:58,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:58,381 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:58,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:58,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:58,382 INFO L87 Difference]: Start difference. First operand 4680 states and 5987 transitions. Second operand 5 states. [2019-09-10 03:47:59,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:59,063 INFO L93 Difference]: Finished difference Result 4680 states and 5963 transitions. [2019-09-10 03:47:59,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:47:59,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:47:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:59,075 INFO L225 Difference]: With dead ends: 4680 [2019-09-10 03:47:59,076 INFO L226 Difference]: Without dead ends: 4680 [2019-09-10 03:47:59,076 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:47:59,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-09-10 03:47:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-09-10 03:47:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-09-10 03:47:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 5963 transitions. [2019-09-10 03:47:59,139 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 5963 transitions. Word has length 237 [2019-09-10 03:47:59,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:59,139 INFO L475 AbstractCegarLoop]: Abstraction has 4680 states and 5963 transitions. [2019-09-10 03:47:59,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:47:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 5963 transitions. [2019-09-10 03:47:59,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:47:59,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:59,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,144 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:59,144 INFO L82 PathProgramCache]: Analyzing trace with hash 576751648, now seen corresponding path program 1 times [2019-09-10 03:47:59,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:59,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:59,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:59,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:47:59,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:47:59,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:47:59,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:59,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:47:59,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:47:59,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:47:59,238 INFO L87 Difference]: Start difference. First operand 4680 states and 5963 transitions. Second operand 5 states. [2019-09-10 03:48:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:00,387 INFO L93 Difference]: Finished difference Result 7397 states and 9469 transitions. [2019-09-10 03:48:00,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:00,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:00,403 INFO L225 Difference]: With dead ends: 7397 [2019-09-10 03:48:00,404 INFO L226 Difference]: Without dead ends: 7397 [2019-09-10 03:48:00,404 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:48:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7397 states. [2019-09-10 03:48:00,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7397 to 5856. [2019-09-10 03:48:00,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5856 states. [2019-09-10 03:48:00,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 7299 transitions. [2019-09-10 03:48:00,493 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 7299 transitions. Word has length 237 [2019-09-10 03:48:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:00,494 INFO L475 AbstractCegarLoop]: Abstraction has 5856 states and 7299 transitions. [2019-09-10 03:48:00,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 7299 transitions. [2019-09-10 03:48:00,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:00,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:00,498 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:00,498 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash 84125474, now seen corresponding path program 1 times [2019-09-10 03:48:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:00,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:00,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:00,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:00,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:00,601 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:00,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:00,602 INFO L87 Difference]: Start difference. First operand 5856 states and 7299 transitions. Second operand 5 states. [2019-09-10 03:48:01,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:01,700 INFO L93 Difference]: Finished difference Result 8373 states and 10549 transitions. [2019-09-10 03:48:01,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:01,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:01,715 INFO L225 Difference]: With dead ends: 8373 [2019-09-10 03:48:01,715 INFO L226 Difference]: Without dead ends: 8373 [2019-09-10 03:48:01,715 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:48:01,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8373 states. [2019-09-10 03:48:01,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8373 to 6952. [2019-09-10 03:48:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2019-09-10 03:48:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 8523 transitions. [2019-09-10 03:48:01,823 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 8523 transitions. Word has length 237 [2019-09-10 03:48:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:01,823 INFO L475 AbstractCegarLoop]: Abstraction has 6952 states and 8523 transitions. [2019-09-10 03:48:01,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 8523 transitions. [2019-09-10 03:48:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:01,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:01,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:01,827 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:01,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:01,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1038065632, now seen corresponding path program 1 times [2019-09-10 03:48:01,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:01,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:01,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:01,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:01,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:01,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:01,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:01,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:01,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:01,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:01,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:01,932 INFO L87 Difference]: Start difference. First operand 6952 states and 8523 transitions. Second operand 5 states. [2019-09-10 03:48:03,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:03,036 INFO L93 Difference]: Finished difference Result 9269 states and 11517 transitions. [2019-09-10 03:48:03,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:03,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:03,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:03,057 INFO L225 Difference]: With dead ends: 9269 [2019-09-10 03:48:03,057 INFO L226 Difference]: Without dead ends: 9269 [2019-09-10 03:48:03,058 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:48:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9269 states. [2019-09-10 03:48:03,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9269 to 7968. [2019-09-10 03:48:03,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7968 states. [2019-09-10 03:48:03,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7968 states to 7968 states and 9635 transitions. [2019-09-10 03:48:03,219 INFO L78 Accepts]: Start accepts. Automaton has 7968 states and 9635 transitions. Word has length 237 [2019-09-10 03:48:03,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:03,220 INFO L475 AbstractCegarLoop]: Abstraction has 7968 states and 9635 transitions. [2019-09-10 03:48:03,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:03,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7968 states and 9635 transitions. [2019-09-10 03:48:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:03,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:03,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,226 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash -178088094, now seen corresponding path program 1 times [2019-09-10 03:48:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:03,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:03,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:03,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:03,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:03,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:03,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:03,327 INFO L87 Difference]: Start difference. First operand 7968 states and 9635 transitions. Second operand 5 states. [2019-09-10 03:48:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:04,419 INFO L93 Difference]: Finished difference Result 9477 states and 11697 transitions. [2019-09-10 03:48:04,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:04,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:04,441 INFO L225 Difference]: With dead ends: 9477 [2019-09-10 03:48:04,441 INFO L226 Difference]: Without dead ends: 9477 [2019-09-10 03:48:04,442 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:48:04,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9477 states. [2019-09-10 03:48:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9477 to 8980. [2019-09-10 03:48:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8980 states. [2019-09-10 03:48:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8980 states to 8980 states and 10739 transitions. [2019-09-10 03:48:04,571 INFO L78 Accepts]: Start accepts. Automaton has 8980 states and 10739 transitions. Word has length 237 [2019-09-10 03:48:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:04,571 INFO L475 AbstractCegarLoop]: Abstraction has 8980 states and 10739 transitions. [2019-09-10 03:48:04,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 8980 states and 10739 transitions. [2019-09-10 03:48:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:04,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:04,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,576 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:04,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:04,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1864267932, now seen corresponding path program 1 times [2019-09-10 03:48:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:04,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:04,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:04,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:04,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:04,694 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:04,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:04,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:04,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:04,698 INFO L87 Difference]: Start difference. First operand 8980 states and 10739 transitions. Second operand 5 states. [2019-09-10 03:48:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:05,734 INFO L93 Difference]: Finished difference Result 9783 states and 11752 transitions. [2019-09-10 03:48:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:05,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:05,754 INFO L225 Difference]: With dead ends: 9783 [2019-09-10 03:48:05,754 INFO L226 Difference]: Without dead ends: 9783 [2019-09-10 03:48:05,755 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:48:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9783 states. [2019-09-10 03:48:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9783 to 9316. [2019-09-10 03:48:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9316 states. [2019-09-10 03:48:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9316 states to 9316 states and 11031 transitions. [2019-09-10 03:48:06,009 INFO L78 Accepts]: Start accepts. Automaton has 9316 states and 11031 transitions. Word has length 237 [2019-09-10 03:48:06,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:06,010 INFO L475 AbstractCegarLoop]: Abstraction has 9316 states and 11031 transitions. [2019-09-10 03:48:06,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 9316 states and 11031 transitions. [2019-09-10 03:48:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:06,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:06,018 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,018 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:06,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:06,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1918660830, now seen corresponding path program 1 times [2019-09-10 03:48:06,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:06,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:06,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:06,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:06,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:06,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:06,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:06,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:06,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:06,126 INFO L87 Difference]: Start difference. First operand 9316 states and 11031 transitions. Second operand 5 states. [2019-09-10 03:48:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:07,133 INFO L93 Difference]: Finished difference Result 10735 states and 12967 transitions. [2019-09-10 03:48:07,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:07,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:07,150 INFO L225 Difference]: With dead ends: 10735 [2019-09-10 03:48:07,151 INFO L226 Difference]: Without dead ends: 10735 [2019-09-10 03:48:07,151 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:48:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10735 states. [2019-09-10 03:48:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10735 to 10238. [2019-09-10 03:48:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10238 states. [2019-09-10 03:48:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10238 states to 10238 states and 12009 transitions. [2019-09-10 03:48:07,285 INFO L78 Accepts]: Start accepts. Automaton has 10238 states and 12009 transitions. Word has length 237 [2019-09-10 03:48:07,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:07,285 INFO L475 AbstractCegarLoop]: Abstraction has 10238 states and 12009 transitions. [2019-09-10 03:48:07,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:07,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10238 states and 12009 transitions. [2019-09-10 03:48:07,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:07,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:07,290 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,290 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:07,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:07,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1958909860, now seen corresponding path program 1 times [2019-09-10 03:48:07,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:07,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:07,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:07,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:07,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:07,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:07,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:07,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:07,392 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:07,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:07,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:07,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:07,393 INFO L87 Difference]: Start difference. First operand 10238 states and 12009 transitions. Second operand 5 states. [2019-09-10 03:48:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:08,392 INFO L93 Difference]: Finished difference Result 10843 states and 12772 transitions. [2019-09-10 03:48:08,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:08,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:08,408 INFO L225 Difference]: With dead ends: 10843 [2019-09-10 03:48:08,408 INFO L226 Difference]: Without dead ends: 10843 [2019-09-10 03:48:08,408 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:48:08,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10843 states. [2019-09-10 03:48:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10843 to 10484. [2019-09-10 03:48:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10484 states. [2019-09-10 03:48:08,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10484 states to 10484 states and 12175 transitions. [2019-09-10 03:48:08,530 INFO L78 Accepts]: Start accepts. Automaton has 10484 states and 12175 transitions. Word has length 237 [2019-09-10 03:48:08,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:08,530 INFO L475 AbstractCegarLoop]: Abstraction has 10484 states and 12175 transitions. [2019-09-10 03:48:08,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 10484 states and 12175 transitions. [2019-09-10 03:48:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:08,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:08,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:08,534 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:08,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:08,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1656785182, now seen corresponding path program 1 times [2019-09-10 03:48:08,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:08,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:08,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:08,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:08,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:09,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:09,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:09,082 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:09,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:09,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:09,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:09,084 INFO L87 Difference]: Start difference. First operand 10484 states and 12175 transitions. Second operand 5 states. [2019-09-10 03:48:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:10,072 INFO L93 Difference]: Finished difference Result 11809 states and 13937 transitions. [2019-09-10 03:48:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:10,073 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:10,096 INFO L225 Difference]: With dead ends: 11809 [2019-09-10 03:48:10,097 INFO L226 Difference]: Without dead ends: 11809 [2019-09-10 03:48:10,097 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:48:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11809 states. [2019-09-10 03:48:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11809 to 11180. [2019-09-10 03:48:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11180 states. [2019-09-10 03:48:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11180 states to 11180 states and 12839 transitions. [2019-09-10 03:48:10,231 INFO L78 Accepts]: Start accepts. Automaton has 11180 states and 12839 transitions. Word has length 237 [2019-09-10 03:48:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:10,231 INFO L475 AbstractCegarLoop]: Abstraction has 11180 states and 12839 transitions. [2019-09-10 03:48:10,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 11180 states and 12839 transitions. [2019-09-10 03:48:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:10,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:10,236 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:10,236 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:10,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 304789476, now seen corresponding path program 1 times [2019-09-10 03:48:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:10,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:48:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:48:10,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:48:10,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:10,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:48:10,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:48:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:48:10,338 INFO L87 Difference]: Start difference. First operand 11180 states and 12839 transitions. Second operand 5 states. [2019-09-10 03:48:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:11,287 INFO L93 Difference]: Finished difference Result 12449 states and 14565 transitions. [2019-09-10 03:48:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:48:11,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-09-10 03:48:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:11,305 INFO L225 Difference]: With dead ends: 12449 [2019-09-10 03:48:11,306 INFO L226 Difference]: Without dead ends: 12449 [2019-09-10 03:48:11,306 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:48:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12449 states. [2019-09-10 03:48:11,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12449 to 11952. [2019-09-10 03:48:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11952 states. [2019-09-10 03:48:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11952 states to 11952 states and 13607 transitions. [2019-09-10 03:48:11,428 INFO L78 Accepts]: Start accepts. Automaton has 11952 states and 13607 transitions. Word has length 237 [2019-09-10 03:48:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:11,428 INFO L475 AbstractCegarLoop]: Abstraction has 11952 states and 13607 transitions. [2019-09-10 03:48:11,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:48:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11952 states and 13607 transitions. [2019-09-10 03:48:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 03:48:11,432 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:11,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,433 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 506613410, now seen corresponding path program 1 times [2019-09-10 03:48:11,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:11,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:11,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:11,506 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 03:48:11,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:48:11,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:48:11,508 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 238 with the following transitions: [2019-09-10 03:48:11,510 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1126], [1139], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:48:11,555 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:48:11,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:48:11,962 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:48:11,964 INFO L272 AbstractInterpreter]: Visited 194 different actions 194 times. Never merged. Never widened. Performed 1394 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1394 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 130 variables. [2019-09-10 03:48:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:11,969 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:48:12,395 INFO L227 lantSequenceWeakener]: Weakened 202 states. On average, predicates are now at 68.46% of their original sizes. [2019-09-10 03:48:12,395 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:48:17,370 INFO L420 sIntCurrentIteration]: We unified 236 AI predicates to 236 [2019-09-10 03:48:17,371 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:48:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:48:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [94] imperfect sequences [3] total 95 [2019-09-10 03:48:17,372 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:17,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-09-10 03:48:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-09-10 03:48:17,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1845, Invalid=6897, Unknown=0, NotChecked=0, Total=8742 [2019-09-10 03:48:17,377 INFO L87 Difference]: Start difference. First operand 11952 states and 13607 transitions. Second operand 94 states. [2019-09-10 03:49:01,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:49:01,370 INFO L93 Difference]: Finished difference Result 12184 states and 13857 transitions. [2019-09-10 03:49:01,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 03:49:01,370 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 237 [2019-09-10 03:49:01,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:49:01,390 INFO L225 Difference]: With dead ends: 12184 [2019-09-10 03:49:01,390 INFO L226 Difference]: Without dead ends: 12184 [2019-09-10 03:49:01,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7092 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=5130, Invalid=18432, Unknown=0, NotChecked=0, Total=23562 [2019-09-10 03:49:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2019-09-10 03:49:01,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 12159. [2019-09-10 03:49:01,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12159 states. [2019-09-10 03:49:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12159 states to 12159 states and 13831 transitions. [2019-09-10 03:49:01,492 INFO L78 Accepts]: Start accepts. Automaton has 12159 states and 13831 transitions. Word has length 237 [2019-09-10 03:49:01,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:49:01,493 INFO L475 AbstractCegarLoop]: Abstraction has 12159 states and 13831 transitions. [2019-09-10 03:49:01,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-09-10 03:49:01,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12159 states and 13831 transitions. [2019-09-10 03:49:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-10 03:49:01,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:49:01,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:01,499 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:49:01,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1335470169, now seen corresponding path program 1 times [2019-09-10 03:49:01,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:49:01,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:01,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:49:01,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:49:01,501 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:49:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:49:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:49:01,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:49:01,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:49:01,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 246 with the following transitions: [2019-09-10 03:49:01,596 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1117], [1123], [1126], [1130], [1133], [1139], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1402], [1403], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:49:01,601 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:49:01,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:49:01,701 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:49:01,701 INFO L272 AbstractInterpreter]: Visited 206 different actions 206 times. Never merged. Never widened. Performed 1519 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1519 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 130 variables. [2019-09-10 03:49:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:49:01,702 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:49:01,972 INFO L227 lantSequenceWeakener]: Weakened 214 states. On average, predicates are now at 69.07% of their original sizes. [2019-09-10 03:49:01,973 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:49:07,656 INFO L420 sIntCurrentIteration]: We unified 244 AI predicates to 244 [2019-09-10 03:49:07,656 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:49:07,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:49:07,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [105] imperfect sequences [4] total 107 [2019-09-10 03:49:07,656 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:49:07,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-10 03:49:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-10 03:49:07,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2265, Invalid=8655, Unknown=0, NotChecked=0, Total=10920 [2019-09-10 03:49:07,660 INFO L87 Difference]: Start difference. First operand 12159 states and 13831 transitions. Second operand 105 states. [2019-09-10 03:50:28,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:28,065 INFO L93 Difference]: Finished difference Result 14650 states and 16721 transitions. [2019-09-10 03:50:28,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-10 03:50:28,065 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 245 [2019-09-10 03:50:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:28,089 INFO L225 Difference]: With dead ends: 14650 [2019-09-10 03:50:28,090 INFO L226 Difference]: Without dead ends: 14650 [2019-09-10 03:50:28,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=5975, Invalid=23095, Unknown=0, NotChecked=0, Total=29070 [2019-09-10 03:50:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14650 states. [2019-09-10 03:50:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14650 to 14593. [2019-09-10 03:50:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14593 states. [2019-09-10 03:50:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14593 states to 14593 states and 16650 transitions. [2019-09-10 03:50:28,256 INFO L78 Accepts]: Start accepts. Automaton has 14593 states and 16650 transitions. Word has length 245 [2019-09-10 03:50:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:28,256 INFO L475 AbstractCegarLoop]: Abstraction has 14593 states and 16650 transitions. [2019-09-10 03:50:28,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-10 03:50:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14593 states and 16650 transitions. [2019-09-10 03:50:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:50:28,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:28,262 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,262 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:28,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2096189531, now seen corresponding path program 1 times [2019-09-10 03:50:28,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:28,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:28,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:28,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:50:28,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:50:28,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:50:28,354 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 247 with the following transitions: [2019-09-10 03:50:28,354 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1117], [1123], [1126], [1130], [1136], [1139], [1143], [1146], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1404], [1405], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:50:28,360 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:50:28,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:50:28,456 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:50:28,457 INFO L272 AbstractInterpreter]: Visited 209 different actions 209 times. Never merged. Never widened. Performed 1524 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1524 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 130 variables. [2019-09-10 03:50:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:28,457 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:50:28,699 INFO L227 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 69.39% of their original sizes. [2019-09-10 03:50:28,700 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:50:34,246 INFO L420 sIntCurrentIteration]: We unified 245 AI predicates to 245 [2019-09-10 03:50:34,246 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:50:34,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:50:34,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [107] imperfect sequences [4] total 109 [2019-09-10 03:50:34,247 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:34,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-09-10 03:50:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-09-10 03:50:34,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2359, Invalid=8983, Unknown=0, NotChecked=0, Total=11342 [2019-09-10 03:50:34,250 INFO L87 Difference]: Start difference. First operand 14593 states and 16650 transitions. Second operand 107 states. [2019-09-10 03:52:06,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:52:06,441 INFO L93 Difference]: Finished difference Result 17619 states and 20181 transitions. [2019-09-10 03:52:06,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-10 03:52:06,441 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 246 [2019-09-10 03:52:06,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:52:06,462 INFO L225 Difference]: With dead ends: 17619 [2019-09-10 03:52:06,463 INFO L226 Difference]: Without dead ends: 17619 [2019-09-10 03:52:06,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9297 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=6192, Invalid=23910, Unknown=0, NotChecked=0, Total=30102 [2019-09-10 03:52:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17619 states. [2019-09-10 03:52:06,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17619 to 17436. [2019-09-10 03:52:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17436 states. [2019-09-10 03:52:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17436 states to 17436 states and 19956 transitions. [2019-09-10 03:52:06,613 INFO L78 Accepts]: Start accepts. Automaton has 17436 states and 19956 transitions. Word has length 246 [2019-09-10 03:52:06,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:52:06,613 INFO L475 AbstractCegarLoop]: Abstraction has 17436 states and 19956 transitions. [2019-09-10 03:52:06,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-09-10 03:52:06,614 INFO L276 IsEmpty]: Start isEmpty. Operand 17436 states and 19956 transitions. [2019-09-10 03:52:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 03:52:06,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:52:06,618 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:06,618 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:52:06,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash -981088506, now seen corresponding path program 1 times [2019-09-10 03:52:06,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:52:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:06,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:52:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:52:06,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:52:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:52:06,708 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:52:06,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:52:06,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:52:06,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-09-10 03:52:06,709 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [47], [63], [65], [73], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1117], [1123], [1126], [1130], [1136], [1139], [1143], [1149], [1152], [1156], [1159], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1406], [1407], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:52:06,712 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:52:06,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:52:06,773 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:52:06,774 INFO L272 AbstractInterpreter]: Visited 212 different actions 212 times. Never merged. Never widened. Performed 1529 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1529 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 130 variables. [2019-09-10 03:52:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:52:06,774 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:52:06,981 INFO L227 lantSequenceWeakener]: Weakened 220 states. On average, predicates are now at 69.71% of their original sizes. [2019-09-10 03:52:06,981 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:52:12,804 INFO L420 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2019-09-10 03:52:12,804 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:52:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:52:12,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [109] imperfect sequences [4] total 111 [2019-09-10 03:52:12,805 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:52:12,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-09-10 03:52:12,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-09-10 03:52:12,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2456, Invalid=9316, Unknown=0, NotChecked=0, Total=11772 [2019-09-10 03:52:12,808 INFO L87 Difference]: Start difference. First operand 17436 states and 19956 transitions. Second operand 109 states. [2019-09-10 03:53:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:53:13,565 INFO L93 Difference]: Finished difference Result 21206 states and 24400 transitions. [2019-09-10 03:53:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-10 03:53:13,565 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 247 [2019-09-10 03:53:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:53:13,603 INFO L225 Difference]: With dead ends: 21206 [2019-09-10 03:53:13,604 INFO L226 Difference]: Without dead ends: 21206 [2019-09-10 03:53:13,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9613 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=6418, Invalid=24734, Unknown=0, NotChecked=0, Total=31152 [2019-09-10 03:53:13,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21206 states. [2019-09-10 03:53:13,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21206 to 21081. [2019-09-10 03:53:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21081 states. [2019-09-10 03:53:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21081 states to 21081 states and 24227 transitions. [2019-09-10 03:53:13,791 INFO L78 Accepts]: Start accepts. Automaton has 21081 states and 24227 transitions. Word has length 247 [2019-09-10 03:53:13,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:53:13,791 INFO L475 AbstractCegarLoop]: Abstraction has 21081 states and 24227 transitions. [2019-09-10 03:53:13,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-09-10 03:53:13,791 INFO L276 IsEmpty]: Start isEmpty. Operand 21081 states and 24227 transitions. [2019-09-10 03:53:13,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-09-10 03:53:13,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:53:13,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:13,798 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:53:13,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:13,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1927637052, now seen corresponding path program 1 times [2019-09-10 03:53:13,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:53:13,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:13,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:53:13,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:53:13,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:53:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:53:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:53:13,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:53:13,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:53:13,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 249 with the following transitions: [2019-09-10 03:53:13,888 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [134], [150], [152], [160], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1117], [1123], [1126], [1130], [1136], [1139], [1143], [1149], [1152], [1156], [1162], [1165], [1169], [1172], [1178], [1191], [1204], [1217], [1230], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1408], [1409], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:53:13,890 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:53:13,890 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:53:13,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:53:13,945 INFO L272 AbstractInterpreter]: Visited 215 different actions 215 times. Never merged. Never widened. Performed 1534 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1534 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 130 variables. [2019-09-10 03:53:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:53:13,945 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:53:14,158 INFO L227 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 70.02% of their original sizes. [2019-09-10 03:53:14,158 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:53:20,285 INFO L420 sIntCurrentIteration]: We unified 247 AI predicates to 247 [2019-09-10 03:53:20,285 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:53:20,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:53:20,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [111] imperfect sequences [4] total 113 [2019-09-10 03:53:20,286 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:53:20,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-10 03:53:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-10 03:53:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=9654, Unknown=0, NotChecked=0, Total=12210 [2019-09-10 03:53:20,288 INFO L87 Difference]: Start difference. First operand 21081 states and 24227 transitions. Second operand 111 states. [2019-09-10 03:55:32,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:55:32,641 INFO L93 Difference]: Finished difference Result 25965 states and 30025 transitions. [2019-09-10 03:55:32,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-10 03:55:32,642 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 248 [2019-09-10 03:55:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:55:32,674 INFO L225 Difference]: With dead ends: 25965 [2019-09-10 03:55:32,674 INFO L226 Difference]: Without dead ends: 25965 [2019-09-10 03:55:32,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9931 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=6653, Invalid=25567, Unknown=0, NotChecked=0, Total=32220 [2019-09-10 03:55:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25965 states. [2019-09-10 03:55:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25965 to 25688. [2019-09-10 03:55:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25688 states. [2019-09-10 03:55:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25688 states to 25688 states and 29682 transitions. [2019-09-10 03:55:32,904 INFO L78 Accepts]: Start accepts. Automaton has 25688 states and 29682 transitions. Word has length 248 [2019-09-10 03:55:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:55:32,904 INFO L475 AbstractCegarLoop]: Abstraction has 25688 states and 29682 transitions. [2019-09-10 03:55:32,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-10 03:55:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 25688 states and 29682 transitions. [2019-09-10 03:55:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-10 03:55:32,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:55:32,912 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:32,912 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:55:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash -657553219, now seen corresponding path program 1 times [2019-09-10 03:55:32,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:55:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:55:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:55:32,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:55:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:55:33,001 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 03:55:33,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:55:33,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:55:33,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 248 with the following transitions: [2019-09-10 03:55:33,003 INFO L207 CegarAbsIntRunner]: [29], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [438], [439], [449], [451], [453], [454], [582], [592], [594], [596], [597], [598], [608], [610], [612], [613], [616], [618], [623], [626], [631], [634], [639], [642], [647], [650], [655], [658], [663], [666], [671], [674], [679], [682], [687], [690], [695], [698], [703], [705], [708], [710], [713], [724], [726], [732], [733], [736], [790], [791], [792], [802], [804], [806], [807], [808], [818], [820], [822], [823], [828], [834], [840], [846], [852], [858], [864], [870], [876], [882], [888], [894], [900], [906], [912], [918], [924], [930], [936], [942], [948], [950], [953], [959], [965], [971], [977], [983], [989], [995], [1001], [1007], [1013], [1017], [1018], [1028], [1030], [1032], [1033], [1078], [1079], [1080], [1090], [1092], [1094], [1095], [1096], [1105], [1108], [1111], [1117], [1123], [1126], [1130], [1136], [1139], [1143], [1149], [1152], [1156], [1162], [1165], [1169], [1175], [1178], [1182], [1188], [1191], [1195], [1201], [1204], [1208], [1214], [1217], [1221], [1227], [1230], [1234], [1240], [1243], [1247], [1250], [1262], [1272], [1274], [1276], [1277], [1278], [1288], [1290], [1292], [1293], [1294], [1295], [1309], [1311], [1344], [1345], [1364], [1365], [1366], [1372], [1373], [1374], [1375], [1376], [1377], [1378], [1379], [1380], [1381], [1382], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1398], [1399], [1420], [1421], [1422], [1423], [1424], [1425], [1426], [1427], [1428], [1429], [1430], [1431], [1432], [1452], [1453], [1454] [2019-09-10 03:55:33,008 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:55:33,008 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:55:33,169 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:55:33,170 INFO L272 AbstractInterpreter]: Visited 232 different actions 272 times. Merged at 25 different actions 25 times. Never widened. Performed 1896 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1896 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 132 variables. [2019-09-10 03:55:33,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:55:33,170 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:55:33,530 INFO L227 lantSequenceWeakener]: Weakened 242 states. On average, predicates are now at 72.24% of their original sizes. [2019-09-10 03:55:33,531 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:55:41,726 INFO L420 sIntCurrentIteration]: We unified 246 AI predicates to 246 [2019-09-10 03:55:41,727 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:55:41,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:55:41,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [121] imperfect sequences [3] total 122 [2019-09-10 03:55:41,727 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:55:41,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-09-10 03:55:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-09-10 03:55:41,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3216, Invalid=11304, Unknown=0, NotChecked=0, Total=14520 [2019-09-10 03:55:41,729 INFO L87 Difference]: Start difference. First operand 25688 states and 29682 transitions. Second operand 121 states.