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.08.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:42:38,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:42:38,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:42:38,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:42:38,840 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:42:38,841 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:42:38,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:42:38,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:42:38,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:42:38,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:42:38,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:42:38,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:42:38,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:42:38,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:42:38,851 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:42:38,852 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:42:38,853 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:42:38,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:42:38,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:42:38,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:42:38,858 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:42:38,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:42:38,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:42:38,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:42:38,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:42:38,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:42:38,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:42:38,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:42:38,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:42:38,866 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:42:38,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:42:38,867 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:42:38,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:42:38,869 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:42:38,870 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:42:38,870 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:42:38,871 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:42:38,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:42:38,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:42:38,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:42:38,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:42:38,874 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:42:38,888 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:42:38,888 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:42:38,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:42:38,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:42:38,890 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:42:38,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:42:38,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:42:38,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:42:38,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:42:38,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:42:38,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:42:38,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:42:38,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:42:38,891 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:42:38,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:42:38,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:42:38,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:42:38,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:42:38,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:42:38,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:42:38,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:42:38,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:42:38,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:42:38,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:42:38,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:42:38,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:42:38,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:42:38,939 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:42:38,940 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:42:38,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.08.cil-2.c [2019-09-08 06:42:38,997 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98be8bcd/e7e75bb0439142fc9a2d367a3eb17481/FLAG972abb2cd [2019-09-08 06:42:39,511 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:42:39,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.08.cil-2.c [2019-09-08 06:42:39,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98be8bcd/e7e75bb0439142fc9a2d367a3eb17481/FLAG972abb2cd [2019-09-08 06:42:39,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c98be8bcd/e7e75bb0439142fc9a2d367a3eb17481 [2019-09-08 06:42:39,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:42:39,844 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:42:39,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:42:39,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:42:39,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:42:39,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:42:39" (1/1) ... [2019-09-08 06:42:39,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5743f5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:39, skipping insertion in model container [2019-09-08 06:42:39,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:42:39" (1/1) ... [2019-09-08 06:42:39,862 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:42:39,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:42:40,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:42:40,381 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:42:40,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:42:40,500 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:42:40,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40 WrapperNode [2019-09-08 06:42:40,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:42:40,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:42:40,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:42:40,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:42:40,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,577 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (1/1) ... [2019-09-08 06:42:40,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:42:40,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:42:40,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:42:40,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:42:40,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (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:42:40,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:42:40,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:42:40,653 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:42:40,653 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:42:40,654 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:42:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:42:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:42:40,655 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:42:40,656 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:42:40,656 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:42:40,657 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:42:40,659 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:42:40,660 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:42:40,661 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:42:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:42:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:42:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:42:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:42:40,662 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:42:40,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:42:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:42:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:42:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:42:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:42:40,663 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:42:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:42:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:42:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:42:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:42:40,664 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:42:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:42:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:42:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:42:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:42:40,665 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:42:40,666 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:42:40,667 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:42:40,668 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:42:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:42:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:42:40,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:42:41,772 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:42:41,773 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-08 06:42:41,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:42:41 BoogieIcfgContainer [2019-09-08 06:42:41,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:42:41,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:42:41,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:42:41,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:42:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:42:39" (1/3) ... [2019-09-08 06:42:41,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f4492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:42:41, skipping insertion in model container [2019-09-08 06:42:41,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:42:40" (2/3) ... [2019-09-08 06:42:41,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f4492f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:42:41, skipping insertion in model container [2019-09-08 06:42:41,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:42:41" (3/3) ... [2019-09-08 06:42:41,782 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-2.c [2019-09-08 06:42:41,792 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:42:41,800 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:42:41,816 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:42:41,849 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:42:41,850 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:42:41,850 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:42:41,850 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:42:41,851 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:42:41,851 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:42:41,851 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:42:41,851 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:42:41,851 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:42:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states. [2019-09-08 06:42:41,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:41,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:41,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:41,904 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:41,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -17079978, now seen corresponding path program 1 times [2019-09-08 06:42:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:41,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:41,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:42,405 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:42:42,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:42,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:42,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:42,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:42,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:42,430 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 4 states. [2019-09-08 06:42:42,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:42,748 INFO L93 Difference]: Finished difference Result 700 states and 1070 transitions. [2019-09-08 06:42:42,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:42,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 06:42:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:42,768 INFO L225 Difference]: With dead ends: 700 [2019-09-08 06:42:42,768 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 06:42:42,776 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:42:42,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 06:42:42,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2019-09-08 06:42:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 510 transitions. [2019-09-08 06:42:42,861 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 510 transitions. Word has length 176 [2019-09-08 06:42:42,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:42,863 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 510 transitions. [2019-09-08 06:42:42,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:42,864 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 510 transitions. [2019-09-08 06:42:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:42,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:42,869 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:42,870 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:42,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1752391636, now seen corresponding path program 1 times [2019-09-08 06:42:42,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:42,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:42,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:43,124 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:42:43,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:43,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:43,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:43,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:43,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:43,134 INFO L87 Difference]: Start difference. First operand 352 states and 510 transitions. Second operand 5 states. [2019-09-08 06:42:43,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:43,956 INFO L93 Difference]: Finished difference Result 732 states and 1086 transitions. [2019-09-08 06:42:43,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:43,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:43,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:43,963 INFO L225 Difference]: With dead ends: 732 [2019-09-08 06:42:43,963 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 06:42:43,966 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:42:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 06:42:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 352. [2019-09-08 06:42:44,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 509 transitions. [2019-09-08 06:42:44,028 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 509 transitions. Word has length 176 [2019-09-08 06:42:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:44,028 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 509 transitions. [2019-09-08 06:42:44,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 509 transitions. [2019-09-08 06:42:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:44,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:44,034 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:44,034 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:44,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1487744146, now seen corresponding path program 1 times [2019-09-08 06:42:44,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:44,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:44,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:44,203 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:42:44,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:44,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:44,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:44,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:44,205 INFO L87 Difference]: Start difference. First operand 352 states and 509 transitions. Second operand 5 states. [2019-09-08 06:42:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:44,962 INFO L93 Difference]: Finished difference Result 732 states and 1085 transitions. [2019-09-08 06:42:44,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:44,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:44,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:44,967 INFO L225 Difference]: With dead ends: 732 [2019-09-08 06:42:44,967 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 06:42:44,968 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:42:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 06:42:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 352. [2019-09-08 06:42:44,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 508 transitions. [2019-09-08 06:42:44,997 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 508 transitions. Word has length 176 [2019-09-08 06:42:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:44,998 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 508 transitions. [2019-09-08 06:42:44,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 508 transitions. [2019-09-08 06:42:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:45,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:45,001 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:45,002 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:45,002 INFO L82 PathProgramCache]: Analyzing trace with hash -876097516, now seen corresponding path program 1 times [2019-09-08 06:42:45,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:45,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:45,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:45,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:45,100 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:42:45,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:45,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:45,102 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:45,103 INFO L87 Difference]: Start difference. First operand 352 states and 508 transitions. Second operand 5 states. [2019-09-08 06:42:45,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:45,824 INFO L93 Difference]: Finished difference Result 730 states and 1079 transitions. [2019-09-08 06:42:45,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:45,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:45,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:45,831 INFO L225 Difference]: With dead ends: 730 [2019-09-08 06:42:45,831 INFO L226 Difference]: Without dead ends: 404 [2019-09-08 06:42:45,834 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:42:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-09-08 06:42:45,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 352. [2019-09-08 06:42:45,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 507 transitions. [2019-09-08 06:42:45,864 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 507 transitions. Word has length 176 [2019-09-08 06:42:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:45,865 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 507 transitions. [2019-09-08 06:42:45,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:45,865 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 507 transitions. [2019-09-08 06:42:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:45,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:45,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:45,868 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:45,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 2095690834, now seen corresponding path program 1 times [2019-09-08 06:42:45,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:45,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:45,956 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:42:45,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:45,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:45,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:45,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:45,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:45,958 INFO L87 Difference]: Start difference. First operand 352 states and 507 transitions. Second operand 5 states. [2019-09-08 06:42:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:46,618 INFO L93 Difference]: Finished difference Result 726 states and 1069 transitions. [2019-09-08 06:42:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:46,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:46,622 INFO L225 Difference]: With dead ends: 726 [2019-09-08 06:42:46,622 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 06:42:46,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:42:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 06:42:46,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 352. [2019-09-08 06:42:46,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 506 transitions. [2019-09-08 06:42:46,649 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 506 transitions. Word has length 176 [2019-09-08 06:42:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:46,650 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 506 transitions. [2019-09-08 06:42:46,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 506 transitions. [2019-09-08 06:42:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:46,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:46,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:46,653 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:46,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:46,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1860988912, now seen corresponding path program 1 times [2019-09-08 06:42:46,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:46,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:46,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:46,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:46,738 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:42:46,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:46,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:46,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:46,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:46,740 INFO L87 Difference]: Start difference. First operand 352 states and 506 transitions. Second operand 5 states. [2019-09-08 06:42:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:47,380 INFO L93 Difference]: Finished difference Result 724 states and 1063 transitions. [2019-09-08 06:42:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:47,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:47,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:47,384 INFO L225 Difference]: With dead ends: 724 [2019-09-08 06:42:47,384 INFO L226 Difference]: Without dead ends: 398 [2019-09-08 06:42:47,386 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:42:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-08 06:42:47,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 352. [2019-09-08 06:42:47,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 505 transitions. [2019-09-08 06:42:47,411 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 505 transitions. Word has length 176 [2019-09-08 06:42:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:47,411 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 505 transitions. [2019-09-08 06:42:47,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 505 transitions. [2019-09-08 06:42:47,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:47,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:47,414 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:47,414 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1434434414, now seen corresponding path program 1 times [2019-09-08 06:42:47,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:47,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:47,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:47,533 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:42:47,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:47,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:47,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:47,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:47,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:47,535 INFO L87 Difference]: Start difference. First operand 352 states and 505 transitions. Second operand 5 states. [2019-09-08 06:42:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:48,248 INFO L93 Difference]: Finished difference Result 722 states and 1057 transitions. [2019-09-08 06:42:48,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:48,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:48,252 INFO L225 Difference]: With dead ends: 722 [2019-09-08 06:42:48,252 INFO L226 Difference]: Without dead ends: 396 [2019-09-08 06:42:48,253 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:42:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2019-09-08 06:42:48,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 352. [2019-09-08 06:42:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 504 transitions. [2019-09-08 06:42:48,277 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 504 transitions. Word has length 176 [2019-09-08 06:42:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:48,278 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 504 transitions. [2019-09-08 06:42:48,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 504 transitions. [2019-09-08 06:42:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:48,280 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:48,280 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:48,280 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1974863920, now seen corresponding path program 1 times [2019-09-08 06:42:48,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:48,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:48,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:48,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:48,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:48,360 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:42:48,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:48,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:48,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:48,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:48,362 INFO L87 Difference]: Start difference. First operand 352 states and 504 transitions. Second operand 5 states. [2019-09-08 06:42:49,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:49,092 INFO L93 Difference]: Finished difference Result 720 states and 1051 transitions. [2019-09-08 06:42:49,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:49,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:49,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:49,095 INFO L225 Difference]: With dead ends: 720 [2019-09-08 06:42:49,095 INFO L226 Difference]: Without dead ends: 394 [2019-09-08 06:42:49,097 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:42:49,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-09-08 06:42:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 352. [2019-09-08 06:42:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:49,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 503 transitions. [2019-09-08 06:42:49,121 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 503 transitions. Word has length 176 [2019-09-08 06:42:49,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:49,121 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 503 transitions. [2019-09-08 06:42:49,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 503 transitions. [2019-09-08 06:42:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:49,123 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:49,124 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:49,124 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:49,124 INFO L82 PathProgramCache]: Analyzing trace with hash -2130844462, now seen corresponding path program 1 times [2019-09-08 06:42:49,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:49,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:49,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:49,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:49,202 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:42:49,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:49,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:49,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:49,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:49,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:49,203 INFO L87 Difference]: Start difference. First operand 352 states and 503 transitions. Second operand 5 states. [2019-09-08 06:42:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:49,895 INFO L93 Difference]: Finished difference Result 718 states and 1045 transitions. [2019-09-08 06:42:49,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:49,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:49,900 INFO L225 Difference]: With dead ends: 718 [2019-09-08 06:42:49,900 INFO L226 Difference]: Without dead ends: 392 [2019-09-08 06:42:49,903 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:42:49,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-08 06:42:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 352. [2019-09-08 06:42:49,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 502 transitions. [2019-09-08 06:42:49,934 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 502 transitions. Word has length 176 [2019-09-08 06:42:49,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:49,935 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 502 transitions. [2019-09-08 06:42:49,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:49,935 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 502 transitions. [2019-09-08 06:42:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:49,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:49,937 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:49,937 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:49,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:49,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1720234096, now seen corresponding path program 1 times [2019-09-08 06:42:49,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:49,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:49,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:50,080 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:42:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:50,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:50,082 INFO L87 Difference]: Start difference. First operand 352 states and 502 transitions. Second operand 5 states. [2019-09-08 06:42:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:50,719 INFO L93 Difference]: Finished difference Result 753 states and 1107 transitions. [2019-09-08 06:42:50,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:50,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:50,725 INFO L225 Difference]: With dead ends: 753 [2019-09-08 06:42:50,725 INFO L226 Difference]: Without dead ends: 427 [2019-09-08 06:42:50,727 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:42:50,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2019-09-08 06:42:50,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 352. [2019-09-08 06:42:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 501 transitions. [2019-09-08 06:42:50,767 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 501 transitions. Word has length 176 [2019-09-08 06:42:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:50,767 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 501 transitions. [2019-09-08 06:42:50,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 501 transitions. [2019-09-08 06:42:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:50,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:50,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:50,769 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:50,770 INFO L82 PathProgramCache]: Analyzing trace with hash 786863378, now seen corresponding path program 1 times [2019-09-08 06:42:50,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:50,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:50,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:50,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:50,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:50,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:42:50,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:50,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:50,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:50,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:50,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:50,881 INFO L87 Difference]: Start difference. First operand 352 states and 501 transitions. Second operand 5 states. [2019-09-08 06:42:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:51,619 INFO L93 Difference]: Finished difference Result 747 states and 1096 transitions. [2019-09-08 06:42:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:51,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:51,623 INFO L225 Difference]: With dead ends: 747 [2019-09-08 06:42:51,625 INFO L226 Difference]: Without dead ends: 421 [2019-09-08 06:42:51,626 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:42:51,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-08 06:42:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 352. [2019-09-08 06:42:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 500 transitions. [2019-09-08 06:42:51,658 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 500 transitions. Word has length 176 [2019-09-08 06:42:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:51,658 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 500 transitions. [2019-09-08 06:42:51,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 500 transitions. [2019-09-08 06:42:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:51,660 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:51,660 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:51,661 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:51,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:51,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1349019824, now seen corresponding path program 1 times [2019-09-08 06:42:51,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:51,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:51,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:51,775 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:42:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:51,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:51,777 INFO L87 Difference]: Start difference. First operand 352 states and 500 transitions. Second operand 5 states. [2019-09-08 06:42:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:52,494 INFO L93 Difference]: Finished difference Result 747 states and 1091 transitions. [2019-09-08 06:42:52,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:52,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:52,498 INFO L225 Difference]: With dead ends: 747 [2019-09-08 06:42:52,498 INFO L226 Difference]: Without dead ends: 421 [2019-09-08 06:42:52,500 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:42:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-09-08 06:42:52,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 352. [2019-09-08 06:42:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:52,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 499 transitions. [2019-09-08 06:42:52,531 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 499 transitions. Word has length 176 [2019-09-08 06:42:52,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:52,531 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 499 transitions. [2019-09-08 06:42:52,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 499 transitions. [2019-09-08 06:42:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:52,533 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:52,533 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:52,534 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:52,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:52,534 INFO L82 PathProgramCache]: Analyzing trace with hash -931131122, now seen corresponding path program 1 times [2019-09-08 06:42:52,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:52,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:52,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:52,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:52,615 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:42:52,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:52,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:52,617 INFO L87 Difference]: Start difference. First operand 352 states and 499 transitions. Second operand 5 states. [2019-09-08 06:42:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:53,337 INFO L93 Difference]: Finished difference Result 745 states and 1085 transitions. [2019-09-08 06:42:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:53,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:53,341 INFO L225 Difference]: With dead ends: 745 [2019-09-08 06:42:53,341 INFO L226 Difference]: Without dead ends: 419 [2019-09-08 06:42:53,342 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:42:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-09-08 06:42:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 352. [2019-09-08 06:42:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 498 transitions. [2019-09-08 06:42:53,373 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 498 transitions. Word has length 176 [2019-09-08 06:42:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:53,373 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 498 transitions. [2019-09-08 06:42:53,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 498 transitions. [2019-09-08 06:42:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:53,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:53,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:53,375 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash 467822480, now seen corresponding path program 1 times [2019-09-08 06:42:53,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:53,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:53,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:42:53,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:53,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:53,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:53,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:53,454 INFO L87 Difference]: Start difference. First operand 352 states and 498 transitions. Second operand 5 states. [2019-09-08 06:42:54,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:54,161 INFO L93 Difference]: Finished difference Result 743 states and 1079 transitions. [2019-09-08 06:42:54,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:54,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:54,166 INFO L225 Difference]: With dead ends: 743 [2019-09-08 06:42:54,166 INFO L226 Difference]: Without dead ends: 417 [2019-09-08 06:42:54,169 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:42:54,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2019-09-08 06:42:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 352. [2019-09-08 06:42:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 497 transitions. [2019-09-08 06:42:54,223 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 497 transitions. Word has length 176 [2019-09-08 06:42:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:54,224 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 497 transitions. [2019-09-08 06:42:54,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 497 transitions. [2019-09-08 06:42:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:54,228 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:54,228 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:54,228 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:54,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:54,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1149617970, now seen corresponding path program 1 times [2019-09-08 06:42:54,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:54,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:54,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:54,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:54,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:54,361 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:42:54,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:54,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:54,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:54,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:54,364 INFO L87 Difference]: Start difference. First operand 352 states and 497 transitions. Second operand 5 states. [2019-09-08 06:42:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:55,226 INFO L93 Difference]: Finished difference Result 741 states and 1073 transitions. [2019-09-08 06:42:55,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:55,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:55,230 INFO L225 Difference]: With dead ends: 741 [2019-09-08 06:42:55,230 INFO L226 Difference]: Without dead ends: 415 [2019-09-08 06:42:55,232 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:42:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-08 06:42:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 352. [2019-09-08 06:42:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 496 transitions. [2019-09-08 06:42:55,265 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 496 transitions. Word has length 176 [2019-09-08 06:42:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:55,265 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 496 transitions. [2019-09-08 06:42:55,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:55,266 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 496 transitions. [2019-09-08 06:42:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:55,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:55,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:55,269 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -786151472, now seen corresponding path program 1 times [2019-09-08 06:42:55,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:55,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:55,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:55,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:55,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:55,343 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:42:55,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:55,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:55,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:55,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:55,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:55,347 INFO L87 Difference]: Start difference. First operand 352 states and 496 transitions. Second operand 5 states. [2019-09-08 06:42:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:56,019 INFO L93 Difference]: Finished difference Result 739 states and 1067 transitions. [2019-09-08 06:42:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:56,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:56,024 INFO L225 Difference]: With dead ends: 739 [2019-09-08 06:42:56,025 INFO L226 Difference]: Without dead ends: 413 [2019-09-08 06:42:56,027 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:42:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-09-08 06:42:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 352. [2019-09-08 06:42:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 495 transitions. [2019-09-08 06:42:56,072 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 495 transitions. Word has length 176 [2019-09-08 06:42:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:56,073 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 495 transitions. [2019-09-08 06:42:56,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 495 transitions. [2019-09-08 06:42:56,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:56,075 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:56,075 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:56,075 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -497332082, now seen corresponding path program 1 times [2019-09-08 06:42:56,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:56,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:56,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:56,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:56,173 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:42:56,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:56,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:42:56,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:42:56,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:42:56,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:42:56,176 INFO L87 Difference]: Start difference. First operand 352 states and 495 transitions. Second operand 5 states. [2019-09-08 06:42:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:56,894 INFO L93 Difference]: Finished difference Result 737 states and 1061 transitions. [2019-09-08 06:42:56,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:42:56,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:42:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:56,898 INFO L225 Difference]: With dead ends: 737 [2019-09-08 06:42:56,898 INFO L226 Difference]: Without dead ends: 411 [2019-09-08 06:42:56,899 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:42:56,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2019-09-08 06:42:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 352. [2019-09-08 06:42:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-08 06:42:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 494 transitions. [2019-09-08 06:42:56,934 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 494 transitions. Word has length 176 [2019-09-08 06:42:56,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:56,934 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 494 transitions. [2019-09-08 06:42:56,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:42:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 494 transitions. [2019-09-08 06:42:56,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:56,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:56,936 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:56,936 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:56,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:56,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1042204656, now seen corresponding path program 1 times [2019-09-08 06:42:56,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:56,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:56,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:56,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:57,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:42:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:57,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:57,017 INFO L87 Difference]: Start difference. First operand 352 states and 494 transitions. Second operand 6 states. [2019-09-08 06:42:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:57,087 INFO L93 Difference]: Finished difference Result 708 states and 1024 transitions. [2019-09-08 06:42:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:57,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:42:57,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:57,090 INFO L225 Difference]: With dead ends: 708 [2019-09-08 06:42:57,090 INFO L226 Difference]: Without dead ends: 383 [2019-09-08 06:42:57,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:57,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2019-09-08 06:42:57,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 357. [2019-09-08 06:42:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-09-08 06:42:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 499 transitions. [2019-09-08 06:42:57,127 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 499 transitions. Word has length 176 [2019-09-08 06:42:57,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:57,127 INFO L475 AbstractCegarLoop]: Abstraction has 357 states and 499 transitions. [2019-09-08 06:42:57,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 499 transitions. [2019-09-08 06:42:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:57,129 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:57,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:57,129 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1410286926, now seen corresponding path program 1 times [2019-09-08 06:42:57,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:57,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:57,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:57,202 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:42:57,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:57,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:57,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:57,204 INFO L87 Difference]: Start difference. First operand 357 states and 499 transitions. Second operand 4 states. [2019-09-08 06:42:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:57,706 INFO L93 Difference]: Finished difference Result 1010 states and 1459 transitions. [2019-09-08 06:42:57,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:57,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 06:42:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:57,715 INFO L225 Difference]: With dead ends: 1010 [2019-09-08 06:42:57,715 INFO L226 Difference]: Without dead ends: 680 [2019-09-08 06:42:57,718 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:42:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2019-09-08 06:42:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 674. [2019-09-08 06:42:57,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-09-08 06:42:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 942 transitions. [2019-09-08 06:42:57,810 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 942 transitions. Word has length 176 [2019-09-08 06:42:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:57,811 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 942 transitions. [2019-09-08 06:42:57,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 942 transitions. [2019-09-08 06:42:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:57,812 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:57,812 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:57,813 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:57,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash -865177009, now seen corresponding path program 1 times [2019-09-08 06:42:57,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:57,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:57,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:57,896 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:42:57,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:57,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:57,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:57,898 INFO L87 Difference]: Start difference. First operand 674 states and 942 transitions. Second operand 6 states. [2019-09-08 06:42:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:58,031 INFO L93 Difference]: Finished difference Result 1349 states and 1935 transitions. [2019-09-08 06:42:58,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:58,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:42:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:58,036 INFO L225 Difference]: With dead ends: 1349 [2019-09-08 06:42:58,037 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 06:42:58,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 06:42:58,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 679. [2019-09-08 06:42:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-09-08 06:42:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 946 transitions. [2019-09-08 06:42:58,111 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 946 transitions. Word has length 176 [2019-09-08 06:42:58,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,111 INFO L475 AbstractCegarLoop]: Abstraction has 679 states and 946 transitions. [2019-09-08 06:42:58,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 946 transitions. [2019-09-08 06:42:58,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:58,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:58,114 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1903761583, now seen corresponding path program 1 times [2019-09-08 06:42:58,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,196 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:42:58,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:58,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:58,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:58,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:58,198 INFO L87 Difference]: Start difference. First operand 679 states and 946 transitions. Second operand 6 states. [2019-09-08 06:42:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:58,296 INFO L93 Difference]: Finished difference Result 1381 states and 1979 transitions. [2019-09-08 06:42:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:58,297 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:42:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:58,305 INFO L225 Difference]: With dead ends: 1381 [2019-09-08 06:42:58,305 INFO L226 Difference]: Without dead ends: 729 [2019-09-08 06:42:58,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2019-09-08 06:42:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 689. [2019-09-08 06:42:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-09-08 06:42:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 956 transitions. [2019-09-08 06:42:58,376 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 956 transitions. Word has length 176 [2019-09-08 06:42:58,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,376 INFO L475 AbstractCegarLoop]: Abstraction has 689 states and 956 transitions. [2019-09-08 06:42:58,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:58,376 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 956 transitions. [2019-09-08 06:42:58,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:58,378 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,378 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:58,378 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,378 INFO L82 PathProgramCache]: Analyzing trace with hash -6264817, now seen corresponding path program 1 times [2019-09-08 06:42:58,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,499 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:42:58,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:58,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:58,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:58,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:58,500 INFO L87 Difference]: Start difference. First operand 689 states and 956 transitions. Second operand 6 states. [2019-09-08 06:42:58,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:58,627 INFO L93 Difference]: Finished difference Result 1395 states and 1989 transitions. [2019-09-08 06:42:58,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:58,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:42:58,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:58,632 INFO L225 Difference]: With dead ends: 1395 [2019-09-08 06:42:58,632 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 06:42:58,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 06:42:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 699. [2019-09-08 06:42:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-09-08 06:42:58,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 966 transitions. [2019-09-08 06:42:58,707 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 966 transitions. Word has length 176 [2019-09-08 06:42:58,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:58,708 INFO L475 AbstractCegarLoop]: Abstraction has 699 states and 966 transitions. [2019-09-08 06:42:58,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 966 transitions. [2019-09-08 06:42:58,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:58,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:58,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:58,710 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:58,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:58,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1946846831, now seen corresponding path program 1 times [2019-09-08 06:42:58,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:58,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:58,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:58,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:58,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:58,820 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:42:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:42:58,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:42:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:42:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:58,822 INFO L87 Difference]: Start difference. First operand 699 states and 966 transitions. Second operand 4 states. [2019-09-08 06:42:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:59,284 INFO L93 Difference]: Finished difference Result 2030 states and 2898 transitions. [2019-09-08 06:42:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:42:59,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 06:42:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:59,292 INFO L225 Difference]: With dead ends: 2030 [2019-09-08 06:42:59,293 INFO L226 Difference]: Without dead ends: 1358 [2019-09-08 06:42:59,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:42:59,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-09-08 06:42:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1350. [2019-09-08 06:42:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-09-08 06:42:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1864 transitions. [2019-09-08 06:42:59,441 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1864 transitions. Word has length 176 [2019-09-08 06:42:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:59,441 INFO L475 AbstractCegarLoop]: Abstraction has 1350 states and 1864 transitions. [2019-09-08 06:42:59,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:42:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1864 transitions. [2019-09-08 06:42:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:59,443 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:59,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:59,444 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:59,444 INFO L82 PathProgramCache]: Analyzing trace with hash -744652496, now seen corresponding path program 1 times [2019-09-08 06:42:59,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:59,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:59,516 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:42:59,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:59,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:59,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:59,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:59,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:59,518 INFO L87 Difference]: Start difference. First operand 1350 states and 1864 transitions. Second operand 6 states. [2019-09-08 06:42:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:42:59,668 INFO L93 Difference]: Finished difference Result 2711 states and 3836 transitions. [2019-09-08 06:42:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:42:59,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:42:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:42:59,677 INFO L225 Difference]: With dead ends: 2711 [2019-09-08 06:42:59,677 INFO L226 Difference]: Without dead ends: 1388 [2019-09-08 06:42:59,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:42:59,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2019-09-08 06:42:59,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1360. [2019-09-08 06:42:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-09-08 06:42:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1872 transitions. [2019-09-08 06:42:59,843 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1872 transitions. Word has length 176 [2019-09-08 06:42:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:42:59,844 INFO L475 AbstractCegarLoop]: Abstraction has 1360 states and 1872 transitions. [2019-09-08 06:42:59,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:42:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1872 transitions. [2019-09-08 06:42:59,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:42:59,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:42:59,845 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:42:59,846 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:42:59,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:42:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash 822105454, now seen corresponding path program 1 times [2019-09-08 06:42:59,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:42:59,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:42:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:42:59,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:42:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:42:59,952 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:42:59,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:42:59,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:42:59,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:42:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:42:59,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:42:59,954 INFO L87 Difference]: Start difference. First operand 1360 states and 1872 transitions. Second operand 6 states. [2019-09-08 06:43:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:00,157 INFO L93 Difference]: Finished difference Result 2757 states and 3893 transitions. [2019-09-08 06:43:00,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:00,157 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:43:00,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:00,166 INFO L225 Difference]: With dead ends: 2757 [2019-09-08 06:43:00,166 INFO L226 Difference]: Without dead ends: 1424 [2019-09-08 06:43:00,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:00,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2019-09-08 06:43:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1380. [2019-09-08 06:43:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2019-09-08 06:43:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 1892 transitions. [2019-09-08 06:43:00,363 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 1892 transitions. Word has length 176 [2019-09-08 06:43:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:00,363 INFO L475 AbstractCegarLoop]: Abstraction has 1380 states and 1892 transitions. [2019-09-08 06:43:00,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 1892 transitions. [2019-09-08 06:43:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:00,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:00,365 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:00,365 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1088937104, now seen corresponding path program 1 times [2019-09-08 06:43:00,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:00,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:00,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:00,444 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:43:00,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:00,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:00,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:00,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:00,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:00,446 INFO L87 Difference]: Start difference. First operand 1380 states and 1892 transitions. Second operand 6 states. [2019-09-08 06:43:00,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:00,593 INFO L93 Difference]: Finished difference Result 2785 states and 3913 transitions. [2019-09-08 06:43:00,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:00,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:43:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:00,601 INFO L225 Difference]: With dead ends: 2785 [2019-09-08 06:43:00,601 INFO L226 Difference]: Without dead ends: 1432 [2019-09-08 06:43:00,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:00,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2019-09-08 06:43:00,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1400. [2019-09-08 06:43:00,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1400 states. [2019-09-08 06:43:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1912 transitions. [2019-09-08 06:43:00,751 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1912 transitions. Word has length 176 [2019-09-08 06:43:00,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:00,753 INFO L475 AbstractCegarLoop]: Abstraction has 1400 states and 1912 transitions. [2019-09-08 06:43:00,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1912 transitions. [2019-09-08 06:43:00,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:00,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:00,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:00,755 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1143330002, now seen corresponding path program 1 times [2019-09-08 06:43:00,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:00,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:00,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:00,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:00,843 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:43:00,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:00,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:00,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:00,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:00,845 INFO L87 Difference]: Start difference. First operand 1400 states and 1912 transitions. Second operand 4 states. [2019-09-08 06:43:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:01,365 INFO L93 Difference]: Finished difference Result 4121 states and 5814 transitions. [2019-09-08 06:43:01,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:01,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 06:43:01,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:01,380 INFO L225 Difference]: With dead ends: 4121 [2019-09-08 06:43:01,380 INFO L226 Difference]: Without dead ends: 2748 [2019-09-08 06:43:01,387 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2748 states. [2019-09-08 06:43:01,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2748 to 2736. [2019-09-08 06:43:01,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2736 states. [2019-09-08 06:43:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3734 transitions. [2019-09-08 06:43:01,759 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3734 transitions. Word has length 176 [2019-09-08 06:43:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:01,759 INFO L475 AbstractCegarLoop]: Abstraction has 2736 states and 3734 transitions. [2019-09-08 06:43:01,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3734 transitions. [2019-09-08 06:43:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:01,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:01,761 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:01,761 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:01,761 INFO L82 PathProgramCache]: Analyzing trace with hash -114797841, now seen corresponding path program 1 times [2019-09-08 06:43:01,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:01,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:01,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:01,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:01,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:01,834 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:43:01,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:01,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:01,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:01,836 INFO L87 Difference]: Start difference. First operand 2736 states and 3734 transitions. Second operand 6 states. [2019-09-08 06:43:02,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:02,110 INFO L93 Difference]: Finished difference Result 5485 states and 7662 transitions. [2019-09-08 06:43:02,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:02,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:43:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:02,126 INFO L225 Difference]: With dead ends: 5485 [2019-09-08 06:43:02,127 INFO L226 Difference]: Without dead ends: 2776 [2019-09-08 06:43:02,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:02,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-09-08 06:43:02,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 2756. [2019-09-08 06:43:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2756 states. [2019-09-08 06:43:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3750 transitions. [2019-09-08 06:43:02,423 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3750 transitions. Word has length 176 [2019-09-08 06:43:02,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:02,424 INFO L475 AbstractCegarLoop]: Abstraction has 2756 states and 3750 transitions. [2019-09-08 06:43:02,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:02,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3750 transitions. [2019-09-08 06:43:02,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:02,426 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:02,426 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:02,426 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:02,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1271987569, now seen corresponding path program 1 times [2019-09-08 06:43:02,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:02,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:02,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:02,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:02,506 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:43:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:43:02,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:43:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:43:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:02,507 INFO L87 Difference]: Start difference. First operand 2756 states and 3750 transitions. Second operand 4 states. [2019-09-08 06:43:03,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:03,342 INFO L93 Difference]: Finished difference Result 8165 states and 11494 transitions. [2019-09-08 06:43:03,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:43:03,343 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2019-09-08 06:43:03,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:03,379 INFO L225 Difference]: With dead ends: 8165 [2019-09-08 06:43:03,379 INFO L226 Difference]: Without dead ends: 5436 [2019-09-08 06:43:03,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:43:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5436 states. [2019-09-08 06:43:03,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5436 to 5416. [2019-09-08 06:43:03,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5416 states. [2019-09-08 06:43:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5416 states to 5416 states and 7372 transitions. [2019-09-08 06:43:03,966 INFO L78 Accepts]: Start accepts. Automaton has 5416 states and 7372 transitions. Word has length 176 [2019-09-08 06:43:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:03,967 INFO L475 AbstractCegarLoop]: Abstraction has 5416 states and 7372 transitions. [2019-09-08 06:43:03,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:43:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 5416 states and 7372 transitions. [2019-09-08 06:43:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:03,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:03,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] [2019-09-08 06:43:03,970 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 570419344, now seen corresponding path program 1 times [2019-09-08 06:43:03,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:04,117 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:43:04,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:04,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:43:04,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:43:04,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:43:04,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:04,119 INFO L87 Difference]: Start difference. First operand 5416 states and 7372 transitions. Second operand 6 states. [2019-09-08 06:43:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:04,622 INFO L93 Difference]: Finished difference Result 10861 states and 15140 transitions. [2019-09-08 06:43:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:04,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 176 [2019-09-08 06:43:04,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:04,650 INFO L225 Difference]: With dead ends: 10861 [2019-09-08 06:43:04,651 INFO L226 Difference]: Without dead ends: 5472 [2019-09-08 06:43:04,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:04,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5472 states. [2019-09-08 06:43:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5472 to 5456. [2019-09-08 06:43:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5456 states. [2019-09-08 06:43:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5456 states to 5456 states and 7404 transitions. [2019-09-08 06:43:05,215 INFO L78 Accepts]: Start accepts. Automaton has 5456 states and 7404 transitions. Word has length 176 [2019-09-08 06:43:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:05,216 INFO L475 AbstractCegarLoop]: Abstraction has 5456 states and 7404 transitions. [2019-09-08 06:43:05,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:43:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 5456 states and 7404 transitions. [2019-09-08 06:43:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:05,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:05,219 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:05,219 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1796275250, now seen corresponding path program 1 times [2019-09-08 06:43:05,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:05,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:05,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:05,413 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:43:05,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:05,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:05,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:05,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:05,416 INFO L87 Difference]: Start difference. First operand 5456 states and 7404 transitions. Second operand 5 states. [2019-09-08 06:43:06,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:06,698 INFO L93 Difference]: Finished difference Result 13460 states and 18146 transitions. [2019-09-08 06:43:06,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:06,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:06,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:06,729 INFO L225 Difference]: With dead ends: 13460 [2019-09-08 06:43:06,729 INFO L226 Difference]: Without dead ends: 8032 [2019-09-08 06:43:06,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:06,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8032 states. [2019-09-08 06:43:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8032 to 7472. [2019-09-08 06:43:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-08 06:43:07,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9692 transitions. [2019-09-08 06:43:07,372 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9692 transitions. Word has length 176 [2019-09-08 06:43:07,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:07,373 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9692 transitions. [2019-09-08 06:43:07,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:07,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9692 transitions. [2019-09-08 06:43:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:07,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:07,375 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:07,375 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:07,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:07,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1548128756, now seen corresponding path program 1 times [2019-09-08 06:43:07,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:07,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:07,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:07,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:07,469 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:43:07,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:07,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:07,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:07,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:07,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:07,471 INFO L87 Difference]: Start difference. First operand 7472 states and 9692 transitions. Second operand 5 states. [2019-09-08 06:43:08,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:08,982 INFO L93 Difference]: Finished difference Result 14916 states and 19377 transitions. [2019-09-08 06:43:08,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:08,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:09,006 INFO L225 Difference]: With dead ends: 14916 [2019-09-08 06:43:09,006 INFO L226 Difference]: Without dead ends: 7472 [2019-09-08 06:43:09,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:09,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-09-08 06:43:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-09-08 06:43:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-08 06:43:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9660 transitions. [2019-09-08 06:43:09,480 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9660 transitions. Word has length 176 [2019-09-08 06:43:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:09,481 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9660 transitions. [2019-09-08 06:43:09,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9660 transitions. [2019-09-08 06:43:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:09,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:09,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:09,483 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:09,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1124482034, now seen corresponding path program 1 times [2019-09-08 06:43:09,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:09,573 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:43:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:09,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:09,575 INFO L87 Difference]: Start difference. First operand 7472 states and 9660 transitions. Second operand 5 states. [2019-09-08 06:43:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:11,349 INFO L93 Difference]: Finished difference Result 14916 states and 19313 transitions. [2019-09-08 06:43:11,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:11,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:11,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:11,396 INFO L225 Difference]: With dead ends: 14916 [2019-09-08 06:43:11,396 INFO L226 Difference]: Without dead ends: 7472 [2019-09-08 06:43:11,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7472 states. [2019-09-08 06:43:12,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7472 to 7472. [2019-09-08 06:43:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7472 states. [2019-09-08 06:43:12,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7472 states to 7472 states and 9628 transitions. [2019-09-08 06:43:12,483 INFO L78 Accepts]: Start accepts. Automaton has 7472 states and 9628 transitions. Word has length 176 [2019-09-08 06:43:12,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:12,483 INFO L475 AbstractCegarLoop]: Abstraction has 7472 states and 9628 transitions. [2019-09-08 06:43:12,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 7472 states and 9628 transitions. [2019-09-08 06:43:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:12,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:12,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:12,487 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:12,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1798677964, now seen corresponding path program 1 times [2019-09-08 06:43:12,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:12,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:12,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:12,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:12,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:12,623 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:43:12,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:12,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:12,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:12,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:12,626 INFO L87 Difference]: Start difference. First operand 7472 states and 9628 transitions. Second operand 5 states. [2019-09-08 06:43:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:14,567 INFO L93 Difference]: Finished difference Result 17830 states and 23032 transitions. [2019-09-08 06:43:14,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:14,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:14,602 INFO L225 Difference]: With dead ends: 17830 [2019-09-08 06:43:14,603 INFO L226 Difference]: Without dead ends: 10386 [2019-09-08 06:43:14,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:14,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10386 states. [2019-09-08 06:43:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10386 to 10098. [2019-09-08 06:43:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-08 06:43:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12802 transitions. [2019-09-08 06:43:15,634 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12802 transitions. Word has length 176 [2019-09-08 06:43:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:15,634 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12802 transitions. [2019-09-08 06:43:15,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12802 transitions. [2019-09-08 06:43:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:15,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:15,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:15,636 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:15,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:15,637 INFO L82 PathProgramCache]: Analyzing trace with hash -46689202, now seen corresponding path program 1 times [2019-09-08 06:43:15,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:15,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:15,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:15,718 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:43:15,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:15,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:15,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:15,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:15,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:15,720 INFO L87 Difference]: Start difference. First operand 10098 states and 12802 transitions. Second operand 5 states. [2019-09-08 06:43:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:16,850 INFO L93 Difference]: Finished difference Result 20166 states and 25625 transitions. [2019-09-08 06:43:16,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:16,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:16,877 INFO L225 Difference]: With dead ends: 20166 [2019-09-08 06:43:16,878 INFO L226 Difference]: Without dead ends: 10098 [2019-09-08 06:43:16,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-08 06:43:17,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-08 06:43:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-08 06:43:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12754 transitions. [2019-09-08 06:43:18,005 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12754 transitions. Word has length 176 [2019-09-08 06:43:18,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:18,005 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12754 transitions. [2019-09-08 06:43:18,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12754 transitions. [2019-09-08 06:43:18,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:18,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:18,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:18,007 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:18,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:18,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1076048500, now seen corresponding path program 1 times [2019-09-08 06:43:18,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:18,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:18,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:18,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:18,089 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:43:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:18,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:18,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:18,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:18,090 INFO L87 Difference]: Start difference. First operand 10098 states and 12754 transitions. Second operand 5 states. [2019-09-08 06:43:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:19,315 INFO L93 Difference]: Finished difference Result 20166 states and 25529 transitions. [2019-09-08 06:43:19,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:19,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:19,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:19,354 INFO L225 Difference]: With dead ends: 20166 [2019-09-08 06:43:19,354 INFO L226 Difference]: Without dead ends: 10098 [2019-09-08 06:43:19,374 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-08 06:43:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-08 06:43:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-08 06:43:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12706 transitions. [2019-09-08 06:43:20,228 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12706 transitions. Word has length 176 [2019-09-08 06:43:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:20,229 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12706 transitions. [2019-09-08 06:43:20,229 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12706 transitions. [2019-09-08 06:43:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:20,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:20,230 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:20,230 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:20,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:20,230 INFO L82 PathProgramCache]: Analyzing trace with hash -416516978, now seen corresponding path program 1 times [2019-09-08 06:43:20,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:20,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:20,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:20,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:20,317 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:43:20,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:20,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:20,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:20,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:20,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:20,318 INFO L87 Difference]: Start difference. First operand 10098 states and 12706 transitions. Second operand 5 states. [2019-09-08 06:43:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:22,053 INFO L93 Difference]: Finished difference Result 20166 states and 25433 transitions. [2019-09-08 06:43:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:22,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:22,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:22,085 INFO L225 Difference]: With dead ends: 20166 [2019-09-08 06:43:22,086 INFO L226 Difference]: Without dead ends: 10098 [2019-09-08 06:43:22,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-08 06:43:22,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-08 06:43:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-08 06:43:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12658 transitions. [2019-09-08 06:43:22,773 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12658 transitions. Word has length 176 [2019-09-08 06:43:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:22,773 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12658 transitions. [2019-09-08 06:43:22,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12658 transitions. [2019-09-08 06:43:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:22,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:22,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:22,775 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -810883764, now seen corresponding path program 1 times [2019-09-08 06:43:22,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:22,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:22,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:22,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:22,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:22,861 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:43:22,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:22,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:22,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:22,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:22,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:22,863 INFO L87 Difference]: Start difference. First operand 10098 states and 12658 transitions. Second operand 5 states. [2019-09-08 06:43:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:24,105 INFO L93 Difference]: Finished difference Result 20166 states and 25337 transitions. [2019-09-08 06:43:24,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:24,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:24,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:24,235 INFO L225 Difference]: With dead ends: 20166 [2019-09-08 06:43:24,235 INFO L226 Difference]: Without dead ends: 10098 [2019-09-08 06:43:24,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:43:24,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10098 states. [2019-09-08 06:43:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10098 to 10098. [2019-09-08 06:43:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10098 states. [2019-09-08 06:43:24,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10098 states to 10098 states and 12610 transitions. [2019-09-08 06:43:24,854 INFO L78 Accepts]: Start accepts. Automaton has 10098 states and 12610 transitions. Word has length 176 [2019-09-08 06:43:24,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:24,855 INFO L475 AbstractCegarLoop]: Abstraction has 10098 states and 12610 transitions. [2019-09-08 06:43:24,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:24,855 INFO L276 IsEmpty]: Start isEmpty. Operand 10098 states and 12610 transitions. [2019-09-08 06:43:24,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:24,856 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:24,856 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:24,857 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:24,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:24,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1240100234, now seen corresponding path program 1 times [2019-09-08 06:43:24,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:24,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:24,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:24,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:24,930 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:43:24,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:24,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:24,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:24,931 INFO L87 Difference]: Start difference. First operand 10098 states and 12610 transitions. Second operand 5 states. [2019-09-08 06:43:26,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:26,786 INFO L93 Difference]: Finished difference Result 22368 states and 28684 transitions. [2019-09-08 06:43:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:26,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:26,824 INFO L225 Difference]: With dead ends: 22368 [2019-09-08 06:43:26,824 INFO L226 Difference]: Without dead ends: 12298 [2019-09-08 06:43:26,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12298 states. [2019-09-08 06:43:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12298 to 10946. [2019-09-08 06:43:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10946 states. [2019-09-08 06:43:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10946 states to 10946 states and 13482 transitions. [2019-09-08 06:43:27,563 INFO L78 Accepts]: Start accepts. Automaton has 10946 states and 13482 transitions. Word has length 176 [2019-09-08 06:43:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:27,563 INFO L475 AbstractCegarLoop]: Abstraction has 10946 states and 13482 transitions. [2019-09-08 06:43:27,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:27,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10946 states and 13482 transitions. [2019-09-08 06:43:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:27,564 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:27,565 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:27,565 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:27,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1167713676, now seen corresponding path program 1 times [2019-09-08 06:43:27,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:27,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:27,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:27,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:27,652 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:43:27,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:27,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:27,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:27,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:27,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:27,654 INFO L87 Difference]: Start difference. First operand 10946 states and 13482 transitions. Second operand 5 states. [2019-09-08 06:43:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:29,551 INFO L93 Difference]: Finished difference Result 24514 states and 31228 transitions. [2019-09-08 06:43:29,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:29,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:29,592 INFO L225 Difference]: With dead ends: 24514 [2019-09-08 06:43:29,592 INFO L226 Difference]: Without dead ends: 13598 [2019-09-08 06:43:29,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13598 states. [2019-09-08 06:43:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13598 to 12742. [2019-09-08 06:43:30,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12742 states. [2019-09-08 06:43:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12742 states to 12742 states and 15454 transitions. [2019-09-08 06:43:30,554 INFO L78 Accepts]: Start accepts. Automaton has 12742 states and 15454 transitions. Word has length 176 [2019-09-08 06:43:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:30,554 INFO L475 AbstractCegarLoop]: Abstraction has 12742 states and 15454 transitions. [2019-09-08 06:43:30,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 12742 states and 15454 transitions. [2019-09-08 06:43:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:30,555 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:30,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:30,556 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:30,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1442473290, now seen corresponding path program 1 times [2019-09-08 06:43:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:30,645 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:43:30,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:30,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:30,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:30,647 INFO L87 Difference]: Start difference. First operand 12742 states and 15454 transitions. Second operand 5 states. [2019-09-08 06:43:33,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:33,012 INFO L93 Difference]: Finished difference Result 33174 states and 41309 transitions. [2019-09-08 06:43:33,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:43:33,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:33,053 INFO L225 Difference]: With dead ends: 33174 [2019-09-08 06:43:33,053 INFO L226 Difference]: Without dead ends: 20460 [2019-09-08 06:43:33,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:43:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20460 states. [2019-09-08 06:43:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20460 to 17194. [2019-09-08 06:43:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17194 states. [2019-09-08 06:43:34,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17194 states to 17194 states and 20646 transitions. [2019-09-08 06:43:34,469 INFO L78 Accepts]: Start accepts. Automaton has 17194 states and 20646 transitions. Word has length 176 [2019-09-08 06:43:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:34,469 INFO L475 AbstractCegarLoop]: Abstraction has 17194 states and 20646 transitions. [2019-09-08 06:43:34,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:34,469 INFO L276 IsEmpty]: Start isEmpty. Operand 17194 states and 20646 transitions. [2019-09-08 06:43:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 06:43:34,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:34,471 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:34,471 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -773030042, now seen corresponding path program 1 times [2019-09-08 06:43:34,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:34,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:34,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:34,544 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:43:34,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:34,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:34,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:34,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:34,545 INFO L87 Difference]: Start difference. First operand 17194 states and 20646 transitions. Second operand 5 states. [2019-09-08 06:43:36,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:36,064 INFO L93 Difference]: Finished difference Result 30980 states and 37567 transitions. [2019-09-08 06:43:36,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:43:36,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-09-08 06:43:36,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:36,105 INFO L225 Difference]: With dead ends: 30980 [2019-09-08 06:43:36,105 INFO L226 Difference]: Without dead ends: 13814 [2019-09-08 06:43:36,126 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:43:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2019-09-08 06:43:37,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 13390. [2019-09-08 06:43:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13390 states. [2019-09-08 06:43:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13390 states to 13390 states and 16014 transitions. [2019-09-08 06:43:37,876 INFO L78 Accepts]: Start accepts. Automaton has 13390 states and 16014 transitions. Word has length 177 [2019-09-08 06:43:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:37,876 INFO L475 AbstractCegarLoop]: Abstraction has 13390 states and 16014 transitions. [2019-09-08 06:43:37,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 13390 states and 16014 transitions. [2019-09-08 06:43:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:37,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:37,877 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:37,877 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:37,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2144073164, now seen corresponding path program 1 times [2019-09-08 06:43:37,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:37,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:37,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:37,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:37,952 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:43:37,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:37,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:37,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:37,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:37,954 INFO L87 Difference]: Start difference. First operand 13390 states and 16014 transitions. Second operand 5 states. [2019-09-08 06:43:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:39,918 INFO L93 Difference]: Finished difference Result 30264 states and 37605 transitions. [2019-09-08 06:43:39,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:39,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:39,956 INFO L225 Difference]: With dead ends: 30264 [2019-09-08 06:43:39,957 INFO L226 Difference]: Without dead ends: 16902 [2019-09-08 06:43:39,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-09-08 06:43:41,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14854. [2019-09-08 06:43:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14854 states. [2019-09-08 06:43:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14854 states to 14854 states and 17526 transitions. [2019-09-08 06:43:41,224 INFO L78 Accepts]: Start accepts. Automaton has 14854 states and 17526 transitions. Word has length 176 [2019-09-08 06:43:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:41,224 INFO L475 AbstractCegarLoop]: Abstraction has 14854 states and 17526 transitions. [2019-09-08 06:43:41,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14854 states and 17526 transitions. [2019-09-08 06:43:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:41,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:41,225 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:41,226 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash -2128261878, now seen corresponding path program 1 times [2019-09-08 06:43:41,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:41,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:41,297 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:43:41,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:41,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:41,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:41,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:41,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:41,298 INFO L87 Difference]: Start difference. First operand 14854 states and 17526 transitions. Second operand 5 states. [2019-09-08 06:43:43,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:43,402 INFO L93 Difference]: Finished difference Result 32094 states and 39068 transitions. [2019-09-08 06:43:43,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:43,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:43,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:43,448 INFO L225 Difference]: With dead ends: 32094 [2019-09-08 06:43:43,449 INFO L226 Difference]: Without dead ends: 17270 [2019-09-08 06:43:43,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17270 states. [2019-09-08 06:43:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17270 to 16350. [2019-09-08 06:43:44,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16350 states. [2019-09-08 06:43:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16350 states to 16350 states and 19078 transitions. [2019-09-08 06:43:44,756 INFO L78 Accepts]: Start accepts. Automaton has 16350 states and 19078 transitions. Word has length 176 [2019-09-08 06:43:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:44,756 INFO L475 AbstractCegarLoop]: Abstraction has 16350 states and 19078 transitions. [2019-09-08 06:43:44,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:44,757 INFO L276 IsEmpty]: Start isEmpty. Operand 16350 states and 19078 transitions. [2019-09-08 06:43:44,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:44,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:44,758 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:44,758 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:44,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:44,759 INFO L82 PathProgramCache]: Analyzing trace with hash -742058484, now seen corresponding path program 1 times [2019-09-08 06:43:44,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:44,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:44,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:44,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:44,840 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:43:44,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:44,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:44,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:44,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:44,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:44,841 INFO L87 Difference]: Start difference. First operand 16350 states and 19078 transitions. Second operand 5 states. [2019-09-08 06:43:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:46,936 INFO L93 Difference]: Finished difference Result 33796 states and 40536 transitions. [2019-09-08 06:43:46,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:46,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:46,975 INFO L225 Difference]: With dead ends: 33796 [2019-09-08 06:43:46,976 INFO L226 Difference]: Without dead ends: 17474 [2019-09-08 06:43:46,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17474 states. [2019-09-08 06:43:48,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17474 to 16698. [2019-09-08 06:43:48,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16698 states. [2019-09-08 06:43:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16698 states to 16698 states and 19250 transitions. [2019-09-08 06:43:48,330 INFO L78 Accepts]: Start accepts. Automaton has 16698 states and 19250 transitions. Word has length 176 [2019-09-08 06:43:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:48,330 INFO L475 AbstractCegarLoop]: Abstraction has 16698 states and 19250 transitions. [2019-09-08 06:43:48,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 16698 states and 19250 transitions. [2019-09-08 06:43:48,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:48,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:48,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:48,332 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1251531574, now seen corresponding path program 1 times [2019-09-08 06:43:48,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:48,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:48,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:48,409 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:43:48,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:48,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:48,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:48,410 INFO L87 Difference]: Start difference. First operand 16698 states and 19250 transitions. Second operand 5 states. [2019-09-08 06:43:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:50,824 INFO L93 Difference]: Finished difference Result 35602 states and 42316 transitions. [2019-09-08 06:43:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:50,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:50,860 INFO L225 Difference]: With dead ends: 35602 [2019-09-08 06:43:50,860 INFO L226 Difference]: Without dead ends: 18934 [2019-09-08 06:43:50,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2019-09-08 06:43:52,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 18014. [2019-09-08 06:43:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18014 states. [2019-09-08 06:43:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18014 states to 18014 states and 20550 transitions. [2019-09-08 06:43:52,109 INFO L78 Accepts]: Start accepts. Automaton has 18014 states and 20550 transitions. Word has length 176 [2019-09-08 06:43:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:52,109 INFO L475 AbstractCegarLoop]: Abstraction has 18014 states and 20550 transitions. [2019-09-08 06:43:52,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 18014 states and 20550 transitions. [2019-09-08 06:43:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:52,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:52,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:52,111 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:52,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:52,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1189491960, now seen corresponding path program 1 times [2019-09-08 06:43:52,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:52,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:52,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:52,193 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:43:52,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:52,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:43:52,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:43:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:43:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:43:52,195 INFO L87 Difference]: Start difference. First operand 18014 states and 20550 transitions. Second operand 5 states. [2019-09-08 06:43:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:55,050 INFO L93 Difference]: Finished difference Result 36890 states and 42925 transitions. [2019-09-08 06:43:55,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:43:55,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-09-08 06:43:55,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:55,091 INFO L225 Difference]: With dead ends: 36890 [2019-09-08 06:43:55,091 INFO L226 Difference]: Without dead ends: 18906 [2019-09-08 06:43:55,111 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:43:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18906 states. [2019-09-08 06:43:56,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18906 to 18478. [2019-09-08 06:43:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18478 states. [2019-09-08 06:43:56,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18478 states to 18478 states and 20882 transitions. [2019-09-08 06:43:56,402 INFO L78 Accepts]: Start accepts. Automaton has 18478 states and 20882 transitions. Word has length 176 [2019-09-08 06:43:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:43:56,402 INFO L475 AbstractCegarLoop]: Abstraction has 18478 states and 20882 transitions. [2019-09-08 06:43:56,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:43:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18478 states and 20882 transitions. [2019-09-08 06:43:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 06:43:56,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:43:56,404 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:43:56,404 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:43:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:43:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1048943350, now seen corresponding path program 1 times [2019-09-08 06:43:56,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:43:56,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:43:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:56,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:43:56,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:43:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:43:56,478 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:43:56,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:43:56,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:43:56,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:43:56,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:43:56,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:43:56,480 INFO L87 Difference]: Start difference. First operand 18478 states and 20882 transitions. Second operand 3 states. [2019-09-08 06:43:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:43:59,109 INFO L93 Difference]: Finished difference Result 55012 states and 63722 transitions. [2019-09-08 06:43:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:43:59,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2019-09-08 06:43:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:43:59,237 INFO L225 Difference]: With dead ends: 55012 [2019-09-08 06:43:59,237 INFO L226 Difference]: Without dead ends: 36562 [2019-09-08 06:43:59,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:43:59,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36562 states. [2019-09-08 06:44:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36562 to 36546. [2019-09-08 06:44:03,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36546 states. [2019-09-08 06:44:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36546 states to 36546 states and 41853 transitions. [2019-09-08 06:44:03,328 INFO L78 Accepts]: Start accepts. Automaton has 36546 states and 41853 transitions. Word has length 176 [2019-09-08 06:44:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:03,329 INFO L475 AbstractCegarLoop]: Abstraction has 36546 states and 41853 transitions. [2019-09-08 06:44:03,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:44:03,329 INFO L276 IsEmpty]: Start isEmpty. Operand 36546 states and 41853 transitions. [2019-09-08 06:44:03,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-09-08 06:44:03,366 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:03,366 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:44:03,367 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:03,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:03,367 INFO L82 PathProgramCache]: Analyzing trace with hash -673960349, now seen corresponding path program 1 times [2019-09-08 06:44:03,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:03,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:03,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:03,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-09-08 06:44:03,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:03,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:03,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:03,460 INFO L87 Difference]: Start difference. First operand 36546 states and 41853 transitions. Second operand 4 states. [2019-09-08 06:44:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:08,515 INFO L93 Difference]: Finished difference Result 98321 states and 113113 transitions. [2019-09-08 06:44:08,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:44:08,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-09-08 06:44:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:08,627 INFO L225 Difference]: With dead ends: 98321 [2019-09-08 06:44:08,628 INFO L226 Difference]: Without dead ends: 45362 [2019-09-08 06:44:08,705 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:44:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45362 states. [2019-09-08 06:44:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45362 to 44430. [2019-09-08 06:44:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44430 states. [2019-09-08 06:44:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44430 states to 44430 states and 50326 transitions. [2019-09-08 06:44:12,153 INFO L78 Accepts]: Start accepts. Automaton has 44430 states and 50326 transitions. Word has length 291 [2019-09-08 06:44:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:12,154 INFO L475 AbstractCegarLoop]: Abstraction has 44430 states and 50326 transitions. [2019-09-08 06:44:12,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:44:12,154 INFO L276 IsEmpty]: Start isEmpty. Operand 44430 states and 50326 transitions. [2019-09-08 06:44:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:44:12,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:12,214 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:44:12,215 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:12,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:12,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2059391804, now seen corresponding path program 1 times [2019-09-08 06:44:12,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:12,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:12,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 29 proven. 8 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2019-09-08 06:44:12,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:12,337 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:12,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:12,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 2139 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:44:12,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:44:12,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:12,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:44:12,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:44:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:44:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:44:12,824 INFO L87 Difference]: Start difference. First operand 44430 states and 50326 transitions. Second operand 6 states. [2019-09-08 06:44:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:26,804 INFO L93 Difference]: Finished difference Result 169085 states and 196149 transitions. [2019-09-08 06:44:26,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:44:26,804 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 416 [2019-09-08 06:44:26,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:27,365 INFO L225 Difference]: With dead ends: 169085 [2019-09-08 06:44:27,366 INFO L226 Difference]: Without dead ends: 96779 [2019-09-08 06:44:27,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:44:27,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96779 states. [2019-09-08 06:44:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96779 to 96407. [2019-09-08 06:44:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96407 states. [2019-09-08 06:44:41,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96407 states to 96407 states and 110936 transitions. [2019-09-08 06:44:41,211 INFO L78 Accepts]: Start accepts. Automaton has 96407 states and 110936 transitions. Word has length 416 [2019-09-08 06:44:41,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:41,212 INFO L475 AbstractCegarLoop]: Abstraction has 96407 states and 110936 transitions. [2019-09-08 06:44:41,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:44:41,212 INFO L276 IsEmpty]: Start isEmpty. Operand 96407 states and 110936 transitions. [2019-09-08 06:44:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-09-08 06:44:41,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:41,586 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:41,587 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:41,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 238330725, now seen corresponding path program 1 times [2019-09-08 06:44:41,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:41,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1092 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked. [2019-09-08 06:44:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:44:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:44:41,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:44:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:44:41,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:44:41,888 INFO L87 Difference]: Start difference. First operand 96407 states and 110936 transitions. Second operand 4 states. [2019-09-08 06:44:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:44:49,915 INFO L93 Difference]: Finished difference Result 96411 states and 110939 transitions. [2019-09-08 06:44:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:44:49,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 714 [2019-09-08 06:44:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:44:50,166 INFO L225 Difference]: With dead ends: 96411 [2019-09-08 06:44:50,167 INFO L226 Difference]: Without dead ends: 71902 [2019-09-08 06:44:50,225 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:44:50,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71902 states. [2019-09-08 06:44:56,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71902 to 71902. [2019-09-08 06:44:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71902 states. [2019-09-08 06:44:57,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71902 states to 71902 states and 83237 transitions. [2019-09-08 06:44:57,031 INFO L78 Accepts]: Start accepts. Automaton has 71902 states and 83237 transitions. Word has length 714 [2019-09-08 06:44:57,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:44:57,031 INFO L475 AbstractCegarLoop]: Abstraction has 71902 states and 83237 transitions. [2019-09-08 06:44:57,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:44:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 71902 states and 83237 transitions. [2019-09-08 06:44:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 718 [2019-09-08 06:44:57,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:44:57,124 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:44:57,124 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:44:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:44:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1429440596, now seen corresponding path program 1 times [2019-09-08 06:44:57,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:44:57,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:44:57,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:57,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:57,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:44:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 25 proven. 18 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2019-09-08 06:44:57,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:44:57,559 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:44:57,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:44:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:44:58,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:44:58,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:44:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-09-08 06:44:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:44:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:44:58,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:44:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:44:58,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:44:58,324 INFO L87 Difference]: Start difference. First operand 71902 states and 83237 transitions. Second operand 3 states. [2019-09-08 06:45:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:06,673 INFO L93 Difference]: Finished difference Result 143640 states and 168288 transitions. [2019-09-08 06:45:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:45:06,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 717 [2019-09-08 06:45:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:06,915 INFO L225 Difference]: With dead ends: 143640 [2019-09-08 06:45:06,915 INFO L226 Difference]: Without dead ends: 71768 [2019-09-08 06:45:07,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:45:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71768 states. [2019-09-08 06:45:12,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71768 to 71768. [2019-09-08 06:45:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71768 states. [2019-09-08 06:45:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71768 states to 71768 states and 82917 transitions. [2019-09-08 06:45:13,086 INFO L78 Accepts]: Start accepts. Automaton has 71768 states and 82917 transitions. Word has length 717 [2019-09-08 06:45:13,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:13,086 INFO L475 AbstractCegarLoop]: Abstraction has 71768 states and 82917 transitions. [2019-09-08 06:45:13,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:45:13,086 INFO L276 IsEmpty]: Start isEmpty. Operand 71768 states and 82917 transitions. [2019-09-08 06:45:13,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-09-08 06:45:13,178 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:13,179 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,179 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:13,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:13,180 INFO L82 PathProgramCache]: Analyzing trace with hash 768787175, now seen corresponding path program 1 times [2019-09-08 06:45:13,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:13,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:13,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:13,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:13,782 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-09-08 06:45:13,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:45:13,783 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:45:13,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:14,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 2543 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:45:14,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:45:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 395 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:45:14,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:45:14,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:45:14,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:45:14,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:45:14,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:45:14,428 INFO L87 Difference]: Start difference. First operand 71768 states and 82917 transitions. Second operand 6 states. [2019-09-08 06:45:36,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:45:36,257 INFO L93 Difference]: Finished difference Result 283128 states and 347957 transitions. [2019-09-08 06:45:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:45:36,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 526 [2019-09-08 06:45:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:45:36,771 INFO L225 Difference]: With dead ends: 283128 [2019-09-08 06:45:36,771 INFO L226 Difference]: Without dead ends: 173348 [2019-09-08 06:45:36,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:45:37,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173348 states. [2019-09-08 06:45:58,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173348 to 173340. [2019-09-08 06:45:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173340 states. [2019-09-08 06:45:58,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173340 states to 173340 states and 215937 transitions. [2019-09-08 06:45:58,692 INFO L78 Accepts]: Start accepts. Automaton has 173340 states and 215937 transitions. Word has length 526 [2019-09-08 06:45:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:45:58,692 INFO L475 AbstractCegarLoop]: Abstraction has 173340 states and 215937 transitions. [2019-09-08 06:45:58,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:45:58,692 INFO L276 IsEmpty]: Start isEmpty. Operand 173340 states and 215937 transitions. [2019-09-08 06:45:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 820 [2019-09-08 06:45:58,901 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:45:58,902 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:58,902 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:45:58,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:45:58,902 INFO L82 PathProgramCache]: Analyzing trace with hash 931563270, now seen corresponding path program 1 times [2019-09-08 06:45:58,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:45:58,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:45:58,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:58,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:45:58,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:45:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:45:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2019-09-08 06:45:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:45:59,841 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:45:59,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:00,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 3511 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:46:00,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:00,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-09-08 06:46:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 06:46:00,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:46:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:46:00,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:46:00,807 INFO L87 Difference]: Start difference. First operand 173340 states and 215937 transitions. Second operand 9 states. [2019-09-08 06:46:18,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:46:18,842 INFO L93 Difference]: Finished difference Result 314855 states and 388942 transitions. [2019-09-08 06:46:18,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 06:46:18,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 819 [2019-09-08 06:46:18,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:46:19,240 INFO L225 Difference]: With dead ends: 314855 [2019-09-08 06:46:19,240 INFO L226 Difference]: Without dead ends: 141545 [2019-09-08 06:46:20,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:46:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141545 states. [2019-09-08 06:46:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141545 to 140087. [2019-09-08 06:46:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140087 states. [2019-09-08 06:46:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140087 states to 140087 states and 159465 transitions. [2019-09-08 06:46:39,025 INFO L78 Accepts]: Start accepts. Automaton has 140087 states and 159465 transitions. Word has length 819 [2019-09-08 06:46:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:46:39,026 INFO L475 AbstractCegarLoop]: Abstraction has 140087 states and 159465 transitions. [2019-09-08 06:46:39,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:46:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 140087 states and 159465 transitions. [2019-09-08 06:46:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2019-09-08 06:46:39,147 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:46:39,148 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:46:39,148 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:46:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:46:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1064048701, now seen corresponding path program 1 times [2019-09-08 06:46:39,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:46:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:46:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:46:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 2 proven. 56 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-08 06:46:39,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:46:39,774 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:46:39,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:46:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:46:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 2885 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:46:40,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:46:40,284 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-09-08 06:46:40,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:46:40,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:46:40,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:46:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:46:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:46:40,291 INFO L87 Difference]: Start difference. First operand 140087 states and 159465 transitions. Second operand 5 states. [2019-09-08 06:47:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:47:09,759 INFO L93 Difference]: Finished difference Result 403892 states and 465685 transitions. [2019-09-08 06:47:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:47:09,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 626 [2019-09-08 06:47:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:47:10,513 INFO L225 Difference]: With dead ends: 403892 [2019-09-08 06:47:10,514 INFO L226 Difference]: Without dead ends: 264004 [2019-09-08 06:47:10,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 630 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:47:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264004 states. [2019-09-08 06:47:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264004 to 260358. [2019-09-08 06:47:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260358 states. [2019-09-08 06:47:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260358 states to 260358 states and 298644 transitions. [2019-09-08 06:47:43,713 INFO L78 Accepts]: Start accepts. Automaton has 260358 states and 298644 transitions. Word has length 626 [2019-09-08 06:47:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:47:43,714 INFO L475 AbstractCegarLoop]: Abstraction has 260358 states and 298644 transitions. [2019-09-08 06:47:43,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:47:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand 260358 states and 298644 transitions. [2019-09-08 06:47:43,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-09-08 06:47:43,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:47:43,950 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:47:43,950 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:47:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:47:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 365416761, now seen corresponding path program 1 times [2019-09-08 06:47:43,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:47:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:47:43,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:43,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:47:43,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:47:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 34 proven. 12 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2019-09-08 06:47:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:47:44,278 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) [2019-09-08 06:47:44,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:47:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:47:44,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 2943 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:47:44,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:47:45,704 INFO L134 CoverageAnalysis]: Checked inductivity of 913 backedges. 549 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 06:47:45,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:47:45,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:47:45,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:47:45,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:47:45,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:47:45,715 INFO L87 Difference]: Start difference. First operand 260358 states and 298644 transitions. Second operand 6 states. [2019-09-08 06:48:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:48:23,671 INFO L93 Difference]: Finished difference Result 544251 states and 635509 transitions. [2019-09-08 06:48:23,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 06:48:23,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 633 [2019-09-08 06:48:23,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:48:24,436 INFO L225 Difference]: With dead ends: 544251 [2019-09-08 06:48:24,436 INFO L226 Difference]: Without dead ends: 259447 [2019-09-08 06:48:25,520 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 642 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:48:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259447 states. [2019-09-08 06:49:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259447 to 253725. [2019-09-08 06:49:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253725 states. [2019-09-08 06:49:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253725 states to 253725 states and 282898 transitions. [2019-09-08 06:49:02,504 INFO L78 Accepts]: Start accepts. Automaton has 253725 states and 282898 transitions. Word has length 633 [2019-09-08 06:49:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:49:02,504 INFO L475 AbstractCegarLoop]: Abstraction has 253725 states and 282898 transitions. [2019-09-08 06:49:02,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:49:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 253725 states and 282898 transitions. [2019-09-08 06:49:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2019-09-08 06:49:02,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:49:02,709 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:49:02,710 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:49:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:49:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash 2091976969, now seen corresponding path program 1 times [2019-09-08 06:49:02,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:49:02,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:49:02,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:02,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:02,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:49:02,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 22 proven. 111 refuted. 0 times theorem prover too weak. 1765 trivial. 0 not checked. [2019-09-08 06:49:03,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:49:03,800 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:49:03,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:49:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:49:04,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 3587 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:49:04,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:49:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1898 backedges. 783 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-09-08 06:49:04,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:49:04,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:49:04,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:49:04,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:49:04,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:49:04,547 INFO L87 Difference]: Start difference. First operand 253725 states and 282898 transitions. Second operand 6 states. [2019-09-08 06:49:44,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:49:44,979 INFO L93 Difference]: Finished difference Result 547724 states and 634336 transitions. [2019-09-08 06:49:44,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:49:44,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 838 [2019-09-08 06:49:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:49:45,728 INFO L225 Difference]: With dead ends: 547724 [2019-09-08 06:49:45,728 INFO L226 Difference]: Without dead ends: 294149 [2019-09-08 06:49:46,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 847 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:49:46,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294149 states. [2019-09-08 06:50:26,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294149 to 291523. [2019-09-08 06:50:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291523 states. [2019-09-08 06:50:26,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291523 states to 291523 states and 323825 transitions. [2019-09-08 06:50:26,855 INFO L78 Accepts]: Start accepts. Automaton has 291523 states and 323825 transitions. Word has length 838 [2019-09-08 06:50:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:50:26,856 INFO L475 AbstractCegarLoop]: Abstraction has 291523 states and 323825 transitions. [2019-09-08 06:50:26,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:50:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 291523 states and 323825 transitions. [2019-09-08 06:50:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-09-08 06:50:27,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:50:27,103 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:50:27,103 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:50:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:50:27,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1834174341, now seen corresponding path program 1 times [2019-09-08 06:50:27,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:50:27,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:50:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:27,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:27,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:50:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 36 proven. 17 refuted. 0 times theorem prover too weak. 1318 trivial. 0 not checked. [2019-09-08 06:50:28,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:50:28,177 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:50:28,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:50:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:50:28,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 3335 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:50:28,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:50:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1371 backedges. 747 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2019-09-08 06:50:28,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:50:28,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:50:28,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:50:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:50:28,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:50:28,827 INFO L87 Difference]: Start difference. First operand 291523 states and 323825 transitions. Second operand 6 states. [2019-09-08 06:51:26,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:26,315 INFO L93 Difference]: Finished difference Result 747942 states and 830849 transitions. [2019-09-08 06:51:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:51:26,316 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 748 [2019-09-08 06:51:26,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:27,430 INFO L225 Difference]: With dead ends: 747942 [2019-09-08 06:51:27,431 INFO L226 Difference]: Without dead ends: 421793 [2019-09-08 06:51:27,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 760 GetRequests, 754 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:51:28,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421793 states. [2019-09-08 06:52:32,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421793 to 418385. [2019-09-08 06:52:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418385 states. [2019-09-08 06:52:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418385 states to 418385 states and 463035 transitions. [2019-09-08 06:52:33,626 INFO L78 Accepts]: Start accepts. Automaton has 418385 states and 463035 transitions. Word has length 748 [2019-09-08 06:52:33,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:33,627 INFO L475 AbstractCegarLoop]: Abstraction has 418385 states and 463035 transitions. [2019-09-08 06:52:33,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:52:33,627 INFO L276 IsEmpty]: Start isEmpty. Operand 418385 states and 463035 transitions. [2019-09-08 06:52:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 863 [2019-09-08 06:52:34,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:34,934 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,934 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:34,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:34,934 INFO L82 PathProgramCache]: Analyzing trace with hash -321775483, now seen corresponding path program 1 times [2019-09-08 06:52:34,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:34,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 38 proven. 22 refuted. 0 times theorem prover too weak. 1857 trivial. 0 not checked. [2019-09-08 06:52:35,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:35,263 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:35,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:35,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 3737 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:52:35,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:36,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 923 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2019-09-08 06:52:36,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:36,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:52:36,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:52:36,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:52:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:52:36,506 INFO L87 Difference]: Start difference. First operand 418385 states and 463035 transitions. Second operand 6 states.