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/transmitter.09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:54:26,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:54:26,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:54:26,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:54:26,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:54:26,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:54:27,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:54:27,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:54:27,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:54:27,018 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:54:27,020 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:54:27,022 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:54:27,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:54:27,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:54:27,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:54:27,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:54:27,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:54:27,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:54:27,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:54:27,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:54:27,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:54:27,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:54:27,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:54:27,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:54:27,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:54:27,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:54:27,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:54:27,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:54:27,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:54:27,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:54:27,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:54:27,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:54:27,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:54:27,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:54:27,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:54:27,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:54:27,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:54:27,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:54:27,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:54:27,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:54:27,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:54:27,053 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:54:27,067 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:54:27,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:54:27,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:54:27,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:54:27,069 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:54:27,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:54:27,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:54:27,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:54:27,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:54:27,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:54:27,071 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:54:27,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:54:27,071 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:54:27,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:54:27,071 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:54:27,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:54:27,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:54:27,072 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:54:27,072 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:54:27,072 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:54:27,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:54:27,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:54:27,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:54:27,073 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:54:27,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:54:27,130 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:54:27,136 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:54:27,137 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:54:27,140 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:54:27,141 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.09.cil.c [2019-09-08 06:54:27,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b965a9efb/e3d3ab2fbfa94abbaa4b3395c9467478/FLAGf37685804 [2019-09-08 06:54:27,691 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:54:27,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.09.cil.c [2019-09-08 06:54:27,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b965a9efb/e3d3ab2fbfa94abbaa4b3395c9467478/FLAGf37685804 [2019-09-08 06:54:28,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b965a9efb/e3d3ab2fbfa94abbaa4b3395c9467478 [2019-09-08 06:54:28,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:54:28,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:54:28,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:54:28,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:54:28,081 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:54:28,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cbc9c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28, skipping insertion in model container [2019-09-08 06:54:28,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,092 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:54:28,143 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:54:28,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:54:28,579 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:54:28,685 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:54:28,716 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:54:28,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28 WrapperNode [2019-09-08 06:54:28,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:54:28,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:54:28,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:54:28,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:54:28,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (1/1) ... [2019-09-08 06:54:28,796 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:54:28,797 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:54:28,797 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:54:28,797 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:54:28,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (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:54:28,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:54:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:54:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:54:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:54:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:54:28,856 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:54:28,857 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:54:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:54:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:54:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:54:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:54:28,858 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:54:28,859 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:54:28,860 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:54:28,861 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:54:28,862 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:54:28,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:54:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:54:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:54:28,862 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:54:28,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:54:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:54:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:54:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:54:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:54:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:54:29,915 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:54:29,916 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-08 06:54:29,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:54:29 BoogieIcfgContainer [2019-09-08 06:54:29,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:54:29,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:54:29,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:54:29,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:54:29,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:54:28" (1/3) ... [2019-09-08 06:54:29,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559cbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:54:29, skipping insertion in model container [2019-09-08 06:54:29,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:54:28" (2/3) ... [2019-09-08 06:54:29,924 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@559cbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:54:29, skipping insertion in model container [2019-09-08 06:54:29,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:54:29" (3/3) ... [2019-09-08 06:54:29,926 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2019-09-08 06:54:29,937 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:54:29,953 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:54:29,969 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:54:30,004 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:54:30,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:54:30,005 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:54:30,005 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:54:30,006 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:54:30,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:54:30,006 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:54:30,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:54:30,006 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:54:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states. [2019-09-08 06:54:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:30,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:30,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:30,074 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1492387944, now seen corresponding path program 1 times [2019-09-08 06:54:30,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:30,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:30,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:30,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:30,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:30,562 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:54:30,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:30,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:30,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:30,591 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 4 states. [2019-09-08 06:54:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:31,004 INFO L93 Difference]: Finished difference Result 735 states and 1123 transitions. [2019-09-08 06:54:31,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:31,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-08 06:54:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:31,029 INFO L225 Difference]: With dead ends: 735 [2019-09-08 06:54:31,029 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 06:54:31,042 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:54:31,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 06:54:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2019-09-08 06:54:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 534 transitions. [2019-09-08 06:54:31,189 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 534 transitions. Word has length 195 [2019-09-08 06:54:31,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:31,191 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 534 transitions. [2019-09-08 06:54:31,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:31,192 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 534 transitions. [2019-09-08 06:54:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:31,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:31,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:31,200 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:31,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2019781994, now seen corresponding path program 1 times [2019-09-08 06:54:31,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:31,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:31,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:31,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:31,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:31,515 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:54:31,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:31,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:31,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:31,523 INFO L87 Difference]: Start difference. First operand 370 states and 534 transitions. Second operand 5 states. [2019-09-08 06:54:32,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:32,348 INFO L93 Difference]: Finished difference Result 769 states and 1136 transitions. [2019-09-08 06:54:32,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:32,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:32,353 INFO L225 Difference]: With dead ends: 769 [2019-09-08 06:54:32,354 INFO L226 Difference]: Without dead ends: 426 [2019-09-08 06:54:32,356 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:54:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-09-08 06:54:32,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 370. [2019-09-08 06:54:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:32,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 533 transitions. [2019-09-08 06:54:32,385 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 533 transitions. Word has length 195 [2019-09-08 06:54:32,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:32,386 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 533 transitions. [2019-09-08 06:54:32,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:32,386 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 533 transitions. [2019-09-08 06:54:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:32,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:32,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:32,391 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:32,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:32,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1511003180, now seen corresponding path program 1 times [2019-09-08 06:54:32,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:32,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:32,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:32,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:32,511 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:54:32,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:32,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:32,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:32,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:32,513 INFO L87 Difference]: Start difference. First operand 370 states and 533 transitions. Second operand 5 states. [2019-09-08 06:54:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:33,289 INFO L93 Difference]: Finished difference Result 767 states and 1131 transitions. [2019-09-08 06:54:33,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:33,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:33,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:33,295 INFO L225 Difference]: With dead ends: 767 [2019-09-08 06:54:33,295 INFO L226 Difference]: Without dead ends: 424 [2019-09-08 06:54:33,297 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:54:33,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-09-08 06:54:33,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 370. [2019-09-08 06:54:33,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 532 transitions. [2019-09-08 06:54:33,323 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 532 transitions. Word has length 195 [2019-09-08 06:54:33,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:33,323 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 532 transitions. [2019-09-08 06:54:33,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 532 transitions. [2019-09-08 06:54:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:33,327 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:33,327 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:33,327 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:33,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1059355794, now seen corresponding path program 1 times [2019-09-08 06:54:33,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:33,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:33,450 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:54:33,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:33,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:33,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:33,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:33,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:33,453 INFO L87 Difference]: Start difference. First operand 370 states and 532 transitions. Second operand 5 states. [2019-09-08 06:54:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:34,269 INFO L93 Difference]: Finished difference Result 765 states and 1125 transitions. [2019-09-08 06:54:34,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:34,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:34,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:34,273 INFO L225 Difference]: With dead ends: 765 [2019-09-08 06:54:34,273 INFO L226 Difference]: Without dead ends: 422 [2019-09-08 06:54:34,275 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:54:34,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-09-08 06:54:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 370. [2019-09-08 06:54:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 531 transitions. [2019-09-08 06:54:34,299 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 531 transitions. Word has length 195 [2019-09-08 06:54:34,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:34,299 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 531 transitions. [2019-09-08 06:54:34,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 531 transitions. [2019-09-08 06:54:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:34,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:34,303 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:34,303 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:34,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:34,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1557912596, now seen corresponding path program 1 times [2019-09-08 06:54:34,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:34,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:34,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:34,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:34,399 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:54:34,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:34,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:34,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:34,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:34,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:34,401 INFO L87 Difference]: Start difference. First operand 370 states and 531 transitions. Second operand 5 states. [2019-09-08 06:54:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:35,105 INFO L93 Difference]: Finished difference Result 763 states and 1119 transitions. [2019-09-08 06:54:35,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:35,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:35,109 INFO L225 Difference]: With dead ends: 763 [2019-09-08 06:54:35,109 INFO L226 Difference]: Without dead ends: 420 [2019-09-08 06:54:35,111 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:54:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-09-08 06:54:35,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 370. [2019-09-08 06:54:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:35,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 530 transitions. [2019-09-08 06:54:35,137 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 530 transitions. Word has length 195 [2019-09-08 06:54:35,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:35,138 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 530 transitions. [2019-09-08 06:54:35,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:35,138 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 530 transitions. [2019-09-08 06:54:35,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:35,141 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:35,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:35,142 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:35,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2128184402, now seen corresponding path program 1 times [2019-09-08 06:54:35,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:35,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:35,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:35,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:35,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:35,249 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:54:35,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:35,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:35,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:35,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:35,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:35,251 INFO L87 Difference]: Start difference. First operand 370 states and 530 transitions. Second operand 5 states. [2019-09-08 06:54:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:35,992 INFO L93 Difference]: Finished difference Result 761 states and 1113 transitions. [2019-09-08 06:54:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:35,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:35,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:35,996 INFO L225 Difference]: With dead ends: 761 [2019-09-08 06:54:35,996 INFO L226 Difference]: Without dead ends: 418 [2019-09-08 06:54:35,998 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:54:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-09-08 06:54:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 370. [2019-09-08 06:54:36,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 529 transitions. [2019-09-08 06:54:36,024 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 529 transitions. Word has length 195 [2019-09-08 06:54:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:36,024 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 529 transitions. [2019-09-08 06:54:36,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 529 transitions. [2019-09-08 06:54:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:36,026 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:36,027 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:36,027 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -762913708, now seen corresponding path program 1 times [2019-09-08 06:54:36,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:36,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:36,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:36,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:36,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:54:36,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:36,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:36,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:36,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:36,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:36,125 INFO L87 Difference]: Start difference. First operand 370 states and 529 transitions. Second operand 5 states. [2019-09-08 06:54:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:36,855 INFO L93 Difference]: Finished difference Result 759 states and 1107 transitions. [2019-09-08 06:54:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:36,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:36,859 INFO L225 Difference]: With dead ends: 759 [2019-09-08 06:54:36,859 INFO L226 Difference]: Without dead ends: 416 [2019-09-08 06:54:36,861 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:54:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-09-08 06:54:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 370. [2019-09-08 06:54:36,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 528 transitions. [2019-09-08 06:54:36,889 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 528 transitions. Word has length 195 [2019-09-08 06:54:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:36,889 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 528 transitions. [2019-09-08 06:54:36,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 528 transitions. [2019-09-08 06:54:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:36,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:36,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:36,892 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:36,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1548911598, now seen corresponding path program 1 times [2019-09-08 06:54:36,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:36,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:37,018 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:54:37,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:37,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:37,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:37,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:37,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:37,020 INFO L87 Difference]: Start difference. First operand 370 states and 528 transitions. Second operand 5 states. [2019-09-08 06:54:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:37,702 INFO L93 Difference]: Finished difference Result 757 states and 1101 transitions. [2019-09-08 06:54:37,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:37,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:37,707 INFO L225 Difference]: With dead ends: 757 [2019-09-08 06:54:37,707 INFO L226 Difference]: Without dead ends: 414 [2019-09-08 06:54:37,709 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:54:37,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-09-08 06:54:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 370. [2019-09-08 06:54:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 527 transitions. [2019-09-08 06:54:37,745 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 527 transitions. Word has length 195 [2019-09-08 06:54:37,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:37,746 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 527 transitions. [2019-09-08 06:54:37,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:37,774 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 527 transitions. [2019-09-08 06:54:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:37,776 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:37,776 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:37,776 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:37,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash -881529708, now seen corresponding path program 1 times [2019-09-08 06:54:37,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:37,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:37,870 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:54:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:37,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:37,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:37,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:37,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:37,873 INFO L87 Difference]: Start difference. First operand 370 states and 527 transitions. Second operand 5 states. [2019-09-08 06:54:38,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:38,613 INFO L93 Difference]: Finished difference Result 755 states and 1095 transitions. [2019-09-08 06:54:38,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:38,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:38,618 INFO L225 Difference]: With dead ends: 755 [2019-09-08 06:54:38,618 INFO L226 Difference]: Without dead ends: 412 [2019-09-08 06:54:38,620 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:54:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2019-09-08 06:54:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 370. [2019-09-08 06:54:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:38,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 526 transitions. [2019-09-08 06:54:38,662 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 526 transitions. Word has length 195 [2019-09-08 06:54:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:38,663 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 526 transitions. [2019-09-08 06:54:38,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:38,663 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 526 transitions. [2019-09-08 06:54:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:38,666 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:38,666 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:38,667 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:38,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1218208722, now seen corresponding path program 1 times [2019-09-08 06:54:38,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:38,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:38,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:38,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:38,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:38,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:38,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:38,809 INFO L87 Difference]: Start difference. First operand 370 states and 526 transitions. Second operand 5 states. [2019-09-08 06:54:39,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:39,781 INFO L93 Difference]: Finished difference Result 791 states and 1159 transitions. [2019-09-08 06:54:39,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:39,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:39,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:39,786 INFO L225 Difference]: With dead ends: 791 [2019-09-08 06:54:39,787 INFO L226 Difference]: Without dead ends: 448 [2019-09-08 06:54:39,789 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:54:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-09-08 06:54:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 370. [2019-09-08 06:54:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 525 transitions. [2019-09-08 06:54:39,835 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 525 transitions. Word has length 195 [2019-09-08 06:54:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:39,836 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 525 transitions. [2019-09-08 06:54:39,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 525 transitions. [2019-09-08 06:54:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:39,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:39,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:39,840 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:39,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:39,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2095803760, now seen corresponding path program 1 times [2019-09-08 06:54:39,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:39,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:39,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:39,986 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:54:39,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:39,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:39,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:39,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:39,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:39,988 INFO L87 Difference]: Start difference. First operand 370 states and 525 transitions. Second operand 5 states. [2019-09-08 06:54:40,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:40,708 INFO L93 Difference]: Finished difference Result 789 states and 1153 transitions. [2019-09-08 06:54:40,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:40,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:40,712 INFO L225 Difference]: With dead ends: 789 [2019-09-08 06:54:40,712 INFO L226 Difference]: Without dead ends: 446 [2019-09-08 06:54:40,714 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:54:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-09-08 06:54:40,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 370. [2019-09-08 06:54:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 524 transitions. [2019-09-08 06:54:40,745 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 524 transitions. Word has length 195 [2019-09-08 06:54:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:40,745 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 524 transitions. [2019-09-08 06:54:40,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 524 transitions. [2019-09-08 06:54:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:40,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:40,748 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:40,748 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 429691922, now seen corresponding path program 1 times [2019-09-08 06:54:40,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:40,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:40,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:40,830 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:54:40,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:40,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:40,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:40,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:40,832 INFO L87 Difference]: Start difference. First operand 370 states and 524 transitions. Second operand 5 states. [2019-09-08 06:54:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:41,525 INFO L93 Difference]: Finished difference Result 787 states and 1147 transitions. [2019-09-08 06:54:41,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:41,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:41,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:41,529 INFO L225 Difference]: With dead ends: 787 [2019-09-08 06:54:41,529 INFO L226 Difference]: Without dead ends: 444 [2019-09-08 06:54:41,531 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:54:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-08 06:54:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 370. [2019-09-08 06:54:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 523 transitions. [2019-09-08 06:54:41,575 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 523 transitions. Word has length 195 [2019-09-08 06:54:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:41,575 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 523 transitions. [2019-09-08 06:54:41,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 523 transitions. [2019-09-08 06:54:41,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:41,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:41,580 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:41,580 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:41,581 INFO L82 PathProgramCache]: Analyzing trace with hash -181577136, now seen corresponding path program 1 times [2019-09-08 06:54:41,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:41,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:41,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:41,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:41,720 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:54:41,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:41,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:41,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:41,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:41,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:41,724 INFO L87 Difference]: Start difference. First operand 370 states and 523 transitions. Second operand 5 states. [2019-09-08 06:54:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:42,445 INFO L93 Difference]: Finished difference Result 785 states and 1141 transitions. [2019-09-08 06:54:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:42,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:42,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:42,450 INFO L225 Difference]: With dead ends: 785 [2019-09-08 06:54:42,450 INFO L226 Difference]: Without dead ends: 442 [2019-09-08 06:54:42,451 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:54:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-09-08 06:54:42,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 370. [2019-09-08 06:54:42,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:42,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 522 transitions. [2019-09-08 06:54:42,487 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 522 transitions. Word has length 195 [2019-09-08 06:54:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:42,487 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 522 transitions. [2019-09-08 06:54:42,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:42,488 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 522 transitions. [2019-09-08 06:54:42,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:42,490 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:42,490 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:42,491 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:42,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:42,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1586768814, now seen corresponding path program 1 times [2019-09-08 06:54:42,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:42,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:42,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:42,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:42,582 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:54:42,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:42,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:42,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:42,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:42,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:42,584 INFO L87 Difference]: Start difference. First operand 370 states and 522 transitions. Second operand 5 states. [2019-09-08 06:54:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:43,294 INFO L93 Difference]: Finished difference Result 783 states and 1135 transitions. [2019-09-08 06:54:43,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:43,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:43,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:43,298 INFO L225 Difference]: With dead ends: 783 [2019-09-08 06:54:43,298 INFO L226 Difference]: Without dead ends: 440 [2019-09-08 06:54:43,300 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:54:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-09-08 06:54:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 370. [2019-09-08 06:54:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 521 transitions. [2019-09-08 06:54:43,343 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 521 transitions. Word has length 195 [2019-09-08 06:54:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:43,344 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 521 transitions. [2019-09-08 06:54:43,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:43,344 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 521 transitions. [2019-09-08 06:54:43,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:43,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:43,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:43,347 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:43,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:43,347 INFO L82 PathProgramCache]: Analyzing trace with hash 307565072, now seen corresponding path program 1 times [2019-09-08 06:54:43,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:43,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:43,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:43,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:43,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:43,491 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:54:43,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:43,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:43,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:43,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:43,493 INFO L87 Difference]: Start difference. First operand 370 states and 521 transitions. Second operand 5 states. [2019-09-08 06:54:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:44,215 INFO L93 Difference]: Finished difference Result 781 states and 1129 transitions. [2019-09-08 06:54:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:44,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:44,219 INFO L225 Difference]: With dead ends: 781 [2019-09-08 06:54:44,219 INFO L226 Difference]: Without dead ends: 438 [2019-09-08 06:54:44,223 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:54:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-08 06:54:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 370. [2019-09-08 06:54:44,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:44,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 520 transitions. [2019-09-08 06:54:44,260 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 520 transitions. Word has length 195 [2019-09-08 06:54:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:44,260 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 520 transitions. [2019-09-08 06:54:44,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 520 transitions. [2019-09-08 06:54:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:44,262 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:44,262 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:44,263 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:44,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1754145938, now seen corresponding path program 1 times [2019-09-08 06:54:44,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:44,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:44,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:44,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:44,353 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:54:44,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:44,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:44,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:44,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:44,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:44,358 INFO L87 Difference]: Start difference. First operand 370 states and 520 transitions. Second operand 5 states. [2019-09-08 06:54:45,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:45,168 INFO L93 Difference]: Finished difference Result 779 states and 1123 transitions. [2019-09-08 06:54:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:45,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:45,172 INFO L225 Difference]: With dead ends: 779 [2019-09-08 06:54:45,172 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 06:54:45,174 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:54:45,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 06:54:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 370. [2019-09-08 06:54:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 519 transitions. [2019-09-08 06:54:45,213 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 519 transitions. Word has length 195 [2019-09-08 06:54:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:45,213 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 519 transitions. [2019-09-08 06:54:45,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 519 transitions. [2019-09-08 06:54:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:45,216 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:45,216 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:45,216 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:45,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:45,217 INFO L82 PathProgramCache]: Analyzing trace with hash 830978512, now seen corresponding path program 1 times [2019-09-08 06:54:45,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:45,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:45,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:45,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:45,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:45,312 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:54:45,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:45,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:45,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:45,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:45,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:45,314 INFO L87 Difference]: Start difference. First operand 370 states and 519 transitions. Second operand 5 states. [2019-09-08 06:54:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:45,994 INFO L93 Difference]: Finished difference Result 775 states and 1113 transitions. [2019-09-08 06:54:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:45,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:46,001 INFO L225 Difference]: With dead ends: 775 [2019-09-08 06:54:46,001 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 06:54:46,004 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:54:46,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 06:54:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 370. [2019-09-08 06:54:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-08 06:54:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 518 transitions. [2019-09-08 06:54:46,073 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 518 transitions. Word has length 195 [2019-09-08 06:54:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:46,073 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 518 transitions. [2019-09-08 06:54:46,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 518 transitions. [2019-09-08 06:54:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:46,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:46,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:46,077 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:46,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:46,078 INFO L82 PathProgramCache]: Analyzing trace with hash 566331022, now seen corresponding path program 1 times [2019-09-08 06:54:46,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:46,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:46,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:46,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:46,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:46,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:46,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:46,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:46,212 INFO L87 Difference]: Start difference. First operand 370 states and 518 transitions. Second operand 6 states. [2019-09-08 06:54:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:46,358 INFO L93 Difference]: Finished difference Result 746 states and 1075 transitions. [2019-09-08 06:54:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:46,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:46,363 INFO L225 Difference]: With dead ends: 746 [2019-09-08 06:54:46,363 INFO L226 Difference]: Without dead ends: 404 [2019-09-08 06:54:46,366 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:54:46,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-09-08 06:54:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 375. [2019-09-08 06:54:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-09-08 06:54:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 523 transitions. [2019-09-08 06:54:46,429 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 523 transitions. Word has length 195 [2019-09-08 06:54:46,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:46,430 INFO L475 AbstractCegarLoop]: Abstraction has 375 states and 523 transitions. [2019-09-08 06:54:46,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 523 transitions. [2019-09-08 06:54:46,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:46,431 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:46,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:46,432 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:46,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:46,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1965284624, now seen corresponding path program 1 times [2019-09-08 06:54:46,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:46,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:46,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:46,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:54:46,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:46,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:46,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:46,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:46,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:46,598 INFO L87 Difference]: Start difference. First operand 375 states and 523 transitions. Second operand 6 states. [2019-09-08 06:54:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:46,707 INFO L93 Difference]: Finished difference Result 753 states and 1080 transitions. [2019-09-08 06:54:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:46,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:46,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:46,711 INFO L225 Difference]: With dead ends: 753 [2019-09-08 06:54:46,712 INFO L226 Difference]: Without dead ends: 406 [2019-09-08 06:54:46,714 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:54:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-09-08 06:54:46,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 380. [2019-09-08 06:54:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-08 06:54:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 528 transitions. [2019-09-08 06:54:46,780 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 528 transitions. Word has length 195 [2019-09-08 06:54:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:46,780 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 528 transitions. [2019-09-08 06:54:46,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 528 transitions. [2019-09-08 06:54:46,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:46,783 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:46,784 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:46,784 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:46,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1535626318, now seen corresponding path program 1 times [2019-09-08 06:54:46,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:46,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:46,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:46,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:46,909 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:54:46,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:46,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:46,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:46,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:46,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:46,912 INFO L87 Difference]: Start difference. First operand 380 states and 528 transitions. Second operand 6 states. [2019-09-08 06:54:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:47,008 INFO L93 Difference]: Finished difference Result 760 states and 1085 transitions. [2019-09-08 06:54:47,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:47,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:47,011 INFO L225 Difference]: With dead ends: 760 [2019-09-08 06:54:47,011 INFO L226 Difference]: Without dead ends: 408 [2019-09-08 06:54:47,013 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:54:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2019-09-08 06:54:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 385. [2019-09-08 06:54:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2019-09-08 06:54:47,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 533 transitions. [2019-09-08 06:54:47,076 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 533 transitions. Word has length 195 [2019-09-08 06:54:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:47,077 INFO L475 AbstractCegarLoop]: Abstraction has 385 states and 533 transitions. [2019-09-08 06:54:47,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 533 transitions. [2019-09-08 06:54:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:47,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:47,080 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:47,080 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:47,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:47,081 INFO L82 PathProgramCache]: Analyzing trace with hash -186376368, now seen corresponding path program 1 times [2019-09-08 06:54:47,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:47,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:47,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:47,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:47,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:47,205 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:54:47,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:47,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:47,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:47,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:47,208 INFO L87 Difference]: Start difference. First operand 385 states and 533 transitions. Second operand 4 states. [2019-09-08 06:54:47,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:47,756 INFO L93 Difference]: Finished difference Result 1092 states and 1557 transitions. [2019-09-08 06:54:47,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:47,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-08 06:54:47,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:47,764 INFO L225 Difference]: With dead ends: 1092 [2019-09-08 06:54:47,764 INFO L226 Difference]: Without dead ends: 735 [2019-09-08 06:54:47,767 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:54:47,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-09-08 06:54:47,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 730. [2019-09-08 06:54:47,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2019-09-08 06:54:47,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1009 transitions. [2019-09-08 06:54:47,887 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1009 transitions. Word has length 195 [2019-09-08 06:54:47,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:47,888 INFO L475 AbstractCegarLoop]: Abstraction has 730 states and 1009 transitions. [2019-09-08 06:54:47,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1009 transitions. [2019-09-08 06:54:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:47,891 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:47,891 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:47,892 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:47,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1264242223, now seen corresponding path program 1 times [2019-09-08 06:54:47,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:47,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:47,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:47,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:47,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:48,011 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:54:48,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:48,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:48,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:48,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:48,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:48,014 INFO L87 Difference]: Start difference. First operand 730 states and 1009 transitions. Second operand 6 states. [2019-09-08 06:54:48,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:48,204 INFO L93 Difference]: Finished difference Result 1457 states and 2062 transitions. [2019-09-08 06:54:48,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:48,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:48,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:48,210 INFO L225 Difference]: With dead ends: 1457 [2019-09-08 06:54:48,210 INFO L226 Difference]: Without dead ends: 755 [2019-09-08 06:54:48,214 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:54:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-09-08 06:54:48,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 735. [2019-09-08 06:54:48,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-08 06:54:48,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1013 transitions. [2019-09-08 06:54:48,328 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1013 transitions. Word has length 195 [2019-09-08 06:54:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:48,329 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 1013 transitions. [2019-09-08 06:54:48,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1013 transitions. [2019-09-08 06:54:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:48,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:48,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:48,332 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash -708923155, now seen corresponding path program 1 times [2019-09-08 06:54:48,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:48,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:48,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:48,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:48,450 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:54:48,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:48,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:48,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:48,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:48,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:48,451 INFO L87 Difference]: Start difference. First operand 735 states and 1013 transitions. Second operand 6 states. [2019-09-08 06:54:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:48,612 INFO L93 Difference]: Finished difference Result 1486 states and 2101 transitions. [2019-09-08 06:54:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:48,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:48,620 INFO L225 Difference]: With dead ends: 1486 [2019-09-08 06:54:48,620 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 06:54:48,625 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:54:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 06:54:48,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 745. [2019-09-08 06:54:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-09-08 06:54:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1023 transitions. [2019-09-08 06:54:48,752 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1023 transitions. Word has length 195 [2019-09-08 06:54:48,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:48,753 INFO L475 AbstractCegarLoop]: Abstraction has 745 states and 1023 transitions. [2019-09-08 06:54:48,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:48,753 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1023 transitions. [2019-09-08 06:54:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:48,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:48,756 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:48,756 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:48,757 INFO L82 PathProgramCache]: Analyzing trace with hash 322117743, now seen corresponding path program 1 times [2019-09-08 06:54:48,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:48,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:48,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:48,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:48,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:48,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:48,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:48,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:48,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:48,906 INFO L87 Difference]: Start difference. First operand 745 states and 1023 transitions. Second operand 4 states. [2019-09-08 06:54:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:49,569 INFO L93 Difference]: Finished difference Result 2166 states and 3065 transitions. [2019-09-08 06:54:49,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:49,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-08 06:54:49,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:49,582 INFO L225 Difference]: With dead ends: 2166 [2019-09-08 06:54:49,583 INFO L226 Difference]: Without dead ends: 1449 [2019-09-08 06:54:49,594 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:54:49,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2019-09-08 06:54:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1442. [2019-09-08 06:54:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2019-09-08 06:54:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1977 transitions. [2019-09-08 06:54:49,888 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1977 transitions. Word has length 195 [2019-09-08 06:54:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:49,889 INFO L475 AbstractCegarLoop]: Abstraction has 1442 states and 1977 transitions. [2019-09-08 06:54:49,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1977 transitions. [2019-09-08 06:54:49,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:49,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:49,893 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:49,893 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:49,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 677714190, now seen corresponding path program 1 times [2019-09-08 06:54:49,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:49,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:50,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:50,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:50,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:50,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:50,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:50,032 INFO L87 Difference]: Start difference. First operand 1442 states and 1977 transitions. Second operand 6 states. [2019-09-08 06:54:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:50,217 INFO L93 Difference]: Finished difference Result 2894 states and 4060 transitions. [2019-09-08 06:54:50,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:50,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:50,226 INFO L225 Difference]: With dead ends: 2894 [2019-09-08 06:54:50,226 INFO L226 Difference]: Without dead ends: 1480 [2019-09-08 06:54:50,233 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:54:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2019-09-08 06:54:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1452. [2019-09-08 06:54:50,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1452 states. [2019-09-08 06:54:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1985 transitions. [2019-09-08 06:54:50,383 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1985 transitions. Word has length 195 [2019-09-08 06:54:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:50,386 INFO L475 AbstractCegarLoop]: Abstraction has 1452 states and 1985 transitions. [2019-09-08 06:54:50,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:50,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1985 transitions. [2019-09-08 06:54:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:50,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:50,388 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:50,389 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1740189876, now seen corresponding path program 1 times [2019-09-08 06:54:50,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:50,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:50,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:50,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:50,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:50,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:50,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:50,478 INFO L87 Difference]: Start difference. First operand 1452 states and 1985 transitions. Second operand 6 states. [2019-09-08 06:54:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:50,637 INFO L93 Difference]: Finished difference Result 2940 states and 4117 transitions. [2019-09-08 06:54:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:50,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:50,648 INFO L225 Difference]: With dead ends: 2940 [2019-09-08 06:54:50,648 INFO L226 Difference]: Without dead ends: 1516 [2019-09-08 06:54:50,654 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:54:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-09-08 06:54:50,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1472. [2019-09-08 06:54:50,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2019-09-08 06:54:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 2005 transitions. [2019-09-08 06:54:50,897 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 2005 transitions. Word has length 195 [2019-09-08 06:54:50,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:50,897 INFO L475 AbstractCegarLoop]: Abstraction has 1472 states and 2005 transitions. [2019-09-08 06:54:50,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:50,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 2005 transitions. [2019-09-08 06:54:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:50,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:50,900 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:50,900 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:50,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1496939342, now seen corresponding path program 1 times [2019-09-08 06:54:50,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:50,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:50,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:50,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:50,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:51,043 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:54:51,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:51,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:51,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:51,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:51,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:51,046 INFO L87 Difference]: Start difference. First operand 1472 states and 2005 transitions. Second operand 4 states. [2019-09-08 06:54:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:51,620 INFO L93 Difference]: Finished difference Result 4335 states and 6089 transitions. [2019-09-08 06:54:51,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:51,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-09-08 06:54:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:51,642 INFO L225 Difference]: With dead ends: 4335 [2019-09-08 06:54:51,643 INFO L226 Difference]: Without dead ends: 2891 [2019-09-08 06:54:51,652 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:54:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2019-09-08 06:54:51,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2880. [2019-09-08 06:54:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2880 states. [2019-09-08 06:54:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 3919 transitions. [2019-09-08 06:54:51,983 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 3919 transitions. Word has length 195 [2019-09-08 06:54:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:51,984 INFO L475 AbstractCegarLoop]: Abstraction has 2880 states and 3919 transitions. [2019-09-08 06:54:51,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 3919 transitions. [2019-09-08 06:54:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:51,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:51,986 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:51,986 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:51,987 INFO L82 PathProgramCache]: Analyzing trace with hash 219786669, now seen corresponding path program 1 times [2019-09-08 06:54:51,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:51,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:51,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:51,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:52,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:54:52,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:52,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:52,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:52,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:52,091 INFO L87 Difference]: Start difference. First operand 2880 states and 3919 transitions. Second operand 6 states. [2019-09-08 06:54:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:52,394 INFO L93 Difference]: Finished difference Result 5784 states and 8050 transitions. [2019-09-08 06:54:52,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:52,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:52,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:52,411 INFO L225 Difference]: With dead ends: 5784 [2019-09-08 06:54:52,411 INFO L226 Difference]: Without dead ends: 2932 [2019-09-08 06:54:52,422 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:54:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2019-09-08 06:54:52,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2900. [2019-09-08 06:54:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2900 states. [2019-09-08 06:54:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2900 states to 2900 states and 3935 transitions. [2019-09-08 06:54:52,716 INFO L78 Accepts]: Start accepts. Automaton has 2900 states and 3935 transitions. Word has length 195 [2019-09-08 06:54:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:52,717 INFO L475 AbstractCegarLoop]: Abstraction has 2900 states and 3935 transitions. [2019-09-08 06:54:52,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 2900 states and 3935 transitions. [2019-09-08 06:54:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:52,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:52,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:52,721 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:52,722 INFO L82 PathProgramCache]: Analyzing trace with hash 296687467, now seen corresponding path program 1 times [2019-09-08 06:54:52,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:52,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:52,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:52,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:52,804 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:54:52,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:52,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:52,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:52,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:52,806 INFO L87 Difference]: Start difference. First operand 2900 states and 3935 transitions. Second operand 6 states. [2019-09-08 06:54:53,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:53,107 INFO L93 Difference]: Finished difference Result 5852 states and 8123 transitions. [2019-09-08 06:54:53,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:53,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:53,122 INFO L225 Difference]: With dead ends: 5852 [2019-09-08 06:54:53,123 INFO L226 Difference]: Without dead ends: 2980 [2019-09-08 06:54:53,134 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:54:53,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-09-08 06:54:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2940. [2019-09-08 06:54:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2940 states. [2019-09-08 06:54:53,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2940 states to 2940 states and 3975 transitions. [2019-09-08 06:54:53,458 INFO L78 Accepts]: Start accepts. Automaton has 2940 states and 3975 transitions. Word has length 195 [2019-09-08 06:54:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:53,458 INFO L475 AbstractCegarLoop]: Abstraction has 2940 states and 3975 transitions. [2019-09-08 06:54:53,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2940 states and 3975 transitions. [2019-09-08 06:54:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:53,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:53,461 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:53,461 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:53,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:53,461 INFO L82 PathProgramCache]: Analyzing trace with hash -120709139, now seen corresponding path program 1 times [2019-09-08 06:54:53,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:53,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:53,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:53,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:53,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:53,551 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:54:53,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:53,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:53,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:53,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:53,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:53,552 INFO L87 Difference]: Start difference. First operand 2940 states and 3975 transitions. Second operand 6 states. [2019-09-08 06:54:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:53,824 INFO L93 Difference]: Finished difference Result 5908 states and 8163 transitions. [2019-09-08 06:54:53,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:53,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-09-08 06:54:53,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:53,849 INFO L225 Difference]: With dead ends: 5908 [2019-09-08 06:54:53,849 INFO L226 Difference]: Without dead ends: 2996 [2019-09-08 06:54:53,860 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:54:53,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-09-08 06:54:54,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2980. [2019-09-08 06:54:54,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2980 states. [2019-09-08 06:54:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4015 transitions. [2019-09-08 06:54:54,223 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4015 transitions. Word has length 195 [2019-09-08 06:54:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:54,223 INFO L475 AbstractCegarLoop]: Abstraction has 2980 states and 4015 transitions. [2019-09-08 06:54:54,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4015 transitions. [2019-09-08 06:54:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:54,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:54,226 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:54,226 INFO L82 PathProgramCache]: Analyzing trace with hash 755309867, now seen corresponding path program 1 times [2019-09-08 06:54:54,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:54,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:54,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:54,328 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:54:54,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:54,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:54,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:54,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:54,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:54,330 INFO L87 Difference]: Start difference. First operand 2980 states and 4015 transitions. Second operand 5 states. [2019-09-08 06:54:55,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:55,886 INFO L93 Difference]: Finished difference Result 8372 states and 11273 transitions. [2019-09-08 06:54:55,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:54:55,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:55,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:55,908 INFO L225 Difference]: With dead ends: 8372 [2019-09-08 06:54:55,908 INFO L226 Difference]: Without dead ends: 5420 [2019-09-08 06:54:55,923 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:54:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2019-09-08 06:54:56,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 4268. [2019-09-08 06:54:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:54:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5631 transitions. [2019-09-08 06:54:56,352 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5631 transitions. Word has length 195 [2019-09-08 06:54:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:56,352 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5631 transitions. [2019-09-08 06:54:56,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5631 transitions. [2019-09-08 06:54:56,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:56,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:56,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:56,355 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:56,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:56,355 INFO L82 PathProgramCache]: Analyzing trace with hash 274229609, now seen corresponding path program 1 times [2019-09-08 06:54:56,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:56,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:56,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:56,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:56,459 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:54:56,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:56,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:56,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:56,461 INFO L87 Difference]: Start difference. First operand 4268 states and 5631 transitions. Second operand 5 states. [2019-09-08 06:54:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:57,631 INFO L93 Difference]: Finished difference Result 8507 states and 11253 transitions. [2019-09-08 06:54:57,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:57,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:57,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:57,658 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:54:57,659 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:54:57,681 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:54:57,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:54:58,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:54:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:54:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5607 transitions. [2019-09-08 06:54:58,345 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5607 transitions. Word has length 195 [2019-09-08 06:54:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:58,346 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5607 transitions. [2019-09-08 06:54:58,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5607 transitions. [2019-09-08 06:54:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:54:58,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:58,348 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:58,348 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:58,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2081575641, now seen corresponding path program 1 times [2019-09-08 06:54:58,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:58,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:58,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:58,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:58,452 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:54:58,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:58,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:58,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:58,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:58,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:58,457 INFO L87 Difference]: Start difference. First operand 4268 states and 5607 transitions. Second operand 5 states. [2019-09-08 06:54:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:59,571 INFO L93 Difference]: Finished difference Result 8507 states and 11205 transitions. [2019-09-08 06:54:59,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:59,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:54:59,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:59,618 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:54:59,619 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:54:59,631 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:54:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:00,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5583 transitions. [2019-09-08 06:55:00,562 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5583 transitions. Word has length 195 [2019-09-08 06:55:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:00,563 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5583 transitions. [2019-09-08 06:55:00,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5583 transitions. [2019-09-08 06:55:00,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:00,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:00,565 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:00,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1860303273, now seen corresponding path program 1 times [2019-09-08 06:55:00,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:00,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:00,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:00,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:55:00,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:00,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:00,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:00,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:00,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:00,700 INFO L87 Difference]: Start difference. First operand 4268 states and 5583 transitions. Second operand 5 states. [2019-09-08 06:55:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:01,940 INFO L93 Difference]: Finished difference Result 8507 states and 11157 transitions. [2019-09-08 06:55:01,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:01,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:01,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:01,964 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:55:01,964 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:55:01,976 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:55:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:02,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5559 transitions. [2019-09-08 06:55:02,686 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5559 transitions. Word has length 195 [2019-09-08 06:55:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:02,687 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5559 transitions. [2019-09-08 06:55:02,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5559 transitions. [2019-09-08 06:55:02,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:02,689 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:02,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:02,689 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:02,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash -506391321, now seen corresponding path program 1 times [2019-09-08 06:55:02,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:02,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:02,852 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:55:02,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:02,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:02,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:02,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:02,854 INFO L87 Difference]: Start difference. First operand 4268 states and 5559 transitions. Second operand 5 states. [2019-09-08 06:55:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:04,074 INFO L93 Difference]: Finished difference Result 8507 states and 11109 transitions. [2019-09-08 06:55:04,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:04,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:04,090 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:55:04,090 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:55:04,098 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:55:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5535 transitions. [2019-09-08 06:55:04,565 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5535 transitions. Word has length 195 [2019-09-08 06:55:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:04,566 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5535 transitions. [2019-09-08 06:55:04,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5535 transitions. [2019-09-08 06:55:04,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:04,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:04,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:04,568 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash 387095017, now seen corresponding path program 1 times [2019-09-08 06:55:04,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:04,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:04,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:04,663 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:55:04,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:04,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:04,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:04,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:04,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:04,664 INFO L87 Difference]: Start difference. First operand 4268 states and 5535 transitions. Second operand 5 states. [2019-09-08 06:55:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:05,574 INFO L93 Difference]: Finished difference Result 8507 states and 11061 transitions. [2019-09-08 06:55:05,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:05,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:05,589 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:55:05,589 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:55:05,597 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:55:05,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:06,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:06,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5511 transitions. [2019-09-08 06:55:06,014 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5511 transitions. Word has length 195 [2019-09-08 06:55:06,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:06,015 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5511 transitions. [2019-09-08 06:55:06,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:06,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5511 transitions. [2019-09-08 06:55:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:06,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:06,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:06,017 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:06,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1662292825, now seen corresponding path program 1 times [2019-09-08 06:55:06,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:06,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:06,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:06,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:55:06,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:06,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:06,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:06,142 INFO L87 Difference]: Start difference. First operand 4268 states and 5511 transitions. Second operand 5 states. [2019-09-08 06:55:07,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:07,146 INFO L93 Difference]: Finished difference Result 8507 states and 11013 transitions. [2019-09-08 06:55:07,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:07,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:07,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:07,159 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:55:07,160 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:55:07,168 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:55:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5487 transitions. [2019-09-08 06:55:07,566 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5487 transitions. Word has length 195 [2019-09-08 06:55:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:07,566 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5487 transitions. [2019-09-08 06:55:07,566 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5487 transitions. [2019-09-08 06:55:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:07,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:07,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:07,568 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1735281193, now seen corresponding path program 1 times [2019-09-08 06:55:07,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:07,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:07,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:07,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:07,657 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:55:07,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:07,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:07,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:07,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:07,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:07,658 INFO L87 Difference]: Start difference. First operand 4268 states and 5487 transitions. Second operand 5 states. [2019-09-08 06:55:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:08,589 INFO L93 Difference]: Finished difference Result 8507 states and 10965 transitions. [2019-09-08 06:55:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:55:08,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:08,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:08,601 INFO L225 Difference]: With dead ends: 8507 [2019-09-08 06:55:08,601 INFO L226 Difference]: Without dead ends: 4268 [2019-09-08 06:55:08,609 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:55:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2019-09-08 06:55:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4268. [2019-09-08 06:55:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4268 states. [2019-09-08 06:55:09,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4268 states to 4268 states and 5463 transitions. [2019-09-08 06:55:09,036 INFO L78 Accepts]: Start accepts. Automaton has 4268 states and 5463 transitions. Word has length 195 [2019-09-08 06:55:09,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:09,036 INFO L475 AbstractCegarLoop]: Abstraction has 4268 states and 5463 transitions. [2019-09-08 06:55:09,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:09,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4268 states and 5463 transitions. [2019-09-08 06:55:09,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:09,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:09,039 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:09,039 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:09,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1983427687, now seen corresponding path program 1 times [2019-09-08 06:55:09,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:09,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:09,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:09,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:09,119 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:55:09,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:09,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:09,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:09,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:09,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:09,121 INFO L87 Difference]: Start difference. First operand 4268 states and 5463 transitions. Second operand 5 states. [2019-09-08 06:55:10,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:10,599 INFO L93 Difference]: Finished difference Result 10964 states and 14451 transitions. [2019-09-08 06:55:10,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:10,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:10,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:10,619 INFO L225 Difference]: With dead ends: 10964 [2019-09-08 06:55:10,620 INFO L226 Difference]: Without dead ends: 6724 [2019-09-08 06:55:10,631 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:55:10,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6724 states. [2019-09-08 06:55:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6724 to 5324. [2019-09-08 06:55:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2019-09-08 06:55:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 6655 transitions. [2019-09-08 06:55:11,192 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 6655 transitions. Word has length 195 [2019-09-08 06:55:11,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:11,192 INFO L475 AbstractCegarLoop]: Abstraction has 5324 states and 6655 transitions. [2019-09-08 06:55:11,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 6655 transitions. [2019-09-08 06:55:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:11,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:11,194 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:11,195 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 611620389, now seen corresponding path program 1 times [2019-09-08 06:55:11,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:55:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:11,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:11,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:11,293 INFO L87 Difference]: Start difference. First operand 5324 states and 6655 transitions. Second operand 5 states. [2019-09-08 06:55:12,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:12,849 INFO L93 Difference]: Finished difference Result 12876 states and 16619 transitions. [2019-09-08 06:55:12,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:12,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:12,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:12,870 INFO L225 Difference]: With dead ends: 12876 [2019-09-08 06:55:12,871 INFO L226 Difference]: Without dead ends: 7580 [2019-09-08 06:55:12,882 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:55:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7580 states. [2019-09-08 06:55:13,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7580 to 6300. [2019-09-08 06:55:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6300 states. [2019-09-08 06:55:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6300 states to 6300 states and 7735 transitions. [2019-09-08 06:55:13,353 INFO L78 Accepts]: Start accepts. Automaton has 6300 states and 7735 transitions. Word has length 195 [2019-09-08 06:55:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:13,353 INFO L475 AbstractCegarLoop]: Abstraction has 6300 states and 7735 transitions. [2019-09-08 06:55:13,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 6300 states and 7735 transitions. [2019-09-08 06:55:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:13,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:13,355 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:13,356 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1233746777, now seen corresponding path program 1 times [2019-09-08 06:55:13,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:13,457 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:55:13,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:13,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:13,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:13,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:13,459 INFO L87 Difference]: Start difference. First operand 6300 states and 7735 transitions. Second operand 5 states. [2019-09-08 06:55:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:15,043 INFO L93 Difference]: Finished difference Result 13999 states and 17682 transitions. [2019-09-08 06:55:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:15,043 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:15,065 INFO L225 Difference]: With dead ends: 13999 [2019-09-08 06:55:15,065 INFO L226 Difference]: Without dead ends: 7728 [2019-09-08 06:55:15,077 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:55:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7728 states. [2019-09-08 06:55:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7728 to 7252. [2019-09-08 06:55:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7252 states. [2019-09-08 06:55:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7252 states to 7252 states and 8779 transitions. [2019-09-08 06:55:15,661 INFO L78 Accepts]: Start accepts. Automaton has 7252 states and 8779 transitions. Word has length 195 [2019-09-08 06:55:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:15,661 INFO L475 AbstractCegarLoop]: Abstraction has 7252 states and 8779 transitions. [2019-09-08 06:55:15,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:15,662 INFO L276 IsEmpty]: Start isEmpty. Operand 7252 states and 8779 transitions. [2019-09-08 06:55:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:15,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:15,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:15,664 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2031861221, now seen corresponding path program 1 times [2019-09-08 06:55:15,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:15,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:15,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:15,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:15,754 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:55:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:15,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:15,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:15,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:15,756 INFO L87 Difference]: Start difference. First operand 7252 states and 8779 transitions. Second operand 5 states. [2019-09-08 06:55:17,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:17,233 INFO L93 Difference]: Finished difference Result 15328 states and 19032 transitions. [2019-09-08 06:55:17,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:17,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:17,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:17,254 INFO L225 Difference]: With dead ends: 15328 [2019-09-08 06:55:17,255 INFO L226 Difference]: Without dead ends: 8104 [2019-09-08 06:55:17,268 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:55:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8104 states. [2019-09-08 06:55:17,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8104 to 7588. [2019-09-08 06:55:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7588 states. [2019-09-08 06:55:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7588 states to 7588 states and 9083 transitions. [2019-09-08 06:55:17,850 INFO L78 Accepts]: Start accepts. Automaton has 7588 states and 9083 transitions. Word has length 195 [2019-09-08 06:55:17,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:17,850 INFO L475 AbstractCegarLoop]: Abstraction has 7588 states and 9083 transitions. [2019-09-08 06:55:17,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7588 states and 9083 transitions. [2019-09-08 06:55:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:17,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:17,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:17,852 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:17,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1603574553, now seen corresponding path program 1 times [2019-09-08 06:55:17,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:17,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:17,938 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:55:17,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:17,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:17,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:17,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:17,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:17,940 INFO L87 Difference]: Start difference. First operand 7588 states and 9083 transitions. Second operand 5 states. [2019-09-08 06:55:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:19,572 INFO L93 Difference]: Finished difference Result 16485 states and 20278 transitions. [2019-09-08 06:55:19,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:19,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:19,592 INFO L225 Difference]: With dead ends: 16485 [2019-09-08 06:55:19,592 INFO L226 Difference]: Without dead ends: 8926 [2019-09-08 06:55:19,602 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:55:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8926 states. [2019-09-08 06:55:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8926 to 8450. [2019-09-08 06:55:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8450 states. [2019-09-08 06:55:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8450 states to 8450 states and 10001 transitions. [2019-09-08 06:55:20,187 INFO L78 Accepts]: Start accepts. Automaton has 8450 states and 10001 transitions. Word has length 195 [2019-09-08 06:55:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:20,187 INFO L475 AbstractCegarLoop]: Abstraction has 8450 states and 10001 transitions. [2019-09-08 06:55:20,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 8450 states and 10001 transitions. [2019-09-08 06:55:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:20,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:20,189 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:20,189 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:20,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1997941339, now seen corresponding path program 1 times [2019-09-08 06:55:20,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:20,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:20,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:20,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:20,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:20,273 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:55:20,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:20,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:20,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:20,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:20,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:20,274 INFO L87 Difference]: Start difference. First operand 8450 states and 10001 transitions. Second operand 5 states. [2019-09-08 06:55:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:21,814 INFO L93 Difference]: Finished difference Result 17526 states and 21278 transitions. [2019-09-08 06:55:21,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:21,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:21,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:21,838 INFO L225 Difference]: With dead ends: 17526 [2019-09-08 06:55:21,839 INFO L226 Difference]: Without dead ends: 9104 [2019-09-08 06:55:21,851 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:55:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9104 states. [2019-09-08 06:55:22,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9104 to 8696. [2019-09-08 06:55:22,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8696 states. [2019-09-08 06:55:22,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8696 states to 8696 states and 10179 transitions. [2019-09-08 06:55:22,484 INFO L78 Accepts]: Start accepts. Automaton has 8696 states and 10179 transitions. Word has length 195 [2019-09-08 06:55:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:22,485 INFO L475 AbstractCegarLoop]: Abstraction has 8696 states and 10179 transitions. [2019-09-08 06:55:22,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:22,485 INFO L276 IsEmpty]: Start isEmpty. Operand 8696 states and 10179 transitions. [2019-09-08 06:55:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:22,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:22,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:22,486 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:22,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1453020455, now seen corresponding path program 1 times [2019-09-08 06:55:22,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:22,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:22,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:22,597 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:55:22,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:22,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:22,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:22,599 INFO L87 Difference]: Start difference. First operand 8696 states and 10179 transitions. Second operand 5 states. [2019-09-08 06:55:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:24,233 INFO L93 Difference]: Finished difference Result 18611 states and 22370 transitions. [2019-09-08 06:55:24,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:24,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:24,258 INFO L225 Difference]: With dead ends: 18611 [2019-09-08 06:55:24,258 INFO L226 Difference]: Without dead ends: 9944 [2019-09-08 06:55:24,279 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:55:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9944 states. [2019-09-08 06:55:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9944 to 9468. [2019-09-08 06:55:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9468 states. [2019-09-08 06:55:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9468 states to 9468 states and 10971 transitions. [2019-09-08 06:55:25,062 INFO L78 Accepts]: Start accepts. Automaton has 9468 states and 10971 transitions. Word has length 195 [2019-09-08 06:55:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:25,063 INFO L475 AbstractCegarLoop]: Abstraction has 9468 states and 10971 transitions. [2019-09-08 06:55:25,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:25,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9468 states and 10971 transitions. [2019-09-08 06:55:25,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:25,064 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:25,064 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:25,064 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -790962843, now seen corresponding path program 1 times [2019-09-08 06:55:25,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:25,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:25,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:25,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:55:25,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:25,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:55:25,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:25,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:25,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:25,141 INFO L87 Difference]: Start difference. First operand 9468 states and 10971 transitions. Second operand 5 states. [2019-09-08 06:55:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:26,727 INFO L93 Difference]: Finished difference Result 20012 states and 23995 transitions. [2019-09-08 06:55:26,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:55:26,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-09-08 06:55:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:26,751 INFO L225 Difference]: With dead ends: 20012 [2019-09-08 06:55:26,751 INFO L226 Difference]: Without dead ends: 10572 [2019-09-08 06:55:26,764 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:55:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2019-09-08 06:55:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 10060. [2019-09-08 06:55:27,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10060 states. [2019-09-08 06:55:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10060 states to 10060 states and 11511 transitions. [2019-09-08 06:55:27,631 INFO L78 Accepts]: Start accepts. Automaton has 10060 states and 11511 transitions. Word has length 195 [2019-09-08 06:55:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:27,631 INFO L475 AbstractCegarLoop]: Abstraction has 10060 states and 11511 transitions. [2019-09-08 06:55:27,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 10060 states and 11511 transitions. [2019-09-08 06:55:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 06:55:27,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:27,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:27,633 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -516203229, now seen corresponding path program 1 times [2019-09-08 06:55:27,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:27,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:27,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:27,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:27,697 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:55:27,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:27,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:55:27,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:55:27,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:55:27,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:27,698 INFO L87 Difference]: Start difference. First operand 10060 states and 11511 transitions. Second operand 3 states. [2019-09-08 06:55:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:29,068 INFO L93 Difference]: Finished difference Result 29052 states and 33362 transitions. [2019-09-08 06:55:29,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:55:29,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 195 [2019-09-08 06:55:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:29,110 INFO L225 Difference]: With dead ends: 29052 [2019-09-08 06:55:29,110 INFO L226 Difference]: Without dead ends: 19021 [2019-09-08 06:55:29,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19021 states. [2019-09-08 06:55:30,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19021 to 19018. [2019-09-08 06:55:30,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19018 states. [2019-09-08 06:55:30,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19018 states to 19018 states and 21789 transitions. [2019-09-08 06:55:30,446 INFO L78 Accepts]: Start accepts. Automaton has 19018 states and 21789 transitions. Word has length 195 [2019-09-08 06:55:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:30,446 INFO L475 AbstractCegarLoop]: Abstraction has 19018 states and 21789 transitions. [2019-09-08 06:55:30,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:55:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19018 states and 21789 transitions. [2019-09-08 06:55:30,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 06:55:30,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:30,449 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:30,449 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:30,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:30,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1337344377, now seen corresponding path program 1 times [2019-09-08 06:55:30,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:30,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:30,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:30,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:30,531 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:55:30,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:30,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:55:30,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:55:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:55:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:30,533 INFO L87 Difference]: Start difference. First operand 19018 states and 21789 transitions. Second operand 3 states. [2019-09-08 06:55:33,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:33,356 INFO L93 Difference]: Finished difference Result 56591 states and 66589 transitions. [2019-09-08 06:55:33,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:55:33,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-09-08 06:55:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:33,434 INFO L225 Difference]: With dead ends: 56591 [2019-09-08 06:55:33,434 INFO L226 Difference]: Without dead ends: 37614 [2019-09-08 06:55:33,461 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:55:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37614 states. [2019-09-08 06:55:37,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37614 to 37612. [2019-09-08 06:55:37,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37612 states. [2019-09-08 06:55:37,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37612 states to 37612 states and 43786 transitions. [2019-09-08 06:55:37,410 INFO L78 Accepts]: Start accepts. Automaton has 37612 states and 43786 transitions. Word has length 196 [2019-09-08 06:55:37,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:37,411 INFO L475 AbstractCegarLoop]: Abstraction has 37612 states and 43786 transitions. [2019-09-08 06:55:37,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:55:37,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37612 states and 43786 transitions. [2019-09-08 06:55:37,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 06:55:37,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:37,420 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:37,420 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:37,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:37,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1832143036, now seen corresponding path program 1 times [2019-09-08 06:55:37,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:37,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:37,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 06:55:37,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:37,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:55:37,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:55:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:55:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:55:37,493 INFO L87 Difference]: Start difference. First operand 37612 states and 43786 transitions. Second operand 4 states. [2019-09-08 06:55:40,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:40,975 INFO L93 Difference]: Finished difference Result 75181 states and 87505 transitions. [2019-09-08 06:55:40,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:55:40,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 223 [2019-09-08 06:55:40,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:41,055 INFO L225 Difference]: With dead ends: 75181 [2019-09-08 06:55:41,056 INFO L226 Difference]: Without dead ends: 37598 [2019-09-08 06:55:41,098 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:55:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37598 states. [2019-09-08 06:55:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37598 to 37598. [2019-09-08 06:55:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37598 states. [2019-09-08 06:55:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37598 states to 37598 states and 43760 transitions. [2019-09-08 06:55:44,146 INFO L78 Accepts]: Start accepts. Automaton has 37598 states and 43760 transitions. Word has length 223 [2019-09-08 06:55:44,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:44,147 INFO L475 AbstractCegarLoop]: Abstraction has 37598 states and 43760 transitions. [2019-09-08 06:55:44,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:55:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37598 states and 43760 transitions. [2019-09-08 06:55:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 06:55:44,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:44,155 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:44,156 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1741904838, now seen corresponding path program 1 times [2019-09-08 06:55:44,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:44,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:44,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:44,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:55:44,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:44,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:55:44,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:55:44,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:55:44,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:44,239 INFO L87 Difference]: Start difference. First operand 37598 states and 43760 transitions. Second operand 3 states. [2019-09-08 06:55:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:50,731 INFO L93 Difference]: Finished difference Result 112546 states and 132432 transitions. [2019-09-08 06:55:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:55:50,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-08 06:55:50,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:50,877 INFO L225 Difference]: With dead ends: 112546 [2019-09-08 06:55:50,877 INFO L226 Difference]: Without dead ends: 56346 [2019-09-08 06:55:50,950 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56346 states. [2019-09-08 06:55:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56346 to 56346. [2019-09-08 06:55:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56346 states. [2019-09-08 06:55:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56346 states to 56346 states and 65527 transitions. [2019-09-08 06:55:57,226 INFO L78 Accepts]: Start accepts. Automaton has 56346 states and 65527 transitions. Word has length 223 [2019-09-08 06:55:57,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:57,226 INFO L475 AbstractCegarLoop]: Abstraction has 56346 states and 65527 transitions. [2019-09-08 06:55:57,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:55:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 56346 states and 65527 transitions. [2019-09-08 06:55:57,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-09-08 06:55:57,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:57,299 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:57,300 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:57,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1001137691, now seen corresponding path program 1 times [2019-09-08 06:55:57,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:57,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:57,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:57,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:57,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:55:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:57,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:55:57,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:55:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:55:57,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:57,412 INFO L87 Difference]: Start difference. First operand 56346 states and 65527 transitions. Second operand 3 states. [2019-09-08 06:56:06,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:06,855 INFO L93 Difference]: Finished difference Result 163994 states and 196909 transitions. [2019-09-08 06:56:06,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:56:06,856 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-09-08 06:56:06,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:07,169 INFO L225 Difference]: With dead ends: 163994 [2019-09-08 06:56:07,169 INFO L226 Difference]: Without dead ends: 107677 [2019-09-08 06:56:07,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:56:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107677 states. [2019-09-08 06:56:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107677 to 107242. [2019-09-08 06:56:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107242 states. [2019-09-08 06:56:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107242 states to 107242 states and 128780 transitions. [2019-09-08 06:56:16,472 INFO L78 Accepts]: Start accepts. Automaton has 107242 states and 128780 transitions. Word has length 330 [2019-09-08 06:56:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:16,472 INFO L475 AbstractCegarLoop]: Abstraction has 107242 states and 128780 transitions. [2019-09-08 06:56:16,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:56:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 107242 states and 128780 transitions. [2019-09-08 06:56:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-08 06:56:16,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:16,575 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:16,576 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -256907899, now seen corresponding path program 1 times [2019-09-08 06:56:16,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:16,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:16,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:16,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:56:16,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:56:16,698 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:56:16,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:16,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 1819 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:56:16,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:56:19,325 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:56:19,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:56:19,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:56:19,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:56:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:56:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:56:19,334 INFO L87 Difference]: Start difference. First operand 107242 states and 128780 transitions. Second operand 7 states. [2019-09-08 06:56:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:36,109 INFO L93 Difference]: Finished difference Result 282367 states and 354941 transitions. [2019-09-08 06:56:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:56:36,110 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 331 [2019-09-08 06:56:36,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:36,552 INFO L225 Difference]: With dead ends: 282367 [2019-09-08 06:56:36,552 INFO L226 Difference]: Without dead ends: 142914 [2019-09-08 06:56:36,847 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:56:36,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142914 states. [2019-09-08 06:56:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142914 to 142912. [2019-09-08 06:56:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142912 states. [2019-09-08 06:56:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142912 states to 142912 states and 172169 transitions. [2019-09-08 06:56:56,368 INFO L78 Accepts]: Start accepts. Automaton has 142912 states and 172169 transitions. Word has length 331 [2019-09-08 06:56:56,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:56,368 INFO L475 AbstractCegarLoop]: Abstraction has 142912 states and 172169 transitions. [2019-09-08 06:56:56,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:56:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 142912 states and 172169 transitions. [2019-09-08 06:56:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2019-09-08 06:56:56,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:56,604 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:56:56,604 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash -273435450, now seen corresponding path program 1 times [2019-09-08 06:56:56,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:56,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 45 proven. 114 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2019-09-08 06:56:56,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:56:56,874 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:56:56,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:57,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 2944 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:56:57,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:56:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-09-08 06:56:57,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:56:57,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:56:57,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:56:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:56:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:56:57,653 INFO L87 Difference]: Start difference. First operand 142912 states and 172169 transitions. Second operand 6 states. [2019-09-08 06:57:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:20,236 INFO L93 Difference]: Finished difference Result 365139 states and 469993 transitions. [2019-09-08 06:57:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:57:20,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 656 [2019-09-08 06:57:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:25,931 INFO L225 Difference]: With dead ends: 365139 [2019-09-08 06:57:25,932 INFO L226 Difference]: Without dead ends: 222255 [2019-09-08 06:57:26,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 660 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:57:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222255 states. [2019-09-08 06:57:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222255 to 215100. [2019-09-08 06:57:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215100 states. [2019-09-08 06:57:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215100 states to 215100 states and 264176 transitions. [2019-09-08 06:57:46,717 INFO L78 Accepts]: Start accepts. Automaton has 215100 states and 264176 transitions. Word has length 656 [2019-09-08 06:57:46,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:46,718 INFO L475 AbstractCegarLoop]: Abstraction has 215100 states and 264176 transitions. [2019-09-08 06:57:46,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 215100 states and 264176 transitions. [2019-09-08 06:57:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2019-09-08 06:57:46,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:46,990 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:57:46,990 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 519005727, now seen corresponding path program 1 times [2019-09-08 06:57:46,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 47 proven. 26 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-08 06:57:51,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:51,898 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:57:51,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:52,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 2891 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 06:57:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:52,548 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-09-08 06:57:52,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-09-08 06:57:52,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:57:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:57:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:57:52,555 INFO L87 Difference]: Start difference. First operand 215100 states and 264176 transitions. Second operand 12 states. [2019-09-08 06:58:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:11,559 INFO L93 Difference]: Finished difference Result 402458 states and 490680 transitions. [2019-09-08 06:58:11,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:58:11,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 648 [2019-09-08 06:58:11,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:12,557 INFO L225 Difference]: With dead ends: 402458 [2019-09-08 06:58:12,558 INFO L226 Difference]: Without dead ends: 187387 [2019-09-08 06:58:13,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:58:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187387 states. [2019-09-08 06:58:40,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187387 to 181352. [2019-09-08 06:58:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181352 states. [2019-09-08 06:58:40,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181352 states to 181352 states and 209853 transitions. [2019-09-08 06:58:40,994 INFO L78 Accepts]: Start accepts. Automaton has 181352 states and 209853 transitions. Word has length 648 [2019-09-08 06:58:40,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:40,995 INFO L475 AbstractCegarLoop]: Abstraction has 181352 states and 209853 transitions. [2019-09-08 06:58:40,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:58:40,995 INFO L276 IsEmpty]: Start isEmpty. Operand 181352 states and 209853 transitions. [2019-09-08 06:58:41,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2019-09-08 06:58:41,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:41,936 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:58:41,936 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:41,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:41,937 INFO L82 PathProgramCache]: Analyzing trace with hash -734702046, now seen corresponding path program 1 times [2019-09-08 06:58:41,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:41,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:41,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:41,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-09-08 06:58:42,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:58:42,194 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) [2019-09-08 06:58:42,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:58:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:42,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 2221 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:58:42,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:58:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 06:58:42,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:58:42,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:58:42,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:42,995 INFO L87 Difference]: Start difference. First operand 181352 states and 209853 transitions. Second operand 6 states. [2019-09-08 06:59:00,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:00,715 INFO L93 Difference]: Finished difference Result 316179 states and 371859 transitions. [2019-09-08 06:59:00,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:59:00,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 445 [2019-09-08 06:59:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:01,200 INFO L225 Difference]: With dead ends: 316179 [2019-09-08 06:59:01,200 INFO L226 Difference]: Without dead ends: 134874 [2019-09-08 06:59:01,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 446 SyntacticMatches, 1 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:59:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134874 states. [2019-09-08 06:59:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134874 to 132659. [2019-09-08 06:59:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132659 states. [2019-09-08 06:59:21,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132659 states to 132659 states and 148614 transitions. [2019-09-08 06:59:21,773 INFO L78 Accepts]: Start accepts. Automaton has 132659 states and 148614 transitions. Word has length 445 [2019-09-08 06:59:21,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:21,773 INFO L475 AbstractCegarLoop]: Abstraction has 132659 states and 148614 transitions. [2019-09-08 06:59:21,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:59:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 132659 states and 148614 transitions. [2019-09-08 06:59:21,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2019-09-08 06:59:21,886 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:21,886 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:59:21,886 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash -935983267, now seen corresponding path program 1 times [2019-09-08 06:59:21,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:22,065 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-08 06:59:22,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:59:22,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:59:22,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:59:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:22,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 2294 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 06:59:22,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:59:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:59:22,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:59:22,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:59:22,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:59:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:59:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:59:22,525 INFO L87 Difference]: Start difference. First operand 132659 states and 148614 transitions. Second operand 6 states. [2019-09-08 07:00:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:05,632 INFO L93 Difference]: Finished difference Result 500498 states and 563796 transitions. [2019-09-08 07:00:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:00:05,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 455 [2019-09-08 07:00:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:06,809 INFO L225 Difference]: With dead ends: 500498 [2019-09-08 07:00:06,809 INFO L226 Difference]: Without dead ends: 290513 [2019-09-08 07:00:07,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 457 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 07:00:07,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290513 states. [2019-09-08 07:00:44,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290513 to 290209. [2019-09-08 07:00:44,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290209 states. [2019-09-08 07:00:44,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290209 states to 290209 states and 328015 transitions. [2019-09-08 07:00:44,737 INFO L78 Accepts]: Start accepts. Automaton has 290209 states and 328015 transitions. Word has length 455 [2019-09-08 07:00:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:44,737 INFO L475 AbstractCegarLoop]: Abstraction has 290209 states and 328015 transitions. [2019-09-08 07:00:44,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:00:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 290209 states and 328015 transitions. [2019-09-08 07:00:44,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-09-08 07:00:44,953 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:44,953 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:00:44,953 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:44,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:44,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2089695594, now seen corresponding path program 1 times [2019-09-08 07:00:44,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:44,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:44,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:44,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2019-09-08 07:00:45,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:00:45,188 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:00:45,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:45,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:00:45,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:00:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 604 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-09-08 07:00:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:00:46,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:00:46,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:46,614 INFO L87 Difference]: Start difference. First operand 290209 states and 328015 transitions. Second operand 5 states. [2019-09-08 07:01:58,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:58,039 INFO L93 Difference]: Finished difference Result 808916 states and 937876 transitions. [2019-09-08 07:01:58,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:01:58,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 564 [2019-09-08 07:01:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:59,585 INFO L225 Difference]: With dead ends: 808916 [2019-09-08 07:01:59,586 INFO L226 Difference]: Without dead ends: 518808 [2019-09-08 07:02:00,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 571 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:02:00,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518808 states. [2019-09-08 07:03:15,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518808 to 509485. [2019-09-08 07:03:15,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509485 states. [2019-09-08 07:03:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509485 states to 509485 states and 570230 transitions. [2019-09-08 07:03:16,610 INFO L78 Accepts]: Start accepts. Automaton has 509485 states and 570230 transitions. Word has length 564 [2019-09-08 07:03:16,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:16,611 INFO L475 AbstractCegarLoop]: Abstraction has 509485 states and 570230 transitions. [2019-09-08 07:03:16,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:03:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 509485 states and 570230 transitions. [2019-09-08 07:03:17,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2019-09-08 07:03:17,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:17,120 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, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:03:17,120 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:17,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:17,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1460409624, now seen corresponding path program 1 times [2019-09-08 07:03:17,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:17,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:17,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:17,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 1 proven. 54 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-09-08 07:03:17,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:03:17,428 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 07:03:17,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:17,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 2655 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 07:03:17,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:03:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2019-09-08 07:03:19,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:03:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:03:19,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:03:19,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:03:19,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:03:19,018 INFO L87 Difference]: Start difference. First operand 509485 states and 570230 transitions. Second operand 5 states. [2019-09-08 07:04:15,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:04:15,608 INFO L93 Difference]: Finished difference Result 824330 states and 922334 transitions. [2019-09-08 07:04:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:04:15,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 569 [2019-09-08 07:04:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:04:16,740 INFO L225 Difference]: With dead ends: 824330 [2019-09-08 07:04:16,741 INFO L226 Difference]: Without dead ends: 373046 [2019-09-08 07:04:17,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:04:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373046 states. [2019-09-08 07:05:12,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373046 to 372328. [2019-09-08 07:05:12,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372328 states. [2019-09-08 07:05:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372328 states to 372328 states and 414401 transitions. [2019-09-08 07:05:13,345 INFO L78 Accepts]: Start accepts. Automaton has 372328 states and 414401 transitions. Word has length 569 [2019-09-08 07:05:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:13,346 INFO L475 AbstractCegarLoop]: Abstraction has 372328 states and 414401 transitions. [2019-09-08 07:05:13,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:05:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 372328 states and 414401 transitions. [2019-09-08 07:05:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-09-08 07:05:13,649 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:13,649 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, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:05:13,650 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:13,650 INFO L82 PathProgramCache]: Analyzing trace with hash -413167283, now seen corresponding path program 1 times [2019-09-08 07:05:13,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:13,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:13,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:14,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 26 proven. 17 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-09-08 07:05:14,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:14,997 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) [2019-09-08 07:05:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:05:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:15,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 3134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 07:05:15,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 419 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-08 07:05:15,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:15,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 07:05:15,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:05:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:05:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:05:15,676 INFO L87 Difference]: Start difference. First operand 372328 states and 414401 transitions. Second operand 6 states.