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.07.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:53:50,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:53:50,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:53:50,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:53:50,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:53:50,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:53:50,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:53:50,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:53:50,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:53:50,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:53:50,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:53:50,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:53:50,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:53:50,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:53:50,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:53:50,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:53:50,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:53:50,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:53:50,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:53:50,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:53:50,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:53:50,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:53:50,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:53:50,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:53:50,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:53:50,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:53:50,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:53:50,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:53:50,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:53:50,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:53:50,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:53:50,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:53:50,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:53:50,581 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:53:50,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:53:50,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:53:50,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:53:50,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:53:50,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:53:50,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:53:50,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:53:50,589 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:53:50,615 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:53:50,615 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:53:50,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:53:50,617 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:53:50,618 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:53:50,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:53:50,618 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:53:50,618 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:53:50,618 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:53:50,619 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:53:50,620 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:53:50,620 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:53:50,620 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:53:50,620 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:53:50,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:53:50,621 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:53:50,621 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:53:50,621 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:53:50,621 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:53:50,622 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:53:50,622 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:53:50,622 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:53:50,622 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:53:50,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:53:50,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:53:50,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:53:50,624 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:53:50,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:53:50,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:53:50,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:53:50,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:53:50,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:53:50,677 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:53:50,683 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:53:50,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.07.cil.c [2019-09-08 06:53:50,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c363b82/cc34f425306b464c9c45102bad5e3a78/FLAG04e59e116 [2019-09-08 06:53:51,237 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:53:51,238 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.07.cil.c [2019-09-08 06:53:51,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c363b82/cc34f425306b464c9c45102bad5e3a78/FLAG04e59e116 [2019-09-08 06:53:51,577 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5c363b82/cc34f425306b464c9c45102bad5e3a78 [2019-09-08 06:53:51,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:53:51,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:53:51,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:53:51,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:53:51,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:53:51,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:53:51" (1/1) ... [2019-09-08 06:53:51,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6681a6dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:51, skipping insertion in model container [2019-09-08 06:53:51,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:53:51" (1/1) ... [2019-09-08 06:53:51,603 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:53:51,655 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:53:51,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:53:51,959 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:53:52,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:53:52,161 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:53:52,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52 WrapperNode [2019-09-08 06:53:52,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:53:52,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:53:52,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:53:52,164 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:53:52,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (1/1) ... [2019-09-08 06:53:52,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:53:52,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:53:52,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:53:52,233 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:53:52,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (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:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:53:52,294 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:53:52,295 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:53:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:53:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:53:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:53:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:53:52,296 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:53:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:53:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:53:52,299 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:53:52,299 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:53:52,299 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:53:52,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:53:52,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:53:52,299 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:53:52,300 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:53:52,301 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:53:52,302 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:53:52,303 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:53:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:53:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:53:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:53:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:53:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:53:53,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:53:53,189 INFO L283 CfgBuilder]: Removed 11 assume(true) statements. [2019-09-08 06:53:53,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:53:53 BoogieIcfgContainer [2019-09-08 06:53:53,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:53:53,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:53:53,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:53:53,195 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:53:53,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:53:51" (1/3) ... [2019-09-08 06:53:53,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f80dced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:53:53, skipping insertion in model container [2019-09-08 06:53:53,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:53:52" (2/3) ... [2019-09-08 06:53:53,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f80dced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:53:53, skipping insertion in model container [2019-09-08 06:53:53,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:53:53" (3/3) ... [2019-09-08 06:53:53,200 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.07.cil.c [2019-09-08 06:53:53,211 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:53:53,233 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:53:53,250 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:53:53,296 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:53:53,297 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:53:53,297 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:53:53,297 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:53:53,297 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:53:53,297 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:53:53,298 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:53:53,298 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:53:53,298 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:53:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states. [2019-09-08 06:53:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:53,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:53,337 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] [2019-09-08 06:53:53,339 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1158593114, now seen corresponding path program 1 times [2019-09-08 06:53:53,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:53,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:53,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:53,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:53,821 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:53:53,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:53:53,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:53:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:53:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:53:53,846 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 4 states. [2019-09-08 06:53:54,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:54,178 INFO L93 Difference]: Finished difference Result 621 states and 941 transitions. [2019-09-08 06:53:54,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:53:54,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 06:53:54,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:54,196 INFO L225 Difference]: With dead ends: 621 [2019-09-08 06:53:54,197 INFO L226 Difference]: Without dead ends: 310 [2019-09-08 06:53:54,203 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:53:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-09-08 06:53:54,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2019-09-08 06:53:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 442 transitions. [2019-09-08 06:53:54,288 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 442 transitions. Word has length 165 [2019-09-08 06:53:54,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:54,289 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 442 transitions. [2019-09-08 06:53:54,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:53:54,290 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 442 transitions. [2019-09-08 06:53:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:54,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:54,295 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] [2019-09-08 06:53:54,295 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:54,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:54,296 INFO L82 PathProgramCache]: Analyzing trace with hash 772730712, now seen corresponding path program 1 times [2019-09-08 06:53:54,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:54,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:54,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:54,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:54,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:54,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:53:54,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:54,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:54,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:54,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:54,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:54,536 INFO L87 Difference]: Start difference. First operand 310 states and 442 transitions. Second operand 5 states. [2019-09-08 06:53:55,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:55,323 INFO L93 Difference]: Finished difference Result 643 states and 941 transitions. [2019-09-08 06:53:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:55,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:55,328 INFO L225 Difference]: With dead ends: 643 [2019-09-08 06:53:55,328 INFO L226 Difference]: Without dead ends: 358 [2019-09-08 06:53:55,331 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:53:55,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-09-08 06:53:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 310. [2019-09-08 06:53:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 441 transitions. [2019-09-08 06:53:55,369 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 441 transitions. Word has length 165 [2019-09-08 06:53:55,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:55,370 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 441 transitions. [2019-09-08 06:53:55,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:55,370 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 441 transitions. [2019-09-08 06:53:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:55,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:55,373 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] [2019-09-08 06:53:55,374 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:55,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:55,374 INFO L82 PathProgramCache]: Analyzing trace with hash 842378586, now seen corresponding path program 1 times [2019-09-08 06:53:55,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:55,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:55,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:55,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:55,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:55,565 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:53:55,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:55,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:55,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:55,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:55,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:55,569 INFO L87 Difference]: Start difference. First operand 310 states and 441 transitions. Second operand 5 states. [2019-09-08 06:53:56,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:56,211 INFO L93 Difference]: Finished difference Result 641 states and 935 transitions. [2019-09-08 06:53:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:56,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:56,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:56,217 INFO L225 Difference]: With dead ends: 641 [2019-09-08 06:53:56,218 INFO L226 Difference]: Without dead ends: 356 [2019-09-08 06:53:56,219 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:53:56,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-08 06:53:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 310. [2019-09-08 06:53:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:56,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 440 transitions. [2019-09-08 06:53:56,256 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 440 transitions. Word has length 165 [2019-09-08 06:53:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:56,256 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 440 transitions. [2019-09-08 06:53:56,256 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 440 transitions. [2019-09-08 06:53:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:56,259 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:56,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:53:56,260 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1260267288, now seen corresponding path program 1 times [2019-09-08 06:53:56,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:56,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:56,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:56,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:56,382 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:53:56,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:56,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:56,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:56,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:56,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:56,385 INFO L87 Difference]: Start difference. First operand 310 states and 440 transitions. Second operand 5 states. [2019-09-08 06:53:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:56,948 INFO L93 Difference]: Finished difference Result 639 states and 929 transitions. [2019-09-08 06:53:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:56,949 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:56,952 INFO L225 Difference]: With dead ends: 639 [2019-09-08 06:53:56,952 INFO L226 Difference]: Without dead ends: 354 [2019-09-08 06:53:56,954 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:53:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-09-08 06:53:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 310. [2019-09-08 06:53:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 439 transitions. [2019-09-08 06:53:56,979 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 439 transitions. Word has length 165 [2019-09-08 06:53:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:56,980 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 439 transitions. [2019-09-08 06:53:56,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 439 transitions. [2019-09-08 06:53:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:56,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:56,983 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] [2019-09-08 06:53:56,983 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:56,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1635746406, now seen corresponding path program 1 times [2019-09-08 06:53:56,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:56,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:56,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:56,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:56,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:57,081 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:53:57,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:57,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:57,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:57,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:57,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:57,084 INFO L87 Difference]: Start difference. First operand 310 states and 439 transitions. Second operand 5 states. [2019-09-08 06:53:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:57,704 INFO L93 Difference]: Finished difference Result 637 states and 923 transitions. [2019-09-08 06:53:57,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:57,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:57,709 INFO L225 Difference]: With dead ends: 637 [2019-09-08 06:53:57,709 INFO L226 Difference]: Without dead ends: 352 [2019-09-08 06:53:57,711 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:53:57,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-09-08 06:53:57,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 310. [2019-09-08 06:53:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 438 transitions. [2019-09-08 06:53:57,759 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 438 transitions. Word has length 165 [2019-09-08 06:53:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:57,761 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 438 transitions. [2019-09-08 06:53:57,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:57,772 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 438 transitions. [2019-09-08 06:53:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:57,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:57,779 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] [2019-09-08 06:53:57,779 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1041780440, now seen corresponding path program 1 times [2019-09-08 06:53:57,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:57,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:57,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:57,940 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:53:57,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:57,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:57,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:57,943 INFO L87 Difference]: Start difference. First operand 310 states and 438 transitions. Second operand 5 states. [2019-09-08 06:53:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:58,540 INFO L93 Difference]: Finished difference Result 635 states and 917 transitions. [2019-09-08 06:53:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:58,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:58,543 INFO L225 Difference]: With dead ends: 635 [2019-09-08 06:53:58,544 INFO L226 Difference]: Without dead ends: 350 [2019-09-08 06:53:58,545 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:53:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-08 06:53:58,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 310. [2019-09-08 06:53:58,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2019-09-08 06:53:58,568 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 165 [2019-09-08 06:53:58,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:58,569 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2019-09-08 06:53:58,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2019-09-08 06:53:58,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:58,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:58,571 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] [2019-09-08 06:53:58,572 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:58,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1405246938, now seen corresponding path program 1 times [2019-09-08 06:53:58,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:58,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:58,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:58,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:58,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:58,649 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:53:58,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:58,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:58,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:58,650 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand 5 states. [2019-09-08 06:53:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:53:59,236 INFO L93 Difference]: Finished difference Result 633 states and 911 transitions. [2019-09-08 06:53:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:53:59,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:53:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:53:59,240 INFO L225 Difference]: With dead ends: 633 [2019-09-08 06:53:59,240 INFO L226 Difference]: Without dead ends: 348 [2019-09-08 06:53:59,242 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:53:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-08 06:53:59,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 310. [2019-09-08 06:53:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:53:59,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 436 transitions. [2019-09-08 06:53:59,266 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 436 transitions. Word has length 165 [2019-09-08 06:53:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:59,266 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 436 transitions. [2019-09-08 06:53:59,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:53:59,266 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 436 transitions. [2019-09-08 06:53:59,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:53:59,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:59,269 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:53:59,270 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:59,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:59,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1694066328, now seen corresponding path program 1 times [2019-09-08 06:53:59,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:59,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:59,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:59,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:59,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:59,390 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:53:59,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:53:59,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:53:59,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:53:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:53:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:53:59,392 INFO L87 Difference]: Start difference. First operand 310 states and 436 transitions. Second operand 5 states. [2019-09-08 06:54:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:00,003 INFO L93 Difference]: Finished difference Result 631 states and 905 transitions. [2019-09-08 06:54:00,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:00,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:00,007 INFO L225 Difference]: With dead ends: 631 [2019-09-08 06:54:00,008 INFO L226 Difference]: Without dead ends: 346 [2019-09-08 06:54:00,009 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:00,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-08 06:54:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 310. [2019-09-08 06:54:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 435 transitions. [2019-09-08 06:54:00,039 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 435 transitions. Word has length 165 [2019-09-08 06:54:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 435 transitions. [2019-09-08 06:54:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 435 transitions. [2019-09-08 06:54:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:00,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:00,043 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] [2019-09-08 06:54:00,043 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:00,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:00,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1149193754, now seen corresponding path program 1 times [2019-09-08 06:54:00,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:00,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:00,145 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:00,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:00,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:00,152 INFO L87 Difference]: Start difference. First operand 310 states and 435 transitions. Second operand 5 states. [2019-09-08 06:54:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:00,905 INFO L93 Difference]: Finished difference Result 661 states and 957 transitions. [2019-09-08 06:54:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:00,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:00,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:00,914 INFO L225 Difference]: With dead ends: 661 [2019-09-08 06:54:00,914 INFO L226 Difference]: Without dead ends: 376 [2019-09-08 06:54:00,917 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:00,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-08 06:54:00,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 310. [2019-09-08 06:54:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 434 transitions. [2019-09-08 06:54:00,957 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 434 transitions. Word has length 165 [2019-09-08 06:54:00,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:00,958 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 434 transitions. [2019-09-08 06:54:00,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:00,958 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 434 transitions. [2019-09-08 06:54:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:00,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:00,960 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] [2019-09-08 06:54:00,960 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:00,961 INFO L82 PathProgramCache]: Analyzing trace with hash 201141788, now seen corresponding path program 1 times [2019-09-08 06:54:00,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:00,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:00,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:00,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:01,072 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:01,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:01,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:01,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:01,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:01,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:01,074 INFO L87 Difference]: Start difference. First operand 310 states and 434 transitions. Second operand 5 states. [2019-09-08 06:54:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:01,639 INFO L93 Difference]: Finished difference Result 659 states and 951 transitions. [2019-09-08 06:54:01,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:01,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:01,643 INFO L225 Difference]: With dead ends: 659 [2019-09-08 06:54:01,644 INFO L226 Difference]: Without dead ends: 374 [2019-09-08 06:54:01,645 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:01,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-09-08 06:54:01,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 310. [2019-09-08 06:54:01,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:01,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 433 transitions. [2019-09-08 06:54:01,673 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 433 transitions. Word has length 165 [2019-09-08 06:54:01,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:01,673 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 433 transitions. [2019-09-08 06:54:01,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 433 transitions. [2019-09-08 06:54:01,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:01,676 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:01,676 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] [2019-09-08 06:54:01,676 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:01,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:01,676 INFO L82 PathProgramCache]: Analyzing trace with hash -383629862, now seen corresponding path program 1 times [2019-09-08 06:54:01,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:01,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:01,771 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:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:01,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:01,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:01,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:01,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:01,773 INFO L87 Difference]: Start difference. First operand 310 states and 433 transitions. Second operand 5 states. [2019-09-08 06:54:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:02,473 INFO L93 Difference]: Finished difference Result 657 states and 945 transitions. [2019-09-08 06:54:02,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:02,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:02,477 INFO L225 Difference]: With dead ends: 657 [2019-09-08 06:54:02,477 INFO L226 Difference]: Without dead ends: 372 [2019-09-08 06:54:02,478 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:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-09-08 06:54:02,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 310. [2019-09-08 06:54:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 432 transitions. [2019-09-08 06:54:02,508 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 432 transitions. Word has length 165 [2019-09-08 06:54:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:02,508 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 432 transitions. [2019-09-08 06:54:02,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:02,509 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 432 transitions. [2019-09-08 06:54:02,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:02,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:02,511 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] [2019-09-08 06:54:02,511 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:02,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash -818135460, now seen corresponding path program 1 times [2019-09-08 06:54:02,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:02,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:02,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:02,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:02,592 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:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:02,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:02,594 INFO L87 Difference]: Start difference. First operand 310 states and 432 transitions. Second operand 5 states. [2019-09-08 06:54:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:03,423 INFO L93 Difference]: Finished difference Result 655 states and 939 transitions. [2019-09-08 06:54:03,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:03,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:03,427 INFO L225 Difference]: With dead ends: 655 [2019-09-08 06:54:03,427 INFO L226 Difference]: Without dead ends: 370 [2019-09-08 06:54:03,429 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:03,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-09-08 06:54:03,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 310. [2019-09-08 06:54:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 431 transitions. [2019-09-08 06:54:03,456 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 431 transitions. Word has length 165 [2019-09-08 06:54:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:03,457 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 431 transitions. [2019-09-08 06:54:03,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 431 transitions. [2019-09-08 06:54:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:03,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:03,460 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] [2019-09-08 06:54:03,460 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:03,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1247793766, now seen corresponding path program 1 times [2019-09-08 06:54:03,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:03,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:03,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:03,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:03,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:03,549 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:03,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:03,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:03,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:03,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:03,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:03,552 INFO L87 Difference]: Start difference. First operand 310 states and 431 transitions. Second operand 5 states. [2019-09-08 06:54:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:04,284 INFO L93 Difference]: Finished difference Result 653 states and 933 transitions. [2019-09-08 06:54:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:04,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:04,288 INFO L225 Difference]: With dead ends: 653 [2019-09-08 06:54:04,288 INFO L226 Difference]: Without dead ends: 368 [2019-09-08 06:54:04,290 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:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-09-08 06:54:04,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 310. [2019-09-08 06:54:04,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:04,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 430 transitions. [2019-09-08 06:54:04,320 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 430 transitions. Word has length 165 [2019-09-08 06:54:04,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:04,320 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 430 transitions. [2019-09-08 06:54:04,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 430 transitions. [2019-09-08 06:54:04,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:04,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:04,324 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] [2019-09-08 06:54:04,324 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:04,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:04,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1954390372, now seen corresponding path program 1 times [2019-09-08 06:54:04,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:04,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:04,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:04,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:04,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:04,398 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:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:04,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:04,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:04,400 INFO L87 Difference]: Start difference. First operand 310 states and 430 transitions. Second operand 5 states. [2019-09-08 06:54:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:05,037 INFO L93 Difference]: Finished difference Result 651 states and 927 transitions. [2019-09-08 06:54:05,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:05,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-09-08 06:54:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:05,041 INFO L225 Difference]: With dead ends: 651 [2019-09-08 06:54:05,042 INFO L226 Difference]: Without dead ends: 366 [2019-09-08 06:54:05,044 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:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-08 06:54:05,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 310. [2019-09-08 06:54:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-09-08 06:54:05,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 429 transitions. [2019-09-08 06:54:05,075 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 429 transitions. Word has length 165 [2019-09-08 06:54:05,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:05,075 INFO L475 AbstractCegarLoop]: Abstraction has 310 states and 429 transitions. [2019-09-08 06:54:05,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:05,076 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 429 transitions. [2019-09-08 06:54:05,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:05,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:05,078 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] [2019-09-08 06:54:05,078 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:05,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:05,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1007352486, now seen corresponding path program 1 times [2019-09-08 06:54:05,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:05,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:05,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:05,149 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:05,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:05,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:05,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:05,151 INFO L87 Difference]: Start difference. First operand 310 states and 429 transitions. Second operand 6 states. [2019-09-08 06:54:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:05,222 INFO L93 Difference]: Finished difference Result 622 states and 887 transitions. [2019-09-08 06:54:05,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:05,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:05,225 INFO L225 Difference]: With dead ends: 622 [2019-09-08 06:54:05,226 INFO L226 Difference]: Without dead ends: 338 [2019-09-08 06:54:05,229 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:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-09-08 06:54:05,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 315. [2019-09-08 06:54:05,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-09-08 06:54:05,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 434 transitions. [2019-09-08 06:54:05,271 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 434 transitions. Word has length 165 [2019-09-08 06:54:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:05,272 INFO L475 AbstractCegarLoop]: Abstraction has 315 states and 434 transitions. [2019-09-08 06:54:05,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 434 transitions. [2019-09-08 06:54:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:05,276 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:05,276 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] [2019-09-08 06:54:05,276 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:05,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:05,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1640251868, now seen corresponding path program 1 times [2019-09-08 06:54:05,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:05,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:05,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:05,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:05,420 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:05,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:05,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:05,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:05,424 INFO L87 Difference]: Start difference. First operand 315 states and 434 transitions. Second operand 4 states. [2019-09-08 06:54:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:05,754 INFO L93 Difference]: Finished difference Result 886 states and 1260 transitions. [2019-09-08 06:54:05,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:05,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 06:54:05,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:05,758 INFO L225 Difference]: With dead ends: 886 [2019-09-08 06:54:05,758 INFO L226 Difference]: Without dead ends: 597 [2019-09-08 06:54:05,760 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:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-09-08 06:54:05,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592. [2019-09-08 06:54:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-08 06:54:05,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 815 transitions. [2019-09-08 06:54:05,845 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 815 transitions. Word has length 165 [2019-09-08 06:54:05,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:05,845 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 815 transitions. [2019-09-08 06:54:05,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:05,846 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 815 transitions. [2019-09-08 06:54:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:05,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:05,849 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] [2019-09-08 06:54:05,850 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:05,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:05,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1193493499, now seen corresponding path program 1 times [2019-09-08 06:54:05,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:05,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:05,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:05,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:54:05,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:05,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:05,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:05,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:05,949 INFO L87 Difference]: Start difference. First operand 592 states and 815 transitions. Second operand 6 states. [2019-09-08 06:54:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:06,032 INFO L93 Difference]: Finished difference Result 1183 states and 1670 transitions. [2019-09-08 06:54:06,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:06,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:06,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:06,037 INFO L225 Difference]: With dead ends: 1183 [2019-09-08 06:54:06,037 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 06:54:06,040 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:06,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 06:54:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 597. [2019-09-08 06:54:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 06:54:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 819 transitions. [2019-09-08 06:54:06,104 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 819 transitions. Word has length 165 [2019-09-08 06:54:06,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:06,105 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 819 transitions. [2019-09-08 06:54:06,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 819 transitions. [2019-09-08 06:54:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:06,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:06,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:06,107 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:06,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:06,108 INFO L82 PathProgramCache]: Analyzing trace with hash -673215175, now seen corresponding path program 1 times [2019-09-08 06:54:06,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:06,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:06,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:06,179 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:06,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:06,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:06,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:06,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:06,182 INFO L87 Difference]: Start difference. First operand 597 states and 819 transitions. Second operand 6 states. [2019-09-08 06:54:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:06,259 INFO L93 Difference]: Finished difference Result 1212 states and 1709 transitions. [2019-09-08 06:54:06,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:06,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:06,265 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 06:54:06,265 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 06:54:06,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:54:06,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 06:54:06,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 607. [2019-09-08 06:54:06,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-09-08 06:54:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 829 transitions. [2019-09-08 06:54:06,339 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 829 transitions. Word has length 165 [2019-09-08 06:54:06,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:06,339 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 829 transitions. [2019-09-08 06:54:06,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:06,339 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 829 transitions. [2019-09-08 06:54:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:06,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:06,342 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] [2019-09-08 06:54:06,342 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1556724165, now seen corresponding path program 1 times [2019-09-08 06:54:06,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:06,414 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:06,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:06,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:06,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:06,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:06,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:06,416 INFO L87 Difference]: Start difference. First operand 607 states and 829 transitions. Second operand 6 states. [2019-09-08 06:54:06,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:06,531 INFO L93 Difference]: Finished difference Result 1226 states and 1719 transitions. [2019-09-08 06:54:06,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:06,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:06,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:06,537 INFO L225 Difference]: With dead ends: 1226 [2019-09-08 06:54:06,538 INFO L226 Difference]: Without dead ends: 645 [2019-09-08 06:54:06,541 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:06,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-09-08 06:54:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 617. [2019-09-08 06:54:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-09-08 06:54:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 839 transitions. [2019-09-08 06:54:06,603 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 839 transitions. Word has length 165 [2019-09-08 06:54:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:06,605 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 839 transitions. [2019-09-08 06:54:06,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 839 transitions. [2019-09-08 06:54:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:06,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:06,607 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] [2019-09-08 06:54:06,608 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:06,608 INFO L82 PathProgramCache]: Analyzing trace with hash 859112185, now seen corresponding path program 1 times [2019-09-08 06:54:06,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:06,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:06,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:06,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:54:06,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:06,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:06,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:06,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:06,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:06,698 INFO L87 Difference]: Start difference. First operand 617 states and 839 transitions. Second operand 4 states. [2019-09-08 06:54:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:07,157 INFO L93 Difference]: Finished difference Result 1786 states and 2505 transitions. [2019-09-08 06:54:07,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:07,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 06:54:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:07,166 INFO L225 Difference]: With dead ends: 1786 [2019-09-08 06:54:07,167 INFO L226 Difference]: Without dead ends: 1195 [2019-09-08 06:54:07,170 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:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-09-08 06:54:07,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1188. [2019-09-08 06:54:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1188 states. [2019-09-08 06:54:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1613 transitions. [2019-09-08 06:54:07,300 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1613 transitions. Word has length 165 [2019-09-08 06:54:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:07,301 INFO L475 AbstractCegarLoop]: Abstraction has 1188 states and 1613 transitions. [2019-09-08 06:54:07,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1613 transitions. [2019-09-08 06:54:07,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:07,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:07,304 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] [2019-09-08 06:54:07,304 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:07,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:07,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1975861190, now seen corresponding path program 1 times [2019-09-08 06:54:07,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:07,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:07,383 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:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:07,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:07,385 INFO L87 Difference]: Start difference. First operand 1188 states and 1613 transitions. Second operand 6 states. [2019-09-08 06:54:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:07,528 INFO L93 Difference]: Finished difference Result 2382 states and 3310 transitions. [2019-09-08 06:54:07,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:07,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:07,539 INFO L225 Difference]: With dead ends: 2382 [2019-09-08 06:54:07,539 INFO L226 Difference]: Without dead ends: 1220 [2019-09-08 06:54:07,544 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:07,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2019-09-08 06:54:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1198. [2019-09-08 06:54:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2019-09-08 06:54:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1621 transitions. [2019-09-08 06:54:07,679 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1621 transitions. Word has length 165 [2019-09-08 06:54:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:07,679 INFO L475 AbstractCegarLoop]: Abstraction has 1198 states and 1621 transitions. [2019-09-08 06:54:07,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1621 transitions. [2019-09-08 06:54:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:07,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:07,682 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:07,682 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -241756740, now seen corresponding path program 1 times [2019-09-08 06:54:07,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:07,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:07,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:07,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:07,785 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:07,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:07,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:07,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:07,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:07,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:07,787 INFO L87 Difference]: Start difference. First operand 1198 states and 1621 transitions. Second operand 6 states. [2019-09-08 06:54:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:07,968 INFO L93 Difference]: Finished difference Result 2422 states and 3357 transitions. [2019-09-08 06:54:07,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:07,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:07,977 INFO L225 Difference]: With dead ends: 2422 [2019-09-08 06:54:07,977 INFO L226 Difference]: Without dead ends: 1250 [2019-09-08 06:54:07,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:54:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-09-08 06:54:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1218. [2019-09-08 06:54:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1218 states. [2019-09-08 06:54:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1641 transitions. [2019-09-08 06:54:08,097 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1641 transitions. Word has length 165 [2019-09-08 06:54:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:08,098 INFO L475 AbstractCegarLoop]: Abstraction has 1218 states and 1641 transitions. [2019-09-08 06:54:08,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1641 transitions. [2019-09-08 06:54:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:08,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:08,101 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] [2019-09-08 06:54:08,101 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:08,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:08,101 INFO L82 PathProgramCache]: Analyzing trace with hash -973724166, now seen corresponding path program 1 times [2019-09-08 06:54:08,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:08,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:08,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:08,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:08,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:08,168 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:08,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:08,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:08,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:08,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:08,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:08,169 INFO L87 Difference]: Start difference. First operand 1218 states and 1641 transitions. Second operand 4 states. [2019-09-08 06:54:08,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:08,610 INFO L93 Difference]: Finished difference Result 3577 states and 4973 transitions. [2019-09-08 06:54:08,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:08,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 06:54:08,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:08,626 INFO L225 Difference]: With dead ends: 3577 [2019-09-08 06:54:08,627 INFO L226 Difference]: Without dead ends: 2385 [2019-09-08 06:54:08,634 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:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-09-08 06:54:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 2374. [2019-09-08 06:54:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-09-08 06:54:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3195 transitions. [2019-09-08 06:54:08,852 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3195 transitions. Word has length 165 [2019-09-08 06:54:08,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:08,853 INFO L475 AbstractCegarLoop]: Abstraction has 2374 states and 3195 transitions. [2019-09-08 06:54:08,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3195 transitions. [2019-09-08 06:54:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:08,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:08,855 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] [2019-09-08 06:54:08,856 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:08,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash -396795525, now seen corresponding path program 1 times [2019-09-08 06:54:08,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:08,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:08,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:08,975 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:08,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:08,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:08,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:08,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:08,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:08,977 INFO L87 Difference]: Start difference. First operand 2374 states and 3195 transitions. Second operand 6 states. [2019-09-08 06:54:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:09,194 INFO L93 Difference]: Finished difference Result 4762 states and 6554 transitions. [2019-09-08 06:54:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:09,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-09-08 06:54:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:09,212 INFO L225 Difference]: With dead ends: 4762 [2019-09-08 06:54:09,212 INFO L226 Difference]: Without dead ends: 2414 [2019-09-08 06:54:09,226 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:09,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-09-08 06:54:09,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2394. [2019-09-08 06:54:09,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2394 states. [2019-09-08 06:54:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2394 states to 2394 states and 3211 transitions. [2019-09-08 06:54:09,437 INFO L78 Accepts]: Start accepts. Automaton has 2394 states and 3211 transitions. Word has length 165 [2019-09-08 06:54:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:09,437 INFO L475 AbstractCegarLoop]: Abstraction has 2394 states and 3211 transitions. [2019-09-08 06:54:09,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:09,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2394 states and 3211 transitions. [2019-09-08 06:54:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 06:54:09,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:09,439 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] [2019-09-08 06:54:09,439 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:09,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:09,440 INFO L82 PathProgramCache]: Analyzing trace with hash 864121725, now seen corresponding path program 1 times [2019-09-08 06:54:09,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:09,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:09,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:09,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:09,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:09,523 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:09,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:09,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:54:09,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:54:09,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:54:09,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:54:09,525 INFO L87 Difference]: Start difference. First operand 2394 states and 3211 transitions. Second operand 4 states. [2019-09-08 06:54:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:10,155 INFO L93 Difference]: Finished difference Result 7086 states and 9839 transitions. [2019-09-08 06:54:10,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:54:10,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-09-08 06:54:10,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:10,188 INFO L225 Difference]: With dead ends: 7086 [2019-09-08 06:54:10,188 INFO L226 Difference]: Without dead ends: 4718 [2019-09-08 06:54:10,252 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:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4718 states. [2019-09-08 06:54:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4718 to 4697. [2019-09-08 06:54:10,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4697 states. [2019-09-08 06:54:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4697 states to 4697 states and 6300 transitions. [2019-09-08 06:54:10,682 INFO L78 Accepts]: Start accepts. Automaton has 4697 states and 6300 transitions. Word has length 165 [2019-09-08 06:54:10,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:10,682 INFO L475 AbstractCegarLoop]: Abstraction has 4697 states and 6300 transitions. [2019-09-08 06:54:10,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:54:10,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4697 states and 6300 transitions. [2019-09-08 06:54:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:10,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:10,688 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:10,689 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2051423794, now seen corresponding path program 1 times [2019-09-08 06:54:10,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:10,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:10,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:10,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:10,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:54:10,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:54:10,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:54:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:54:10,782 INFO L87 Difference]: Start difference. First operand 4697 states and 6300 transitions. Second operand 6 states. [2019-09-08 06:54:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:11,170 INFO L93 Difference]: Finished difference Result 9424 states and 12950 transitions. [2019-09-08 06:54:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:11,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 189 [2019-09-08 06:54:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:11,210 INFO L225 Difference]: With dead ends: 9424 [2019-09-08 06:54:11,210 INFO L226 Difference]: Without dead ends: 4753 [2019-09-08 06:54:11,232 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:11,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2019-09-08 06:54:11,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 4737. [2019-09-08 06:54:11,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4737 states. [2019-09-08 06:54:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4737 states to 4737 states and 6332 transitions. [2019-09-08 06:54:11,723 INFO L78 Accepts]: Start accepts. Automaton has 4737 states and 6332 transitions. Word has length 189 [2019-09-08 06:54:11,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:11,724 INFO L475 AbstractCegarLoop]: Abstraction has 4737 states and 6332 transitions. [2019-09-08 06:54:11,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:54:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4737 states and 6332 transitions. [2019-09-08 06:54:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:11,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:11,729 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:11,729 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2128324592, now seen corresponding path program 1 times [2019-09-08 06:54:11,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:11,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:11,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:11,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:11,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:11,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:11,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:11,835 INFO L87 Difference]: Start difference. First operand 4737 states and 6332 transitions. Second operand 5 states. [2019-09-08 06:54:13,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:13,763 INFO L93 Difference]: Finished difference Result 13771 states and 18676 transitions. [2019-09-08 06:54:13,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:54:13,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:13,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:13,816 INFO L225 Difference]: With dead ends: 13771 [2019-09-08 06:54:13,816 INFO L226 Difference]: Without dead ends: 9060 [2019-09-08 06:54:13,858 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:13,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9060 states. [2019-09-08 06:54:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9060 to 7283. [2019-09-08 06:54:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2019-09-08 06:54:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9651 transitions. [2019-09-08 06:54:14,626 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9651 transitions. Word has length 189 [2019-09-08 06:54:14,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:14,627 INFO L475 AbstractCegarLoop]: Abstraction has 7283 states and 9651 transitions. [2019-09-08 06:54:14,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:14,627 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9651 transitions. [2019-09-08 06:54:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:14,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:14,633 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:14,633 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:14,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1212702546, now seen corresponding path program 1 times [2019-09-08 06:54:14,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:14,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:14,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:14,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:14,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:14,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:14,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:14,720 INFO L87 Difference]: Start difference. First operand 7283 states and 9651 transitions. Second operand 5 states. [2019-09-08 06:54:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:15,927 INFO L93 Difference]: Finished difference Result 14537 states and 19356 transitions. [2019-09-08 06:54:15,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:15,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:15,993 INFO L225 Difference]: With dead ends: 14537 [2019-09-08 06:54:15,993 INFO L226 Difference]: Without dead ends: 7283 [2019-09-08 06:54:16,019 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:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2019-09-08 06:54:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 7283. [2019-09-08 06:54:16,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2019-09-08 06:54:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9587 transitions. [2019-09-08 06:54:16,665 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9587 transitions. Word has length 189 [2019-09-08 06:54:16,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:16,666 INFO L475 AbstractCegarLoop]: Abstraction has 7283 states and 9587 transitions. [2019-09-08 06:54:16,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9587 transitions. [2019-09-08 06:54:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:16,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:16,671 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:16,671 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1866111024, now seen corresponding path program 1 times [2019-09-08 06:54:16,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:16,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:16,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:16,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:16,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:16,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:16,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:16,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:16,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:16,796 INFO L87 Difference]: Start difference. First operand 7283 states and 9587 transitions. Second operand 5 states. [2019-09-08 06:54:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:18,229 INFO L93 Difference]: Finished difference Result 14537 states and 19228 transitions. [2019-09-08 06:54:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:18,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:18,258 INFO L225 Difference]: With dead ends: 14537 [2019-09-08 06:54:18,258 INFO L226 Difference]: Without dead ends: 7283 [2019-09-08 06:54:18,274 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:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2019-09-08 06:54:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 7283. [2019-09-08 06:54:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2019-09-08 06:54:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9523 transitions. [2019-09-08 06:54:18,915 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9523 transitions. Word has length 189 [2019-09-08 06:54:18,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:18,915 INFO L475 AbstractCegarLoop]: Abstraction has 7283 states and 9523 transitions. [2019-09-08 06:54:18,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9523 transitions. [2019-09-08 06:54:18,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:18,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:18,921 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:18,921 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:18,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1134143598, now seen corresponding path program 1 times [2019-09-08 06:54:18,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:18,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:18,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:18,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:18,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:19,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:19,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:19,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:19,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:19,106 INFO L87 Difference]: Start difference. First operand 7283 states and 9523 transitions. Second operand 5 states. [2019-09-08 06:54:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:20,042 INFO L93 Difference]: Finished difference Result 14537 states and 19100 transitions. [2019-09-08 06:54:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:20,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:20,073 INFO L225 Difference]: With dead ends: 14537 [2019-09-08 06:54:20,073 INFO L226 Difference]: Without dead ends: 7283 [2019-09-08 06:54:20,091 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:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2019-09-08 06:54:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 7283. [2019-09-08 06:54:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2019-09-08 06:54:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 9459 transitions. [2019-09-08 06:54:20,641 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 9459 transitions. Word has length 189 [2019-09-08 06:54:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:20,642 INFO L475 AbstractCegarLoop]: Abstraction has 7283 states and 9459 transitions. [2019-09-08 06:54:20,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 9459 transitions. [2019-09-08 06:54:20,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 06:54:20,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:20,647 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:20,647 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:20,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:20,648 INFO L82 PathProgramCache]: Analyzing trace with hash 937239418, now seen corresponding path program 1 times [2019-09-08 06:54:20,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:20,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:20,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:20,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:20,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:20,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:20,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:20,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:20,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:20,747 INFO L87 Difference]: Start difference. First operand 7283 states and 9459 transitions. Second operand 5 states. [2019-09-08 06:54:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:21,795 INFO L93 Difference]: Finished difference Result 14234 states and 18556 transitions. [2019-09-08 06:54:21,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:21,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-09-08 06:54:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:21,820 INFO L225 Difference]: With dead ends: 14234 [2019-09-08 06:54:21,821 INFO L226 Difference]: Without dead ends: 6977 [2019-09-08 06:54:21,835 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:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6977 states. [2019-09-08 06:54:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6977 to 6721. [2019-09-08 06:54:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6721 states. [2019-09-08 06:54:22,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 8620 transitions. [2019-09-08 06:54:22,338 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 8620 transitions. Word has length 190 [2019-09-08 06:54:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:22,338 INFO L475 AbstractCegarLoop]: Abstraction has 6721 states and 8620 transitions. [2019-09-08 06:54:22,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 8620 transitions. [2019-09-08 06:54:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:22,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:22,343 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:22,343 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:22,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -552036240, now seen corresponding path program 1 times [2019-09-08 06:54:22,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:22,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:22,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:22,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:22,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:22,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:22,425 INFO L87 Difference]: Start difference. First operand 6721 states and 8620 transitions. Second operand 5 states. [2019-09-08 06:54:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:23,481 INFO L93 Difference]: Finished difference Result 13415 states and 17267 transitions. [2019-09-08 06:54:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:23,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:23,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:23,509 INFO L225 Difference]: With dead ends: 13415 [2019-09-08 06:54:23,509 INFO L226 Difference]: Without dead ends: 6721 [2019-09-08 06:54:23,527 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:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2019-09-08 06:54:24,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6721. [2019-09-08 06:54:24,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6721 states. [2019-09-08 06:54:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 8572 transitions. [2019-09-08 06:54:24,479 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 8572 transitions. Word has length 189 [2019-09-08 06:54:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:24,480 INFO L475 AbstractCegarLoop]: Abstraction has 6721 states and 8572 transitions. [2019-09-08 06:54:24,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 8572 transitions. [2019-09-08 06:54:24,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:24,486 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:24,486 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:24,487 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:24,487 INFO L82 PathProgramCache]: Analyzing trace with hash -606429138, now seen corresponding path program 1 times [2019-09-08 06:54:24,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:24,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:24,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:24,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:24,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:24,639 INFO L87 Difference]: Start difference. First operand 6721 states and 8572 transitions. Second operand 5 states. [2019-09-08 06:54:26,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:26,508 INFO L93 Difference]: Finished difference Result 13415 states and 17171 transitions. [2019-09-08 06:54:26,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:26,508 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:26,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:26,531 INFO L225 Difference]: With dead ends: 13415 [2019-09-08 06:54:26,532 INFO L226 Difference]: Without dead ends: 6721 [2019-09-08 06:54:26,547 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:26,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2019-09-08 06:54:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6721. [2019-09-08 06:54:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6721 states. [2019-09-08 06:54:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 8524 transitions. [2019-09-08 06:54:27,505 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 8524 transitions. Word has length 189 [2019-09-08 06:54:27,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:27,506 INFO L475 AbstractCegarLoop]: Abstraction has 6721 states and 8524 transitions. [2019-09-08 06:54:27,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:27,506 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 8524 transitions. [2019-09-08 06:54:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:27,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:27,512 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:27,512 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1023825744, now seen corresponding path program 1 times [2019-09-08 06:54:27,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:27,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:27,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:27,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:27,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:27,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:27,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:27,652 INFO L87 Difference]: Start difference. First operand 6721 states and 8524 transitions. Second operand 5 states. [2019-09-08 06:54:29,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:29,040 INFO L93 Difference]: Finished difference Result 13415 states and 17075 transitions. [2019-09-08 06:54:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:54:29,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:29,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:29,059 INFO L225 Difference]: With dead ends: 13415 [2019-09-08 06:54:29,059 INFO L226 Difference]: Without dead ends: 6721 [2019-09-08 06:54:29,073 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:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6721 states. [2019-09-08 06:54:29,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6721 to 6721. [2019-09-08 06:54:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6721 states. [2019-09-08 06:54:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6721 states to 6721 states and 8476 transitions. [2019-09-08 06:54:29,794 INFO L78 Accepts]: Start accepts. Automaton has 6721 states and 8476 transitions. Word has length 189 [2019-09-08 06:54:29,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:29,794 INFO L475 AbstractCegarLoop]: Abstraction has 6721 states and 8476 transitions. [2019-09-08 06:54:29,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 6721 states and 8476 transitions. [2019-09-08 06:54:29,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:29,798 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:29,798 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:29,798 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash -344553490, now seen corresponding path program 1 times [2019-09-08 06:54:29,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:29,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:29,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:29,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:29,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:29,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:29,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:29,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:29,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:29,883 INFO L87 Difference]: Start difference. First operand 6721 states and 8476 transitions. Second operand 5 states. [2019-09-08 06:54:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:31,285 INFO L93 Difference]: Finished difference Result 16314 states and 21505 transitions. [2019-09-08 06:54:31,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:54:31,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:31,316 INFO L225 Difference]: With dead ends: 16314 [2019-09-08 06:54:31,316 INFO L226 Difference]: Without dead ends: 9620 [2019-09-08 06:54:31,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 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:31,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9620 states. [2019-09-08 06:54:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9620 to 8771. [2019-09-08 06:54:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8771 states. [2019-09-08 06:54:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8771 states to 8771 states and 10850 transitions. [2019-09-08 06:54:32,088 INFO L78 Accepts]: Start accepts. Automaton has 8771 states and 10850 transitions. Word has length 189 [2019-09-08 06:54:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:32,088 INFO L475 AbstractCegarLoop]: Abstraction has 8771 states and 10850 transitions. [2019-09-08 06:54:32,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 8771 states and 10850 transitions. [2019-09-08 06:54:32,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:32,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:32,092 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:32,092 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:32,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:32,093 INFO L82 PathProgramCache]: Analyzing trace with hash -142729556, now seen corresponding path program 1 times [2019-09-08 06:54:32,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:32,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:32,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:32,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:32,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:32,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:32,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:32,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:32,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:32,187 INFO L87 Difference]: Start difference. First operand 8771 states and 10850 transitions. Second operand 5 states. [2019-09-08 06:54:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:33,627 INFO L93 Difference]: Finished difference Result 19136 states and 24531 transitions. [2019-09-08 06:54:33,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:33,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:33,661 INFO L225 Difference]: With dead ends: 19136 [2019-09-08 06:54:33,661 INFO L226 Difference]: Without dead ends: 10392 [2019-09-08 06:54:33,685 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:54:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10392 states. [2019-09-08 06:54:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10392 to 9419. [2019-09-08 06:54:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9419 states. [2019-09-08 06:54:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9419 states to 9419 states and 11450 transitions. [2019-09-08 06:54:34,419 INFO L78 Accepts]: Start accepts. Automaton has 9419 states and 11450 transitions. Word has length 189 [2019-09-08 06:54:34,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:34,419 INFO L475 AbstractCegarLoop]: Abstraction has 9419 states and 11450 transitions. [2019-09-08 06:54:34,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 9419 states and 11450 transitions. [2019-09-08 06:54:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:34,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:34,423 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:34,423 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:34,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:34,423 INFO L82 PathProgramCache]: Analyzing trace with hash 417970222, now seen corresponding path program 1 times [2019-09-08 06:54:34,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:34,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:34,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:34,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:34,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:34,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:34,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:34,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:34,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:34,523 INFO L87 Difference]: Start difference. First operand 9419 states and 11450 transitions. Second operand 5 states. [2019-09-08 06:54:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:36,099 INFO L93 Difference]: Finished difference Result 21924 states and 28000 transitions. [2019-09-08 06:54:36,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:36,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:36,132 INFO L225 Difference]: With dead ends: 21924 [2019-09-08 06:54:36,132 INFO L226 Difference]: Without dead ends: 12532 [2019-09-08 06:54:36,152 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:54:36,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12532 states. [2019-09-08 06:54:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12532 to 10763. [2019-09-08 06:54:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10763 states. [2019-09-08 06:54:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10763 states to 10763 states and 12826 transitions. [2019-09-08 06:54:37,088 INFO L78 Accepts]: Start accepts. Automaton has 10763 states and 12826 transitions. Word has length 189 [2019-09-08 06:54:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:37,089 INFO L475 AbstractCegarLoop]: Abstraction has 10763 states and 12826 transitions. [2019-09-08 06:54:37,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 10763 states and 12826 transitions. [2019-09-08 06:54:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:37,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:37,093 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:37,093 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:37,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:37,093 INFO L82 PathProgramCache]: Analyzing trace with hash 851699308, now seen corresponding path program 1 times [2019-09-08 06:54:37,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:37,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:37,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:37,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:37,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:37,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:37,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:37,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:37,179 INFO L87 Difference]: Start difference. First operand 10763 states and 12826 transitions. Second operand 5 states. [2019-09-08 06:54:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:38,812 INFO L93 Difference]: Finished difference Result 23694 states and 29443 transitions. [2019-09-08 06:54:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:38,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:38,847 INFO L225 Difference]: With dead ends: 23694 [2019-09-08 06:54:38,847 INFO L226 Difference]: Without dead ends: 12960 [2019-09-08 06:54:38,866 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:54:38,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12960 states. [2019-09-08 06:54:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12960 to 12079. [2019-09-08 06:54:39,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-09-08 06:54:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 14158 transitions. [2019-09-08 06:54:39,827 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 14158 transitions. Word has length 189 [2019-09-08 06:54:39,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:39,828 INFO L475 AbstractCegarLoop]: Abstraction has 12079 states and 14158 transitions. [2019-09-08 06:54:39,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:39,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 14158 transitions. [2019-09-08 06:54:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:39,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:39,833 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:39,833 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:39,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:39,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2112616558, now seen corresponding path program 1 times [2019-09-08 06:54:39,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:39,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:39,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:39,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:39,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:39,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:39,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:39,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:39,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:39,921 INFO L87 Difference]: Start difference. First operand 12079 states and 14158 transitions. Second operand 5 states. [2019-09-08 06:54:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:41,478 INFO L93 Difference]: Finished difference Result 25116 states and 30511 transitions. [2019-09-08 06:54:41,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:41,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:41,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:41,519 INFO L225 Difference]: With dead ends: 25116 [2019-09-08 06:54:41,520 INFO L226 Difference]: Without dead ends: 13064 [2019-09-08 06:54:41,539 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:54:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13064 states. [2019-09-08 06:54:42,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13064 to 12427. [2019-09-08 06:54:42,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12427 states. [2019-09-08 06:54:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12427 states to 12427 states and 14338 transitions. [2019-09-08 06:54:42,608 INFO L78 Accepts]: Start accepts. Automaton has 12427 states and 14338 transitions. Word has length 189 [2019-09-08 06:54:42,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:42,609 INFO L475 AbstractCegarLoop]: Abstraction has 12427 states and 14338 transitions. [2019-09-08 06:54:42,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:42,609 INFO L276 IsEmpty]: Start isEmpty. Operand 12427 states and 14338 transitions. [2019-09-08 06:54:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:42,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:42,614 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:42,614 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:42,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2141675988, now seen corresponding path program 1 times [2019-09-08 06:54:42,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:42,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:42,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:42,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:42,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:42,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:42,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:42,697 INFO L87 Difference]: Start difference. First operand 12427 states and 14338 transitions. Second operand 5 states. [2019-09-08 06:54:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:44,414 INFO L93 Difference]: Finished difference Result 26834 states and 32251 transitions. [2019-09-08 06:54:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:44,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:44,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:44,469 INFO L225 Difference]: With dead ends: 26834 [2019-09-08 06:54:44,470 INFO L226 Difference]: Without dead ends: 14436 [2019-09-08 06:54:44,493 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:54:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14436 states. [2019-09-08 06:54:46,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14436 to 13551. [2019-09-08 06:54:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13551 states. [2019-09-08 06:54:46,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13551 states to 13551 states and 15398 transitions. [2019-09-08 06:54:46,288 INFO L78 Accepts]: Start accepts. Automaton has 13551 states and 15398 transitions. Word has length 189 [2019-09-08 06:54:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:46,288 INFO L475 AbstractCegarLoop]: Abstraction has 13551 states and 15398 transitions. [2019-09-08 06:54:46,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13551 states and 15398 transitions. [2019-09-08 06:54:46,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:46,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:46,291 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:46,291 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash -754890578, now seen corresponding path program 1 times [2019-09-08 06:54:46,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:54:46,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:46,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:54:46,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:54:46,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:54:46,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:54:46,372 INFO L87 Difference]: Start difference. First operand 13551 states and 15398 transitions. Second operand 5 states. [2019-09-08 06:54:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:48,146 INFO L93 Difference]: Finished difference Result 27898 states and 32517 transitions. [2019-09-08 06:54:48,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:54:48,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 189 [2019-09-08 06:54:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:48,189 INFO L225 Difference]: With dead ends: 27898 [2019-09-08 06:54:48,190 INFO L226 Difference]: Without dead ends: 14376 [2019-09-08 06:54:48,214 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:54:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14376 states. [2019-09-08 06:54:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14376 to 13967. [2019-09-08 06:54:49,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13967 states. [2019-09-08 06:54:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13967 states to 13967 states and 15666 transitions. [2019-09-08 06:54:49,492 INFO L78 Accepts]: Start accepts. Automaton has 13967 states and 15666 transitions. Word has length 189 [2019-09-08 06:54:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:49,493 INFO L475 AbstractCegarLoop]: Abstraction has 13967 states and 15666 transitions. [2019-09-08 06:54:49,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:54:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 13967 states and 15666 transitions. [2019-09-08 06:54:49,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 06:54:49,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:49,497 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:49,497 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:49,498 INFO L82 PathProgramCache]: Analyzing trace with hash 121128428, now seen corresponding path program 1 times [2019-09-08 06:54:49,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:49,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:49,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:49,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 06:54:49,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:54:49,563 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:54:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:49,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:54:49,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:54:49,800 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:54:49,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:54:49,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:54:49,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:54:49,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:54:49,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:54:49,809 INFO L87 Difference]: Start difference. First operand 13967 states and 15666 transitions. Second operand 3 states. [2019-09-08 06:54:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:51,644 INFO L93 Difference]: Finished difference Result 41491 states and 46834 transitions. [2019-09-08 06:54:51,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:54:51,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-09-08 06:54:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:51,735 INFO L225 Difference]: With dead ends: 41491 [2019-09-08 06:54:51,735 INFO L226 Difference]: Without dead ends: 27553 [2019-09-08 06:54:51,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 190 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:54:51,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27553 states. [2019-09-08 06:54:53,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27553 to 27547. [2019-09-08 06:54:53,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27547 states. [2019-09-08 06:54:53,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27547 states to 27547 states and 30949 transitions. [2019-09-08 06:54:53,914 INFO L78 Accepts]: Start accepts. Automaton has 27547 states and 30949 transitions. Word has length 189 [2019-09-08 06:54:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:54:53,914 INFO L475 AbstractCegarLoop]: Abstraction has 27547 states and 30949 transitions. [2019-09-08 06:54:53,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:54:53,915 INFO L276 IsEmpty]: Start isEmpty. Operand 27547 states and 30949 transitions. [2019-09-08 06:54:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 06:54:53,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:54:53,919 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:54:53,919 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:54:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:54:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 860924352, now seen corresponding path program 1 times [2019-09-08 06:54:53,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:54:53,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:54:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:53,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:54:53,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:54:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:54:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 06:54:53,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:54:53,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 06:54:53,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:54:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:54:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:54:53,992 INFO L87 Difference]: Start difference. First operand 27547 states and 30949 transitions. Second operand 3 states. [2019-09-08 06:54:58,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:58,505 INFO L93 Difference]: Finished difference Result 75936 states and 85836 transitions. [2019-09-08 06:54:58,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:54:58,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 191 [2019-09-08 06:54:58,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:58,581 INFO L225 Difference]: With dead ends: 75936 [2019-09-08 06:54:58,581 INFO L226 Difference]: Without dead ends: 34783 [2019-09-08 06:54:58,625 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:54:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34783 states. [2019-09-08 06:55:01,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34783 to 34783. [2019-09-08 06:55:01,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34783 states. [2019-09-08 06:55:01,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34783 states to 34783 states and 39172 transitions. [2019-09-08 06:55:01,122 INFO L78 Accepts]: Start accepts. Automaton has 34783 states and 39172 transitions. Word has length 191 [2019-09-08 06:55:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:01,123 INFO L475 AbstractCegarLoop]: Abstraction has 34783 states and 39172 transitions. [2019-09-08 06:55:01,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:55:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 34783 states and 39172 transitions. [2019-09-08 06:55:01,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 06:55:01,181 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:01,182 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:01,182 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:01,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:01,183 INFO L82 PathProgramCache]: Analyzing trace with hash -971902140, now seen corresponding path program 1 times [2019-09-08 06:55:01,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:01,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:01,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-09-08 06:55:01,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:55:01,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:01,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:01,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 1540 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 06:55:01,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:55:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:55:01,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:55:01,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 06:55:01,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 06:55:01,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 06:55:01,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 06:55:01,596 INFO L87 Difference]: Start difference. First operand 34783 states and 39172 transitions. Second operand 3 states. [2019-09-08 06:55:08,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:08,280 INFO L93 Difference]: Finished difference Result 101891 states and 116265 transitions. [2019-09-08 06:55:08,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 06:55:08,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 288 [2019-09-08 06:55:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:08,563 INFO L225 Difference]: With dead ends: 101891 [2019-09-08 06:55:08,564 INFO L226 Difference]: Without dead ends: 54257 [2019-09-08 06:55:08,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 289 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:08,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54257 states. [2019-09-08 06:55:14,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54257 to 54251. [2019-09-08 06:55:14,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54251 states. [2019-09-08 06:55:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54251 states to 54251 states and 61723 transitions. [2019-09-08 06:55:14,207 INFO L78 Accepts]: Start accepts. Automaton has 54251 states and 61723 transitions. Word has length 288 [2019-09-08 06:55:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:14,208 INFO L475 AbstractCegarLoop]: Abstraction has 54251 states and 61723 transitions. [2019-09-08 06:55:14,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 06:55:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 54251 states and 61723 transitions. [2019-09-08 06:55:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-09-08 06:55:14,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:14,417 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:55:14,417 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:14,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1799830949, now seen corresponding path program 1 times [2019-09-08 06:55:14,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:14,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:14,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:14,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-09-08 06:55:14,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:55:14,560 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) [2019-09-08 06:55:14,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:55:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:14,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 1824 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:55:14,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:55:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 06:55:14,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:55:14,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:55:14,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:55:14,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:55:14,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:55:14,924 INFO L87 Difference]: Start difference. First operand 54251 states and 61723 transitions. Second operand 5 states. [2019-09-08 06:55:27,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:55:27,348 INFO L93 Difference]: Finished difference Result 188386 states and 231993 transitions. [2019-09-08 06:55:27,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:55:27,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 378 [2019-09-08 06:55:27,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:55:27,864 INFO L225 Difference]: With dead ends: 188386 [2019-09-08 06:55:27,864 INFO L226 Difference]: Without dead ends: 134164 [2019-09-08 06:55:28,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 383 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 06:55:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134164 states. [2019-09-08 06:55:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134164 to 133640. [2019-09-08 06:55:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133640 states. [2019-09-08 06:55:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133640 states to 133640 states and 159495 transitions. [2019-09-08 06:55:43,002 INFO L78 Accepts]: Start accepts. Automaton has 133640 states and 159495 transitions. Word has length 378 [2019-09-08 06:55:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:43,002 INFO L475 AbstractCegarLoop]: Abstraction has 133640 states and 159495 transitions. [2019-09-08 06:55:43,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:55:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 133640 states and 159495 transitions. [2019-09-08 06:55:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-09-08 06:55:43,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:43,340 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,340 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1364700216, now seen corresponding path program 1 times [2019-09-08 06:55:43,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:43,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:43,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:43,607 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 42 proven. 91 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-09-08 06:55:43,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:55:43,608 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:55:43,629 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:55:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:43,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 2447 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:55:43,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:55:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2019-09-08 06:55:44,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:55:44,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 06:55:44,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:55:44,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:55:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:55:44,067 INFO L87 Difference]: Start difference. First operand 133640 states and 159495 transitions. Second operand 6 states. [2019-09-08 06:56:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:05,251 INFO L93 Difference]: Finished difference Result 347852 states and 443557 transitions. [2019-09-08 06:56:05,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:56:05,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 563 [2019-09-08 06:56:05,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:06,821 INFO L225 Difference]: With dead ends: 347852 [2019-09-08 06:56:06,821 INFO L226 Difference]: Without dead ends: 214246 [2019-09-08 06:56:07,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 567 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:56:07,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214246 states. [2019-09-08 06:56:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214246 to 210181. [2019-09-08 06:56:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210181 states. [2019-09-08 06:56:36,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210181 states to 210181 states and 253311 transitions. [2019-09-08 06:56:36,118 INFO L78 Accepts]: Start accepts. Automaton has 210181 states and 253311 transitions. Word has length 563 [2019-09-08 06:56:36,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:56:36,118 INFO L475 AbstractCegarLoop]: Abstraction has 210181 states and 253311 transitions. [2019-09-08 06:56:36,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:56:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 210181 states and 253311 transitions. [2019-09-08 06:56:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2019-09-08 06:56:36,418 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:56:36,418 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,419 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:56:36,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:56:36,419 INFO L82 PathProgramCache]: Analyzing trace with hash -557186552, now seen corresponding path program 1 times [2019-09-08 06:56:36,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:56:36,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:56:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:56:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 39 proven. 45 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-09-08 06:56:36,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:56:36,612 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:56:36,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:56:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:56:36,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:56:36,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:56:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:56:37,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:56:37,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:56:37,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:56:37,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:56:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:56:37,104 INFO L87 Difference]: Start difference. First operand 210181 states and 253311 transitions. Second operand 5 states. [2019-09-08 06:56:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:59,208 INFO L93 Difference]: Finished difference Result 386967 states and 474954 transitions. [2019-09-08 06:56:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:56:59,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 556 [2019-09-08 06:56:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:00,064 INFO L225 Difference]: With dead ends: 386967 [2019-09-08 06:57:00,064 INFO L226 Difference]: Without dead ends: 141415 [2019-09-08 06:57:00,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 560 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:57:00,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141415 states. [2019-09-08 06:57:20,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141415 to 141301. [2019-09-08 06:57:20,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141301 states. [2019-09-08 06:57:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141301 states to 141301 states and 166069 transitions. [2019-09-08 06:57:21,105 INFO L78 Accepts]: Start accepts. Automaton has 141301 states and 166069 transitions. Word has length 556 [2019-09-08 06:57:21,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:21,106 INFO L475 AbstractCegarLoop]: Abstraction has 141301 states and 166069 transitions. [2019-09-08 06:57:21,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 141301 states and 166069 transitions. [2019-09-08 06:57:21,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 648 [2019-09-08 06:57:21,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:21,306 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:21,306 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:21,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1025385195, now seen corresponding path program 1 times [2019-09-08 06:57:21,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:21,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:21,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:21,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:21,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2019-09-08 06:57:21,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:21,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:57:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:21,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 2761 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 06:57:21,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:22,551 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2019-09-08 06:57:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2019-09-08 06:57:22,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:57:22,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:57:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:57:22,563 INFO L87 Difference]: Start difference. First operand 141301 states and 166069 transitions. Second operand 12 states. [2019-09-08 06:57:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:31,067 INFO L93 Difference]: Finished difference Result 230928 states and 266887 transitions. [2019-09-08 06:57:31,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:57:31,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 647 [2019-09-08 06:57:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:31,268 INFO L225 Difference]: With dead ends: 230928 [2019-09-08 06:57:31,268 INFO L226 Difference]: Without dead ends: 89656 [2019-09-08 06:57:31,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-09-08 06:57:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89656 states. [2019-09-08 06:57:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89656 to 87388. [2019-09-08 06:57:44,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87388 states. [2019-09-08 06:57:44,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87388 states to 87388 states and 96472 transitions. [2019-09-08 06:57:44,740 INFO L78 Accepts]: Start accepts. Automaton has 87388 states and 96472 transitions. Word has length 647 [2019-09-08 06:57:44,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:44,740 INFO L475 AbstractCegarLoop]: Abstraction has 87388 states and 96472 transitions. [2019-09-08 06:57:44,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:57:44,741 INFO L276 IsEmpty]: Start isEmpty. Operand 87388 states and 96472 transitions. [2019-09-08 06:57:44,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2019-09-08 06:57:44,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:44,829 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:44,829 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:44,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 79660909, now seen corresponding path program 1 times [2019-09-08 06:57:44,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:44,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:45,295 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2019-09-08 06:57:45,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:45,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:57:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:45,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2236 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:57:45,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:57:45,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:45,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 06:57:45,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:45,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:45,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:45,736 INFO L87 Difference]: Start difference. First operand 87388 states and 96472 transitions. Second operand 6 states. [2019-09-08 06:58:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:07,686 INFO L93 Difference]: Finished difference Result 321503 states and 356597 transitions. [2019-09-08 06:58:07,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:58:07,687 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 488 [2019-09-08 06:58:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:08,121 INFO L225 Difference]: With dead ends: 321503 [2019-09-08 06:58:08,121 INFO L226 Difference]: Without dead ends: 196760 [2019-09-08 06:58:08,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 492 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:58:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196760 states. [2019-09-08 06:58:32,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196760 to 196560. [2019-09-08 06:58:32,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196560 states. [2019-09-08 06:58:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196560 states to 196560 states and 218131 transitions. [2019-09-08 06:58:32,830 INFO L78 Accepts]: Start accepts. Automaton has 196560 states and 218131 transitions. Word has length 488 [2019-09-08 06:58:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:32,830 INFO L475 AbstractCegarLoop]: Abstraction has 196560 states and 218131 transitions. [2019-09-08 06:58:32,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 196560 states and 218131 transitions. [2019-09-08 06:58:32,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-09-08 06:58:32,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:32,966 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,966 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:32,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:32,967 INFO L82 PathProgramCache]: Analyzing trace with hash 383517957, now seen corresponding path program 1 times [2019-09-08 06:58:32,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:32,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:33,675 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2019-09-08 06:58:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:58:33,675 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 06:58:33,696 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 06:58:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:33,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 2524 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:58:34,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:58:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2019-09-08 06:58:34,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:58:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:58:34,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:34,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:34,150 INFO L87 Difference]: Start difference. First operand 196560 states and 218131 transitions. Second operand 5 states. [2019-09-08 06:59:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:18,956 INFO L93 Difference]: Finished difference Result 600865 states and 692389 transitions. [2019-09-08 06:59:18,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 06:59:18,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 580 [2019-09-08 06:59:18,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:20,787 INFO L225 Difference]: With dead ends: 600865 [2019-09-08 06:59:20,787 INFO L226 Difference]: Without dead ends: 404509 [2019-09-08 06:59:21,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 589 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 06:59:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404509 states. [2019-09-08 07:00:12,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404509 to 394996. [2019-09-08 07:00:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394996 states. [2019-09-08 07:00:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394996 states to 394996 states and 438078 transitions. [2019-09-08 07:00:14,687 INFO L78 Accepts]: Start accepts. Automaton has 394996 states and 438078 transitions. Word has length 580 [2019-09-08 07:00:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:14,688 INFO L475 AbstractCegarLoop]: Abstraction has 394996 states and 438078 transitions. [2019-09-08 07:00:14,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 394996 states and 438078 transitions. [2019-09-08 07:00:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2019-09-08 07:00:15,028 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:15,028 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,028 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash -744115355, now seen corresponding path program 1 times [2019-09-08 07:00:15,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:15,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:15,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:15,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 9 proven. 115 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2019-09-08 07:00:15,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:00:15,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:00:15,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:15,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 2819 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:00:15,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:00:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1212 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-09-08 07:00:16,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:00:16,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 07:00:16,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:00:16,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:00:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:00:16,789 INFO L87 Difference]: Start difference. First operand 394996 states and 438078 transitions. Second operand 7 states. [2019-09-08 07:01:26,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:26,404 INFO L93 Difference]: Finished difference Result 891131 states and 1027141 transitions. [2019-09-08 07:01:26,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:26,405 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 675 [2019-09-08 07:01:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:27,729 INFO L225 Difference]: With dead ends: 891131 [2019-09-08 07:01:27,729 INFO L226 Difference]: Without dead ends: 496311 [2019-09-08 07:01:28,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 677 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 07:01:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496311 states. [2019-09-08 07:02:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496311 to 494564. [2019-09-08 07:02:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494564 states. [2019-09-08 07:02:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494564 states to 494564 states and 548869 transitions. [2019-09-08 07:02:45,749 INFO L78 Accepts]: Start accepts. Automaton has 494564 states and 548869 transitions. Word has length 675 [2019-09-08 07:02:45,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:45,750 INFO L475 AbstractCegarLoop]: Abstraction has 494564 states and 548869 transitions. [2019-09-08 07:02:45,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:02:45,750 INFO L276 IsEmpty]: Start isEmpty. Operand 494564 states and 548869 transitions. [2019-09-08 07:02:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-09-08 07:02:46,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:46,218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:46,218 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:46,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1538606282, now seen corresponding path program 1 times [2019-09-08 07:02:46,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 13 proven. 80 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-08 07:02:46,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:02:46,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:02:46,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:46,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 2539 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 07:02:46,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:02:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 493 proven. 74 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-08 07:02:47,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 07:02:47,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-08 07:02:47,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:02:47,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:02:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:02:47,064 INFO L87 Difference]: Start difference. First operand 494564 states and 548869 transitions. Second operand 9 states. [2019-09-08 07:03:52,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:52,028 INFO L93 Difference]: Finished difference Result 901989 states and 1000799 transitions. [2019-09-08 07:03:52,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:03:52,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 585 [2019-09-08 07:03:52,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:53,314 INFO L225 Difference]: With dead ends: 901989 [2019-09-08 07:03:53,314 INFO L226 Difference]: Without dead ends: 441589 [2019-09-08 07:03:54,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:03:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441589 states.