java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.12.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:49:27,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:49:27,844 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:49:27,857 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:49:27,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:49:27,859 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:49:27,861 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:49:27,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:49:27,873 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:49:27,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:49:27,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:49:27,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:49:27,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:49:27,879 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:49:27,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:49:27,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:49:27,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:49:27,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:49:27,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:49:27,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:49:27,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:49:27,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:49:27,903 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:49:27,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:49:27,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:49:27,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:49:27,906 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:49:27,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:49:27,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:49:27,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:49:27,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:49:27,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:49:27,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:49:27,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:49:27,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:49:27,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:49:27,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:49:27,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:49:27,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:49:27,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:49:27,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:49:27,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:49:27,950 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:49:27,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:49:27,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:49:27,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:49:27,952 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:49:27,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:49:27,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:49:27,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:49:27,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:49:27,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:49:27,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:49:27,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:49:27,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:49:27,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:49:27,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:49:27,954 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:49:27,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:49:27,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:49:27,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:49:27,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:49:27,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:49:27,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:49:27,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:49:27,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:49:27,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:49:27,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:49:27,957 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:49:27,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:49:27,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:49:27,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:49:27,998 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:49:28,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:49:28,003 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:49:28,004 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:49:28,004 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.12.cil-2.c [2019-09-08 06:49:28,066 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff17e97/794313be048040de89c08e593983887c/FLAGec11644fb [2019-09-08 06:49:28,578 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:49:28,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.12.cil-2.c [2019-09-08 06:49:28,601 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff17e97/794313be048040de89c08e593983887c/FLAGec11644fb [2019-09-08 06:49:28,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ff17e97/794313be048040de89c08e593983887c [2019-09-08 06:49:28,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:49:28,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:49:28,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:49:28,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:49:28,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:49:28,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:28" (1/1) ... [2019-09-08 06:49:28,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c5e3a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:28, skipping insertion in model container [2019-09-08 06:49:28,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:28" (1/1) ... [2019-09-08 06:49:28,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:49:28,923 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:49:29,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:49:29,501 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:49:29,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:49:29,623 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:49:29,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29 WrapperNode [2019-09-08 06:49:29,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:49:29,625 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:49:29,625 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:49:29,625 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:49:29,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,653 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... [2019-09-08 06:49:29,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:49:29,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:49:29,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:49:29,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:49:29,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:49:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:49:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:49:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:49:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:49:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:49:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:49:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:49:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:49:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:49:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:49:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:49:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:49:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:49:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:49:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:49:29,792 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:49:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:49:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:49:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:49:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:49:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:49:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:49:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:49:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:49:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:49:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:49:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:49:29,799 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:49:29,800 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:49:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:49:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:49:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:49:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:49:29,801 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:49:31,117 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:49:31,117 INFO L283 CfgBuilder]: Removed 15 assume(true) statements. [2019-09-08 06:49:31,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:49:31 BoogieIcfgContainer [2019-09-08 06:49:31,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:49:31,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:49:31,120 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:49:31,124 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:49:31,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:49:28" (1/3) ... [2019-09-08 06:49:31,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a32f1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:49:31, skipping insertion in model container [2019-09-08 06:49:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:29" (2/3) ... [2019-09-08 06:49:31,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a32f1bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:49:31, skipping insertion in model container [2019-09-08 06:49:31,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:49:31" (3/3) ... [2019-09-08 06:49:31,128 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.12.cil-2.c [2019-09-08 06:49:31,138 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:49:31,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:49:31,165 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:49:31,201 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:49:31,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:49:31,202 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:49:31,202 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:49:31,202 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:49:31,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:49:31,203 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:49:31,204 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:49:31,204 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:49:31,252 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states. [2019-09-08 06:49:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:31,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:31,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:31,279 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1848146602, now seen corresponding path program 1 times [2019-09-08 06:49:31,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:31,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:31,908 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-08 06:49:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:31,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:31,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:31,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:31,942 INFO L87 Difference]: Start difference. First operand 474 states. Second operand 4 states. [2019-09-08 06:49:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:32,451 INFO L93 Difference]: Finished difference Result 931 states and 1442 transitions. [2019-09-08 06:49:32,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:32,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 06:49:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:32,475 INFO L225 Difference]: With dead ends: 931 [2019-09-08 06:49:32,475 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 06:49:32,488 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-08 06:49:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 06:49:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-09-08 06:49:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 682 transitions. [2019-09-08 06:49:32,610 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 682 transitions. Word has length 231 [2019-09-08 06:49:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:32,613 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 682 transitions. [2019-09-08 06:49:32,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:32,614 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 682 transitions. [2019-09-08 06:49:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:32,627 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:32,627 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:32,628 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:32,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1849980968, now seen corresponding path program 1 times [2019-09-08 06:49:32,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:32,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:32,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:32,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:32,833 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-08 06:49:32,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:32,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:49:32,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:49:32,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:49:32,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:49:32,841 INFO L87 Difference]: Start difference. First operand 465 states and 682 transitions. Second operand 4 states. [2019-09-08 06:49:33,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:33,194 INFO L93 Difference]: Finished difference Result 907 states and 1332 transitions. [2019-09-08 06:49:33,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:49:33,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 06:49:33,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:33,198 INFO L225 Difference]: With dead ends: 907 [2019-09-08 06:49:33,198 INFO L226 Difference]: Without dead ends: 465 [2019-09-08 06:49:33,201 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-08 06:49:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-08 06:49:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2019-09-08 06:49:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:33,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 681 transitions. [2019-09-08 06:49:33,247 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 681 transitions. Word has length 231 [2019-09-08 06:49:33,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:33,248 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 681 transitions. [2019-09-08 06:49:33,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:49:33,248 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 681 transitions. [2019-09-08 06:49:33,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:33,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:33,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:33,253 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:33,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1724066906, now seen corresponding path program 1 times [2019-09-08 06:49:33,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:33,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:33,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:33,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:33,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:33,455 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-08 06:49:33,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:33,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:33,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:33,457 INFO L87 Difference]: Start difference. First operand 465 states and 681 transitions. Second operand 5 states. [2019-09-08 06:49:34,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:34,459 INFO L93 Difference]: Finished difference Result 970 states and 1453 transitions. [2019-09-08 06:49:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:34,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:34,468 INFO L225 Difference]: With dead ends: 970 [2019-09-08 06:49:34,469 INFO L226 Difference]: Without dead ends: 535 [2019-09-08 06:49:34,470 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-08 06:49:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-08 06:49:34,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 465. [2019-09-08 06:49:34,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 680 transitions. [2019-09-08 06:49:34,513 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 680 transitions. Word has length 231 [2019-09-08 06:49:34,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:34,513 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 680 transitions. [2019-09-08 06:49:34,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:34,513 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 680 transitions. [2019-09-08 06:49:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:34,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:34,518 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:34,518 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1440081368, now seen corresponding path program 1 times [2019-09-08 06:49:34,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:34,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:34,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:34,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:34,708 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-08 06:49:34,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:34,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:34,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:34,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:34,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:34,710 INFO L87 Difference]: Start difference. First operand 465 states and 680 transitions. Second operand 5 states. [2019-09-08 06:49:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:35,616 INFO L93 Difference]: Finished difference Result 970 states and 1452 transitions. [2019-09-08 06:49:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:35,617 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:35,621 INFO L225 Difference]: With dead ends: 970 [2019-09-08 06:49:35,621 INFO L226 Difference]: Without dead ends: 535 [2019-09-08 06:49:35,624 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-08 06:49:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2019-09-08 06:49:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 465. [2019-09-08 06:49:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 679 transitions. [2019-09-08 06:49:35,654 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 679 transitions. Word has length 231 [2019-09-08 06:49:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:35,655 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 679 transitions. [2019-09-08 06:49:35,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 679 transitions. [2019-09-08 06:49:35,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:35,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:35,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:35,659 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:35,660 INFO L82 PathProgramCache]: Analyzing trace with hash 924384102, now seen corresponding path program 1 times [2019-09-08 06:49:35,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:35,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:35,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:35,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:49:35,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:35,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:35,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:35,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:35,817 INFO L87 Difference]: Start difference. First operand 465 states and 679 transitions. Second operand 5 states. [2019-09-08 06:49:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:36,732 INFO L93 Difference]: Finished difference Result 968 states and 1446 transitions. [2019-09-08 06:49:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:36,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:36,740 INFO L225 Difference]: With dead ends: 968 [2019-09-08 06:49:36,740 INFO L226 Difference]: Without dead ends: 533 [2019-09-08 06:49:36,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-08 06:49:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-08 06:49:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 465. [2019-09-08 06:49:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 678 transitions. [2019-09-08 06:49:36,776 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 678 transitions. Word has length 231 [2019-09-08 06:49:36,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:36,777 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 678 transitions. [2019-09-08 06:49:36,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:36,777 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 678 transitions. [2019-09-08 06:49:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:36,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:36,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:36,782 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:36,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash -800458136, now seen corresponding path program 1 times [2019-09-08 06:49:36,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:36,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:36,948 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-08 06:49:36,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:36,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:36,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:36,950 INFO L87 Difference]: Start difference. First operand 465 states and 678 transitions. Second operand 5 states. [2019-09-08 06:49:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:37,923 INFO L93 Difference]: Finished difference Result 966 states and 1440 transitions. [2019-09-08 06:49:37,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:37,923 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:37,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:37,928 INFO L225 Difference]: With dead ends: 966 [2019-09-08 06:49:37,928 INFO L226 Difference]: Without dead ends: 531 [2019-09-08 06:49:37,931 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-08 06:49:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-08 06:49:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 465. [2019-09-08 06:49:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 677 transitions. [2019-09-08 06:49:37,966 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 677 transitions. Word has length 231 [2019-09-08 06:49:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:37,967 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 677 transitions. [2019-09-08 06:49:37,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 677 transitions. [2019-09-08 06:49:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:37,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:37,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:37,970 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1499206438, now seen corresponding path program 1 times [2019-09-08 06:49:37,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:37,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:37,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:37,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:38,111 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-08 06:49:38,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:38,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:38,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:38,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:38,114 INFO L87 Difference]: Start difference. First operand 465 states and 677 transitions. Second operand 5 states. [2019-09-08 06:49:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:39,049 INFO L93 Difference]: Finished difference Result 964 states and 1434 transitions. [2019-09-08 06:49:39,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:39,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:39,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:39,055 INFO L225 Difference]: With dead ends: 964 [2019-09-08 06:49:39,055 INFO L226 Difference]: Without dead ends: 529 [2019-09-08 06:49:39,057 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-08 06:49:39,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2019-09-08 06:49:39,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 465. [2019-09-08 06:49:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 676 transitions. [2019-09-08 06:49:39,088 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 676 transitions. Word has length 231 [2019-09-08 06:49:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:39,088 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 676 transitions. [2019-09-08 06:49:39,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 676 transitions. [2019-09-08 06:49:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:39,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:39,091 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -781915480, now seen corresponding path program 1 times [2019-09-08 06:49:39,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:39,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:39,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:39,219 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-08 06:49:39,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:39,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:39,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:39,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:39,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:39,221 INFO L87 Difference]: Start difference. First operand 465 states and 676 transitions. Second operand 5 states. [2019-09-08 06:49:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:40,190 INFO L93 Difference]: Finished difference Result 962 states and 1428 transitions. [2019-09-08 06:49:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:40,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:40,196 INFO L225 Difference]: With dead ends: 962 [2019-09-08 06:49:40,196 INFO L226 Difference]: Without dead ends: 527 [2019-09-08 06:49:40,199 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-08 06:49:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2019-09-08 06:49:40,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 465. [2019-09-08 06:49:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 675 transitions. [2019-09-08 06:49:40,246 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 675 transitions. Word has length 231 [2019-09-08 06:49:40,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:40,247 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 675 transitions. [2019-09-08 06:49:40,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 675 transitions. [2019-09-08 06:49:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:40,251 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:40,251 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:40,252 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:40,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:40,253 INFO L82 PathProgramCache]: Analyzing trace with hash -855500058, now seen corresponding path program 1 times [2019-09-08 06:49:40,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:40,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:40,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:49:40,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:40,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:40,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:40,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:40,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:40,389 INFO L87 Difference]: Start difference. First operand 465 states and 675 transitions. Second operand 5 states. [2019-09-08 06:49:41,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:41,221 INFO L93 Difference]: Finished difference Result 958 states and 1418 transitions. [2019-09-08 06:49:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:41,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:41,225 INFO L225 Difference]: With dead ends: 958 [2019-09-08 06:49:41,225 INFO L226 Difference]: Without dead ends: 523 [2019-09-08 06:49:41,227 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-08 06:49:41,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-09-08 06:49:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 465. [2019-09-08 06:49:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 674 transitions. [2019-09-08 06:49:41,257 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 674 transitions. Word has length 231 [2019-09-08 06:49:41,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:41,257 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 674 transitions. [2019-09-08 06:49:41,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 674 transitions. [2019-09-08 06:49:41,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:41,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:41,260 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:41,260 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:41,260 INFO L82 PathProgramCache]: Analyzing trace with hash -368426332, now seen corresponding path program 1 times [2019-09-08 06:49:41,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:41,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:41,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:41,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:41,375 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-08 06:49:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:41,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:41,377 INFO L87 Difference]: Start difference. First operand 465 states and 674 transitions. Second operand 5 states. [2019-09-08 06:49:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:42,393 INFO L93 Difference]: Finished difference Result 956 states and 1412 transitions. [2019-09-08 06:49:42,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:42,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:42,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:42,397 INFO L225 Difference]: With dead ends: 956 [2019-09-08 06:49:42,397 INFO L226 Difference]: Without dead ends: 521 [2019-09-08 06:49:42,401 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-08 06:49:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-09-08 06:49:42,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 465. [2019-09-08 06:49:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 673 transitions. [2019-09-08 06:49:42,435 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 673 transitions. Word has length 231 [2019-09-08 06:49:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:42,435 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 673 transitions. [2019-09-08 06:49:42,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 673 transitions. [2019-09-08 06:49:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:42,437 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:42,438 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:49:42,438 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:42,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2141137702, now seen corresponding path program 1 times [2019-09-08 06:49:42,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:42,439 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:42,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:42,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:42,633 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-08 06:49:42,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:42,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:42,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:42,635 INFO L87 Difference]: Start difference. First operand 465 states and 673 transitions. Second operand 5 states. [2019-09-08 06:49:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:43,634 INFO L93 Difference]: Finished difference Result 954 states and 1406 transitions. [2019-09-08 06:49:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:43,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:43,638 INFO L225 Difference]: With dead ends: 954 [2019-09-08 06:49:43,638 INFO L226 Difference]: Without dead ends: 519 [2019-09-08 06:49:43,640 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-08 06:49:43,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-09-08 06:49:43,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 465. [2019-09-08 06:49:43,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 672 transitions. [2019-09-08 06:49:43,679 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 672 transitions. Word has length 231 [2019-09-08 06:49:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:43,679 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 672 transitions. [2019-09-08 06:49:43,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 672 transitions. [2019-09-08 06:49:43,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:43,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:43,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:43,682 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:43,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:43,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1667902052, now seen corresponding path program 1 times [2019-09-08 06:49:43,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:43,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:43,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:43,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:43,796 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-08 06:49:43,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:43,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:43,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:43,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:43,799 INFO L87 Difference]: Start difference. First operand 465 states and 672 transitions. Second operand 5 states. [2019-09-08 06:49:44,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:44,692 INFO L93 Difference]: Finished difference Result 952 states and 1400 transitions. [2019-09-08 06:49:44,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:44,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:44,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:44,697 INFO L225 Difference]: With dead ends: 952 [2019-09-08 06:49:44,698 INFO L226 Difference]: Without dead ends: 517 [2019-09-08 06:49:44,700 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-08 06:49:44,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2019-09-08 06:49:44,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 465. [2019-09-08 06:49:44,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 671 transitions. [2019-09-08 06:49:44,747 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 671 transitions. Word has length 231 [2019-09-08 06:49:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:44,748 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 671 transitions. [2019-09-08 06:49:44,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 671 transitions. [2019-09-08 06:49:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:44,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:44,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:44,752 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1791183718, now seen corresponding path program 1 times [2019-09-08 06:49:44,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:44,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:44,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:44,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:44,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:44,941 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-08 06:49:44,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:44,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:44,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:44,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:44,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:44,943 INFO L87 Difference]: Start difference. First operand 465 states and 671 transitions. Second operand 5 states. [2019-09-08 06:49:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:45,855 INFO L93 Difference]: Finished difference Result 950 states and 1394 transitions. [2019-09-08 06:49:45,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:45,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:45,858 INFO L225 Difference]: With dead ends: 950 [2019-09-08 06:49:45,859 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 06:49:45,860 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-08 06:49:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 06:49:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 465. [2019-09-08 06:49:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 670 transitions. [2019-09-08 06:49:45,894 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 670 transitions. Word has length 231 [2019-09-08 06:49:45,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:45,895 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 670 transitions. [2019-09-08 06:49:45,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 670 transitions. [2019-09-08 06:49:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:45,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:45,897 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:45,898 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash -283049436, now seen corresponding path program 1 times [2019-09-08 06:49:45,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:45,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:45,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:45,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:46,015 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-08 06:49:46,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:46,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:46,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:46,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:46,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:46,018 INFO L87 Difference]: Start difference. First operand 465 states and 670 transitions. Second operand 5 states. [2019-09-08 06:49:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:47,026 INFO L93 Difference]: Finished difference Result 948 states and 1388 transitions. [2019-09-08 06:49:47,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:47,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:47,031 INFO L225 Difference]: With dead ends: 948 [2019-09-08 06:49:47,031 INFO L226 Difference]: Without dead ends: 513 [2019-09-08 06:49:47,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:49:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-09-08 06:49:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 465. [2019-09-08 06:49:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:47,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 669 transitions. [2019-09-08 06:49:47,092 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 669 transitions. Word has length 231 [2019-09-08 06:49:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:47,093 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 669 transitions. [2019-09-08 06:49:47,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 669 transitions. [2019-09-08 06:49:47,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:47,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:47,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 06:49:47,097 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:47,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:47,097 INFO L82 PathProgramCache]: Analyzing trace with hash 619871142, now seen corresponding path program 1 times [2019-09-08 06:49:47,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:47,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:47,283 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-08 06:49:47,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:47,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:47,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:47,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:47,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:47,286 INFO L87 Difference]: Start difference. First operand 465 states and 669 transitions. Second operand 5 states. [2019-09-08 06:49:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:48,480 INFO L93 Difference]: Finished difference Result 995 states and 1474 transitions. [2019-09-08 06:49:48,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:48,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:48,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:48,486 INFO L225 Difference]: With dead ends: 995 [2019-09-08 06:49:48,486 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 06:49:48,491 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-08 06:49:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 06:49:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 465. [2019-09-08 06:49:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 668 transitions. [2019-09-08 06:49:48,555 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 668 transitions. Word has length 231 [2019-09-08 06:49:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:48,556 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 668 transitions. [2019-09-08 06:49:48,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 668 transitions. [2019-09-08 06:49:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:48,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:48,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:48,559 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 371902948, now seen corresponding path program 1 times [2019-09-08 06:49:48,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:48,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:48,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:48,733 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-08 06:49:48,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:48,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:48,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:48,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:48,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:48,739 INFO L87 Difference]: Start difference. First operand 465 states and 668 transitions. Second operand 5 states. [2019-09-08 06:49:50,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:50,044 INFO L93 Difference]: Finished difference Result 991 states and 1464 transitions. [2019-09-08 06:49:50,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:50,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:50,049 INFO L225 Difference]: With dead ends: 991 [2019-09-08 06:49:50,049 INFO L226 Difference]: Without dead ends: 556 [2019-09-08 06:49:50,052 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-08 06:49:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-08 06:49:50,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 465. [2019-09-08 06:49:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 667 transitions. [2019-09-08 06:49:50,126 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 667 transitions. Word has length 231 [2019-09-08 06:49:50,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:50,127 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 667 transitions. [2019-09-08 06:49:50,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:50,127 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 667 transitions. [2019-09-08 06:49:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:50,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:50,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:50,131 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:50,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1895665570, now seen corresponding path program 1 times [2019-09-08 06:49:50,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:50,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:50,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:50,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:50,318 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-08 06:49:50,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:50,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:50,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:50,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:50,321 INFO L87 Difference]: Start difference. First operand 465 states and 667 transitions. Second operand 5 states. [2019-09-08 06:49:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:51,366 INFO L93 Difference]: Finished difference Result 989 states and 1458 transitions. [2019-09-08 06:49:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:51,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:51,371 INFO L225 Difference]: With dead ends: 989 [2019-09-08 06:49:51,371 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 06:49:51,373 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-08 06:49:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 06:49:51,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 465. [2019-09-08 06:49:51,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:51,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 666 transitions. [2019-09-08 06:49:51,414 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 666 transitions. Word has length 231 [2019-09-08 06:49:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:51,414 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 666 transitions. [2019-09-08 06:49:51,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 666 transitions. [2019-09-08 06:49:51,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:51,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:51,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:51,416 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:51,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:51,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1241769436, now seen corresponding path program 1 times [2019-09-08 06:49:51,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:51,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:51,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:51,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:51,517 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-08 06:49:51,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:51,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:51,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:51,519 INFO L87 Difference]: Start difference. First operand 465 states and 666 transitions. Second operand 5 states. [2019-09-08 06:49:52,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:52,567 INFO L93 Difference]: Finished difference Result 987 states and 1452 transitions. [2019-09-08 06:49:52,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:52,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:52,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:52,571 INFO L225 Difference]: With dead ends: 987 [2019-09-08 06:49:52,571 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 06:49:52,572 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-08 06:49:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 06:49:52,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 465. [2019-09-08 06:49:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 665 transitions. [2019-09-08 06:49:52,613 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 665 transitions. Word has length 231 [2019-09-08 06:49:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:52,614 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 665 transitions. [2019-09-08 06:49:52,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 665 transitions. [2019-09-08 06:49:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:52,615 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:52,616 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:52,616 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:52,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:52,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1705064290, now seen corresponding path program 1 times [2019-09-08 06:49:52,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:52,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:52,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:52,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:52,723 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-08 06:49:52,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:52,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:52,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:52,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:52,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:52,726 INFO L87 Difference]: Start difference. First operand 465 states and 665 transitions. Second operand 5 states. [2019-09-08 06:49:53,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:53,664 INFO L93 Difference]: Finished difference Result 985 states and 1446 transitions. [2019-09-08 06:49:53,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:53,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:53,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:53,669 INFO L225 Difference]: With dead ends: 985 [2019-09-08 06:49:53,669 INFO L226 Difference]: Without dead ends: 550 [2019-09-08 06:49:53,672 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-08 06:49:53,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-08 06:49:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 465. [2019-09-08 06:49:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 664 transitions. [2019-09-08 06:49:53,719 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 664 transitions. Word has length 231 [2019-09-08 06:49:53,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:53,720 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 664 transitions. [2019-09-08 06:49:53,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:53,720 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 664 transitions. [2019-09-08 06:49:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:53,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:53,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:53,722 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash -832275868, now seen corresponding path program 1 times [2019-09-08 06:49:53,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:53,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:53,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:53,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:53,847 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-08 06:49:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:53,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:53,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:53,849 INFO L87 Difference]: Start difference. First operand 465 states and 664 transitions. Second operand 5 states. [2019-09-08 06:49:54,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:54,787 INFO L93 Difference]: Finished difference Result 983 states and 1440 transitions. [2019-09-08 06:49:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:54,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:54,794 INFO L225 Difference]: With dead ends: 983 [2019-09-08 06:49:54,794 INFO L226 Difference]: Without dead ends: 548 [2019-09-08 06:49:54,795 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-08 06:49:54,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-09-08 06:49:54,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 465. [2019-09-08 06:49:54,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 663 transitions. [2019-09-08 06:49:54,840 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 663 transitions. Word has length 231 [2019-09-08 06:49:54,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:54,840 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 663 transitions. [2019-09-08 06:49:54,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 663 transitions. [2019-09-08 06:49:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:54,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:54,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:54,843 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:54,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:54,843 INFO L82 PathProgramCache]: Analyzing trace with hash -359936222, now seen corresponding path program 1 times [2019-09-08 06:49:54,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:54,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:54,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:54,946 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-08 06:49:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:54,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:54,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:54,948 INFO L87 Difference]: Start difference. First operand 465 states and 663 transitions. Second operand 5 states. [2019-09-08 06:49:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:55,860 INFO L93 Difference]: Finished difference Result 981 states and 1434 transitions. [2019-09-08 06:49:55,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:55,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:55,864 INFO L225 Difference]: With dead ends: 981 [2019-09-08 06:49:55,864 INFO L226 Difference]: Without dead ends: 546 [2019-09-08 06:49:55,865 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-08 06:49:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-09-08 06:49:55,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 465. [2019-09-08 06:49:55,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 662 transitions. [2019-09-08 06:49:55,914 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 662 transitions. Word has length 231 [2019-09-08 06:49:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:55,914 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 662 transitions. [2019-09-08 06:49:55,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 662 transitions. [2019-09-08 06:49:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:55,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:55,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:55,917 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:55,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:55,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1175983452, now seen corresponding path program 1 times [2019-09-08 06:49:55,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:55,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:55,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:55,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:55,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:56,029 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-08 06:49:56,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:56,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:56,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:56,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:56,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:56,030 INFO L87 Difference]: Start difference. First operand 465 states and 662 transitions. Second operand 5 states. [2019-09-08 06:49:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:57,059 INFO L93 Difference]: Finished difference Result 979 states and 1428 transitions. [2019-09-08 06:49:57,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:57,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:57,064 INFO L225 Difference]: With dead ends: 979 [2019-09-08 06:49:57,064 INFO L226 Difference]: Without dead ends: 544 [2019-09-08 06:49:57,065 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-08 06:49:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-09-08 06:49:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 465. [2019-09-08 06:49:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:57,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 661 transitions. [2019-09-08 06:49:57,106 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 661 transitions. Word has length 231 [2019-09-08 06:49:57,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:57,106 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 661 transitions. [2019-09-08 06:49:57,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 661 transitions. [2019-09-08 06:49:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:57,108 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:57,108 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:57,108 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1152997090, now seen corresponding path program 1 times [2019-09-08 06:49:57,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:57,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:57,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:57,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:57,210 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-08 06:49:57,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:57,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:57,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:57,212 INFO L87 Difference]: Start difference. First operand 465 states and 661 transitions. Second operand 5 states. [2019-09-08 06:49:58,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:58,124 INFO L93 Difference]: Finished difference Result 975 states and 1418 transitions. [2019-09-08 06:49:58,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:58,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:58,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:58,128 INFO L225 Difference]: With dead ends: 975 [2019-09-08 06:49:58,128 INFO L226 Difference]: Without dead ends: 540 [2019-09-08 06:49:58,129 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-08 06:49:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-09-08 06:49:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 465. [2019-09-08 06:49:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:58,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 660 transitions. [2019-09-08 06:49:58,180 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 660 transitions. Word has length 231 [2019-09-08 06:49:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:58,180 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 660 transitions. [2019-09-08 06:49:58,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:58,181 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 660 transitions. [2019-09-08 06:49:58,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:58,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:58,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:58,183 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:58,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:58,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1758771872, now seen corresponding path program 1 times [2019-09-08 06:49:58,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:58,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:58,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:58,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:58,292 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-08 06:49:58,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:58,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:58,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:58,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:58,294 INFO L87 Difference]: Start difference. First operand 465 states and 660 transitions. Second operand 5 states. [2019-09-08 06:49:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:59,284 INFO L93 Difference]: Finished difference Result 973 states and 1412 transitions. [2019-09-08 06:49:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:49:59,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:49:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:59,289 INFO L225 Difference]: With dead ends: 973 [2019-09-08 06:49:59,289 INFO L226 Difference]: Without dead ends: 538 [2019-09-08 06:49:59,295 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-08 06:49:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-09-08 06:49:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 465. [2019-09-08 06:49:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:49:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 659 transitions. [2019-09-08 06:49:59,352 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 659 transitions. Word has length 231 [2019-09-08 06:49:59,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:59,352 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 659 transitions. [2019-09-08 06:49:59,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:49:59,352 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 659 transitions. [2019-09-08 06:49:59,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:49:59,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:59,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:49:59,355 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:59,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:59,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1778312994, now seen corresponding path program 1 times [2019-09-08 06:49:59,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:59,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:59,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:59,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:59,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:59,476 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-08 06:49:59,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:49:59,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:49:59,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:49:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:49:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:49:59,478 INFO L87 Difference]: Start difference. First operand 465 states and 659 transitions. Second operand 5 states. [2019-09-08 06:50:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:00,411 INFO L93 Difference]: Finished difference Result 971 states and 1406 transitions. [2019-09-08 06:50:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:50:00,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 231 [2019-09-08 06:50:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:00,415 INFO L225 Difference]: With dead ends: 971 [2019-09-08 06:50:00,415 INFO L226 Difference]: Without dead ends: 536 [2019-09-08 06:50:00,416 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-08 06:50:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-09-08 06:50:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 465. [2019-09-08 06:50:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2019-09-08 06:50:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 658 transitions. [2019-09-08 06:50:00,468 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 658 transitions. Word has length 231 [2019-09-08 06:50:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:00,468 INFO L475 AbstractCegarLoop]: Abstraction has 465 states and 658 transitions. [2019-09-08 06:50:00,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 658 transitions. [2019-09-08 06:50:00,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-08 06:50:00,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:00,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:00,470 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:00,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:00,471 INFO L82 PathProgramCache]: Analyzing trace with hash 947659360, now seen corresponding path program 1 times [2019-09-08 06:50:00,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:00,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:00,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:00,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:00,571 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-08 06:50:00,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:00,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:00,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:00,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:00,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:00,573 INFO L87 Difference]: Start difference. First operand 465 states and 658 transitions. Second operand 4 states. [2019-09-08 06:50:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:01,258 INFO L93 Difference]: Finished difference Result 1325 states and 1939 transitions. [2019-09-08 06:50:01,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:01,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-08 06:50:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:01,263 INFO L225 Difference]: With dead ends: 1325 [2019-09-08 06:50:01,264 INFO L226 Difference]: Without dead ends: 891 [2019-09-08 06:50:01,265 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-08 06:50:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-09-08 06:50:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 890. [2019-09-08 06:50:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-09-08 06:50:01,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1257 transitions. [2019-09-08 06:50:01,375 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1257 transitions. Word has length 231 [2019-09-08 06:50:01,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:01,375 INFO L475 AbstractCegarLoop]: Abstraction has 890 states and 1257 transitions. [2019-09-08 06:50:01,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1257 transitions. [2019-09-08 06:50:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-09-08 06:50:01,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:01,381 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:01,381 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -29559523, now seen corresponding path program 1 times [2019-09-08 06:50:01,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:01,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:01,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:01,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 43 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 06:50:01,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:01,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:50:01,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:01,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 2541 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:01,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:50:02,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:02,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:50:02,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:50:02,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:50:02,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:50:02,188 INFO L87 Difference]: Start difference. First operand 890 states and 1257 transitions. Second operand 7 states. [2019-09-08 06:50:02,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:02,589 INFO L93 Difference]: Finished difference Result 2671 states and 3982 transitions. [2019-09-08 06:50:02,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:50:02,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 385 [2019-09-08 06:50:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:02,602 INFO L225 Difference]: With dead ends: 2671 [2019-09-08 06:50:02,602 INFO L226 Difference]: Without dead ends: 1812 [2019-09-08 06:50:02,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:50:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-09-08 06:50:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1727. [2019-09-08 06:50:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1727 states. [2019-09-08 06:50:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2495 transitions. [2019-09-08 06:50:02,903 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2495 transitions. Word has length 385 [2019-09-08 06:50:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:02,903 INFO L475 AbstractCegarLoop]: Abstraction has 1727 states and 2495 transitions. [2019-09-08 06:50:02,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:50:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2495 transitions. [2019-09-08 06:50:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2019-09-08 06:50:02,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:02,910 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:02,911 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:02,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:02,911 INFO L82 PathProgramCache]: Analyzing trace with hash 483338668, now seen corresponding path program 1 times [2019-09-08 06:50:02,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:02,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:02,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:02,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:02,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2019-09-08 06:50:03,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:03,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:03,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:03,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:03,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:03,107 INFO L87 Difference]: Start difference. First operand 1727 states and 2495 transitions. Second operand 4 states. [2019-09-08 06:50:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:03,514 INFO L93 Difference]: Finished difference Result 3407 states and 4915 transitions. [2019-09-08 06:50:03,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:03,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 414 [2019-09-08 06:50:03,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:03,524 INFO L225 Difference]: With dead ends: 3407 [2019-09-08 06:50:03,525 INFO L226 Difference]: Without dead ends: 1711 [2019-09-08 06:50:03,530 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-08 06:50:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1711 states. [2019-09-08 06:50:03,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1711 to 1711. [2019-09-08 06:50:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-09-08 06:50:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2464 transitions. [2019-09-08 06:50:03,776 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2464 transitions. Word has length 414 [2019-09-08 06:50:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:03,777 INFO L475 AbstractCegarLoop]: Abstraction has 1711 states and 2464 transitions. [2019-09-08 06:50:03,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2464 transitions. [2019-09-08 06:50:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-08 06:50:03,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:03,783 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:03,784 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:03,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:03,784 INFO L82 PathProgramCache]: Analyzing trace with hash -67967897, now seen corresponding path program 1 times [2019-09-08 06:50:03,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:03,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:03,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:03,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 41 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-08 06:50:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:03,987 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:50:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:04,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 2546 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:04,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:50:04,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:04,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:50:04,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:04,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:04,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:04,480 INFO L87 Difference]: Start difference. First operand 1711 states and 2464 transitions. Second operand 5 states. [2019-09-08 06:50:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:06,047 INFO L93 Difference]: Finished difference Result 6675 states and 10284 transitions. [2019-09-08 06:50:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:50:06,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 386 [2019-09-08 06:50:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:06,072 INFO L225 Difference]: With dead ends: 6675 [2019-09-08 06:50:06,072 INFO L226 Difference]: Without dead ends: 4995 [2019-09-08 06:50:06,084 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 390 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-08 06:50:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2019-09-08 06:50:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 4960. [2019-09-08 06:50:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4960 states. [2019-09-08 06:50:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4960 states to 4960 states and 7310 transitions. [2019-09-08 06:50:06,883 INFO L78 Accepts]: Start accepts. Automaton has 4960 states and 7310 transitions. Word has length 386 [2019-09-08 06:50:06,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:06,884 INFO L475 AbstractCegarLoop]: Abstraction has 4960 states and 7310 transitions. [2019-09-08 06:50:06,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 4960 states and 7310 transitions. [2019-09-08 06:50:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-09-08 06:50:06,895 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:06,896 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:06,896 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:06,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:06,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1994709987, now seen corresponding path program 1 times [2019-09-08 06:50:06,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:06,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:06,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:06,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:06,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:07,056 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:50:07,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:07,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:07,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:07,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:07,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:07,058 INFO L87 Difference]: Start difference. First operand 4960 states and 7310 transitions. Second operand 4 states. [2019-09-08 06:50:07,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:07,785 INFO L93 Difference]: Finished difference Result 9874 states and 14548 transitions. [2019-09-08 06:50:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:07,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2019-09-08 06:50:07,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:07,905 INFO L225 Difference]: With dead ends: 9874 [2019-09-08 06:50:07,905 INFO L226 Difference]: Without dead ends: 4945 [2019-09-08 06:50:07,921 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-08 06:50:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2019-09-08 06:50:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4945. [2019-09-08 06:50:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-09-08 06:50:08,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 7281 transitions. [2019-09-08 06:50:08,558 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 7281 transitions. Word has length 386 [2019-09-08 06:50:08,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:08,559 INFO L475 AbstractCegarLoop]: Abstraction has 4945 states and 7281 transitions. [2019-09-08 06:50:08,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 7281 transitions. [2019-09-08 06:50:08,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-09-08 06:50:08,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:08,568 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:08,568 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:08,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:08,569 INFO L82 PathProgramCache]: Analyzing trace with hash 159771616, now seen corresponding path program 1 times [2019-09-08 06:50:08,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:08,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:08,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:08,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 40 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-08 06:50:08,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:08,720 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:08,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:09,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 2547 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:09,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:50:09,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:09,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:50:09,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:50:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:50:09,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:50:09,210 INFO L87 Difference]: Start difference. First operand 4945 states and 7281 transitions. Second operand 7 states. [2019-09-08 06:50:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:10,132 INFO L93 Difference]: Finished difference Result 15032 states and 24071 transitions. [2019-09-08 06:50:10,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:50:10,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 387 [2019-09-08 06:50:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:10,188 INFO L225 Difference]: With dead ends: 15032 [2019-09-08 06:50:10,188 INFO L226 Difference]: Without dead ends: 10118 [2019-09-08 06:50:10,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:50:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10118 states. [2019-09-08 06:50:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10118 to 10079. [2019-09-08 06:50:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10079 states. [2019-09-08 06:50:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10079 states to 10079 states and 15655 transitions. [2019-09-08 06:50:11,846 INFO L78 Accepts]: Start accepts. Automaton has 10079 states and 15655 transitions. Word has length 387 [2019-09-08 06:50:11,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:11,846 INFO L475 AbstractCegarLoop]: Abstraction has 10079 states and 15655 transitions. [2019-09-08 06:50:11,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:50:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 10079 states and 15655 transitions. [2019-09-08 06:50:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2019-09-08 06:50:11,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:11,867 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:11,867 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:11,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1195214218, now seen corresponding path program 1 times [2019-09-08 06:50:11,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:11,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:11,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:11,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:11,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-08 06:50:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:12,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:12,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:12,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 2672 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:12,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:50:12,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:12,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:50:12,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:50:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:50:12,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:50:12,581 INFO L87 Difference]: Start difference. First operand 10079 states and 15655 transitions. Second operand 7 states. [2019-09-08 06:50:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:14,183 INFO L93 Difference]: Finished difference Result 28107 states and 46988 transitions. [2019-09-08 06:50:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:50:14,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 418 [2019-09-08 06:50:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:14,277 INFO L225 Difference]: With dead ends: 28107 [2019-09-08 06:50:14,277 INFO L226 Difference]: Without dead ends: 18072 [2019-09-08 06:50:14,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:50:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18072 states. [2019-09-08 06:50:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18072 to 18060. [2019-09-08 06:50:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18060 states. [2019-09-08 06:50:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18060 states to 18060 states and 28783 transitions. [2019-09-08 06:50:16,287 INFO L78 Accepts]: Start accepts. Automaton has 18060 states and 28783 transitions. Word has length 418 [2019-09-08 06:50:16,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:16,288 INFO L475 AbstractCegarLoop]: Abstraction has 18060 states and 28783 transitions. [2019-09-08 06:50:16,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:50:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18060 states and 28783 transitions. [2019-09-08 06:50:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 06:50:16,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:16,326 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:16,326 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1710904001, now seen corresponding path program 1 times [2019-09-08 06:50:16,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:16,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:16,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:16,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-08 06:50:16,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:16,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:50:16,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:16,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:50:16,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:50:17,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:17,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:50:17,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:50:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:50:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:50:17,425 INFO L87 Difference]: Start difference. First operand 18060 states and 28783 transitions. Second operand 5 states. [2019-09-08 06:50:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:25,437 INFO L93 Difference]: Finished difference Result 89276 states and 173287 transitions. [2019-09-08 06:50:25,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:50:25,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 419 [2019-09-08 06:50:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:25,888 INFO L225 Difference]: With dead ends: 89276 [2019-09-08 06:50:25,888 INFO L226 Difference]: Without dead ends: 71260 [2019-09-08 06:50:26,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 423 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-08 06:50:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71260 states. [2019-09-08 06:50:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71260 to 70963. [2019-09-08 06:50:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70963 states. [2019-09-08 06:50:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70963 states to 70963 states and 125342 transitions. [2019-09-08 06:50:36,063 INFO L78 Accepts]: Start accepts. Automaton has 70963 states and 125342 transitions. Word has length 419 [2019-09-08 06:50:36,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:36,064 INFO L475 AbstractCegarLoop]: Abstraction has 70963 states and 125342 transitions. [2019-09-08 06:50:36,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:50:36,064 INFO L276 IsEmpty]: Start isEmpty. Operand 70963 states and 125342 transitions. [2019-09-08 06:50:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 06:50:36,162 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:36,162 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:36,162 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:36,162 INFO L82 PathProgramCache]: Analyzing trace with hash 837932080, now seen corresponding path program 1 times [2019-09-08 06:50:36,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:36,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:36,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:36,326 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 06:50:36,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:36,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:36,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:36,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:36,328 INFO L87 Difference]: Start difference. First operand 70963 states and 125342 transitions. Second operand 4 states. [2019-09-08 06:50:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:43,993 INFO L93 Difference]: Finished difference Result 124288 states and 216729 transitions. [2019-09-08 06:50:43,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:43,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-09-08 06:50:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:44,302 INFO L225 Difference]: With dead ends: 124288 [2019-09-08 06:50:44,302 INFO L226 Difference]: Without dead ends: 53368 [2019-09-08 06:50:44,594 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-08 06:50:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53368 states. [2019-09-08 06:50:52,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53368 to 53368. [2019-09-08 06:50:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53368 states. [2019-09-08 06:50:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53368 states to 53368 states and 91454 transitions. [2019-09-08 06:50:52,852 INFO L78 Accepts]: Start accepts. Automaton has 53368 states and 91454 transitions. Word has length 419 [2019-09-08 06:50:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:52,852 INFO L475 AbstractCegarLoop]: Abstraction has 53368 states and 91454 transitions. [2019-09-08 06:50:52,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:50:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 53368 states and 91454 transitions. [2019-09-08 06:50:52,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 06:50:52,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:52,930 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:50:52,930 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:52,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1206577692, now seen corresponding path program 1 times [2019-09-08 06:50:52,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:52,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:52,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:50:53,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:50:53,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:50:53,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:50:53,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:50:53,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:50:53,082 INFO L87 Difference]: Start difference. First operand 53368 states and 91454 transitions. Second operand 4 states. [2019-09-08 06:50:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:50:58,605 INFO L93 Difference]: Finished difference Result 106692 states and 182839 transitions. [2019-09-08 06:50:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:50:58,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-09-08 06:50:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:50:58,853 INFO L225 Difference]: With dead ends: 106692 [2019-09-08 06:50:58,853 INFO L226 Difference]: Without dead ends: 53355 [2019-09-08 06:50:59,040 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-08 06:50:59,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53355 states. [2019-09-08 06:51:07,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53355 to 53355. [2019-09-08 06:51:07,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53355 states. [2019-09-08 06:51:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53355 states to 53355 states and 91427 transitions. [2019-09-08 06:51:07,290 INFO L78 Accepts]: Start accepts. Automaton has 53355 states and 91427 transitions. Word has length 388 [2019-09-08 06:51:07,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:07,291 INFO L475 AbstractCegarLoop]: Abstraction has 53355 states and 91427 transitions. [2019-09-08 06:51:07,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 53355 states and 91427 transitions. [2019-09-08 06:51:07,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 06:51:07,356 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:07,357 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:07,357 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2011247135, now seen corresponding path program 1 times [2019-09-08 06:51:07,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:07,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:07,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-08 06:51:07,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:07,505 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:07,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 2551 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:07,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:51:08,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:08,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:08,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:08,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:08,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:08,158 INFO L87 Difference]: Start difference. First operand 53355 states and 91427 transitions. Second operand 7 states. [2019-09-08 06:51:18,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:18,965 INFO L93 Difference]: Finished difference Result 166055 states and 343197 transitions. [2019-09-08 06:51:18,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:18,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 389 [2019-09-08 06:51:18,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:19,574 INFO L225 Difference]: With dead ends: 166055 [2019-09-08 06:51:19,574 INFO L226 Difference]: Without dead ends: 112731 [2019-09-08 06:51:20,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112731 states. [2019-09-08 06:51:36,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112731 to 112404. [2019-09-08 06:51:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112404 states. [2019-09-08 06:51:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112404 states to 112404 states and 218145 transitions. [2019-09-08 06:51:36,783 INFO L78 Accepts]: Start accepts. Automaton has 112404 states and 218145 transitions. Word has length 389 [2019-09-08 06:51:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:36,783 INFO L475 AbstractCegarLoop]: Abstraction has 112404 states and 218145 transitions. [2019-09-08 06:51:36,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:36,784 INFO L276 IsEmpty]: Start isEmpty. Operand 112404 states and 218145 transitions. [2019-09-08 06:51:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-09-08 06:51:36,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:36,935 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:36,935 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1755884245, now seen corresponding path program 1 times [2019-09-08 06:51:36,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:36,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:51:37,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:37,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:37,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:37,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:37,071 INFO L87 Difference]: Start difference. First operand 112404 states and 218145 transitions. Second operand 4 states. [2019-09-08 06:51:54,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:54,136 INFO L93 Difference]: Finished difference Result 224765 states and 436224 transitions. [2019-09-08 06:51:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:54,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-09-08 06:51:54,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:54,719 INFO L225 Difference]: With dead ends: 224765 [2019-09-08 06:51:54,719 INFO L226 Difference]: Without dead ends: 112392 [2019-09-08 06:51:55,840 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-08 06:51:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112392 states. [2019-09-08 06:52:12,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112392 to 112392. [2019-09-08 06:52:12,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112392 states. [2019-09-08 06:52:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112392 states to 112392 states and 218120 transitions. [2019-09-08 06:52:13,674 INFO L78 Accepts]: Start accepts. Automaton has 112392 states and 218120 transitions. Word has length 389 [2019-09-08 06:52:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:13,674 INFO L475 AbstractCegarLoop]: Abstraction has 112392 states and 218120 transitions. [2019-09-08 06:52:13,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 112392 states and 218120 transitions. [2019-09-08 06:52:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 06:52:13,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:13,831 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:13,831 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:13,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:13,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1886964339, now seen corresponding path program 1 times [2019-09-08 06:52:13,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:13,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:13,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:13,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-09-08 06:52:14,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:14,788 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:52:14,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:15,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:15,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:15,275 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 06:52:15,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:15,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:52:15,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:52:15,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:52:15,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:52:15,293 INFO L87 Difference]: Start difference. First operand 112392 states and 218120 transitions. Second operand 5 states. [2019-09-08 06:53:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:08,269 INFO L93 Difference]: Finished difference Result 446700 states and 1179934 transitions. [2019-09-08 06:53:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:53:08,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 424 [2019-09-08 06:53:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:20,024 INFO L225 Difference]: With dead ends: 446700 [2019-09-08 06:53:20,024 INFO L226 Difference]: Without dead ends: 334339 [2019-09-08 06:53:30,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 426 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:53:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334339 states. [2019-09-08 06:54:42,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334339 to 332926. [2019-09-08 06:54:42,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332926 states. [2019-09-08 06:55:01,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332926 states to 332926 states and 772840 transitions. [2019-09-08 06:55:01,245 INFO L78 Accepts]: Start accepts. Automaton has 332926 states and 772840 transitions. Word has length 424 [2019-09-08 06:55:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:01,246 INFO L475 AbstractCegarLoop]: Abstraction has 332926 states and 772840 transitions. [2019-09-08 06:55:01,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 332926 states and 772840 transitions. [2019-09-08 06:55:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-09-08 06:55:01,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:01,768 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:01,768 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:01,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:01,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2023798021, now seen corresponding path program 1 times [2019-09-08 06:55:01,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:01,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-08 06:55:01,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:55:01,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:55:01,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:55:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:55:01,921 INFO L87 Difference]: Start difference. First operand 332926 states and 772840 transitions. Second operand 4 states. [2019-09-08 06:56:16,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:16,995 INFO L93 Difference]: Finished difference Result 665810 states and 1545617 transitions. [2019-09-08 06:56:16,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:16,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 424 [2019-09-08 06:56:16,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:19,060 INFO L225 Difference]: With dead ends: 665810 [2019-09-08 06:56:19,060 INFO L226 Difference]: Without dead ends: 332915 [2019-09-08 06:56:40,895 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-08 06:56:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332915 states.