java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:51:05,669 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:51:05,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:51:05,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:51:05,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:51:05,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:51:05,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:51:05,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:51:05,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:51:05,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:51:05,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:51:05,693 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:51:05,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:51:05,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:51:05,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:51:05,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:51:05,697 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:51:05,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:51:05,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:51:05,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:51:05,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:51:05,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:51:05,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:51:05,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:51:05,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:51:05,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:51:05,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:51:05,710 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:51:05,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:51:05,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:51:05,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:51:05,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:51:05,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:51:05,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:51:05,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:51:05,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:51:05,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:51:05,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:51:05,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:51:05,718 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:51:05,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:51:05,719 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:51:05,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:51:05,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:51:05,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:51:05,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:51:05,747 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:51:05,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:51:05,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:51:05,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:51:05,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:51:05,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:51:05,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:51:05,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:51:05,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:51:05,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:51:05,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:51:05,750 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:51:05,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:51:05,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:51:05,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:51:05,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:51:05,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:51:05,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:51:05,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:51:05,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:51:05,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:51:05,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:51:05,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:51:05,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:51:05,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:51:05,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:51:05,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:51:05,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:51:05,832 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:51:05,832 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:51:05,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.15.cil.c [2019-09-08 06:51:05,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35555f48/84e9a2b054374f129bf32aecca4ad8e4/FLAG8401e90e6 [2019-09-08 06:51:06,427 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:51:06,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.15.cil.c [2019-09-08 06:51:06,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35555f48/84e9a2b054374f129bf32aecca4ad8e4/FLAG8401e90e6 [2019-09-08 06:51:06,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35555f48/84e9a2b054374f129bf32aecca4ad8e4 [2019-09-08 06:51:06,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:51:06,741 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:51:06,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:51:06,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:51:06,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:51:06,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:51:06" (1/1) ... [2019-09-08 06:51:06,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e8182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:06, skipping insertion in model container [2019-09-08 06:51:06,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:51:06" (1/1) ... [2019-09-08 06:51:06,757 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:51:06,819 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:51:07,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:51:07,242 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:51:07,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:51:07,392 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:51:07,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07 WrapperNode [2019-09-08 06:51:07,393 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:51:07,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:51:07,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:51:07,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:51:07,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (1/1) ... [2019-09-08 06:51:07,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:51:07,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:51:07,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:51:07,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:51:07,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (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:51:07,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:51:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:51:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:51:07,575 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:51:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:51:07,576 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:51:07,577 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:51:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:51:07,578 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:51:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:51:07,579 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:51:07,581 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-08 06:51:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:51:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:51:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:51:07,582 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:51:07,583 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:51:07,584 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:51:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:51:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:51:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:51:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:51:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:51:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:51:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:51:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:51:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:51:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:51:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:51:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:51:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:51:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:51:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:51:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:51:07,588 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:51:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:51:07,590 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:51:07,591 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:51:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:51:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:51:07,592 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:51:07,593 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:51:07,594 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:51:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:51:07,595 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:51:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:51:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:51:07,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:51:09,075 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:51:09,075 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-08 06:51:09,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:51:09 BoogieIcfgContainer [2019-09-08 06:51:09,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:51:09,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:51:09,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:51:09,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:51:09,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:51:06" (1/3) ... [2019-09-08 06:51:09,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43746657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:51:09, skipping insertion in model container [2019-09-08 06:51:09,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:51:07" (2/3) ... [2019-09-08 06:51:09,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43746657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:51:09, skipping insertion in model container [2019-09-08 06:51:09,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:51:09" (3/3) ... [2019-09-08 06:51:09,090 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.15.cil.c [2019-09-08 06:51:09,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:51:09,126 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:51:09,146 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:51:09,182 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:51:09,183 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:51:09,183 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:51:09,183 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:51:09,184 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:51:09,184 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:51:09,184 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:51:09,184 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:51:09,185 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:51:09,215 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states. [2019-09-08 06:51:09,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:09,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:09,236 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:09,238 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1434129213, now seen corresponding path program 1 times [2019-09-08 06:51:09,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:09,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:09,862 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:51:09,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:09,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:09,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:09,888 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 4 states. [2019-09-08 06:51:10,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:10,350 INFO L93 Difference]: Finished difference Result 996 states and 1547 transitions. [2019-09-08 06:51:10,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:10,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:51:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:10,378 INFO L225 Difference]: With dead ends: 996 [2019-09-08 06:51:10,379 INFO L226 Difference]: Without dead ends: 500 [2019-09-08 06:51:10,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:10,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-08 06:51:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-09-08 06:51:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 736 transitions. [2019-09-08 06:51:10,569 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 736 transitions. Word has length 246 [2019-09-08 06:51:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:10,572 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 736 transitions. [2019-09-08 06:51:10,572 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 736 transitions. [2019-09-08 06:51:10,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:10,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:10,587 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:10,587 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash -770136895, now seen corresponding path program 1 times [2019-09-08 06:51:10,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:10,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:10,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:10,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:10,867 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:51:10,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:10,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:10,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:10,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:10,871 INFO L87 Difference]: Start difference. First operand 500 states and 736 transitions. Second operand 4 states. [2019-09-08 06:51:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:11,189 INFO L93 Difference]: Finished difference Result 972 states and 1430 transitions. [2019-09-08 06:51:11,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:11,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:51:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:11,195 INFO L225 Difference]: With dead ends: 972 [2019-09-08 06:51:11,195 INFO L226 Difference]: Without dead ends: 500 [2019-09-08 06:51:11,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-08 06:51:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-09-08 06:51:11,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 735 transitions. [2019-09-08 06:51:11,230 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 735 transitions. Word has length 246 [2019-09-08 06:51:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:11,230 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 735 transitions. [2019-09-08 06:51:11,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 735 transitions. [2019-09-08 06:51:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:11,234 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:11,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:11,235 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash 992688831, now seen corresponding path program 1 times [2019-09-08 06:51:11,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:11,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:11,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:11,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:11,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:11,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:11,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:11,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:11,553 INFO L87 Difference]: Start difference. First operand 500 states and 735 transitions. Second operand 5 states. [2019-09-08 06:51:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:12,619 INFO L93 Difference]: Finished difference Result 1043 states and 1567 transitions. [2019-09-08 06:51:12,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:12,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:12,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:12,625 INFO L225 Difference]: With dead ends: 1043 [2019-09-08 06:51:12,625 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 06:51:12,627 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:51:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 06:51:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-08 06:51:12,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 734 transitions. [2019-09-08 06:51:12,676 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 734 transitions. Word has length 246 [2019-09-08 06:51:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:12,677 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 734 transitions. [2019-09-08 06:51:12,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 734 transitions. [2019-09-08 06:51:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:12,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:12,681 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:12,682 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:12,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1238496705, now seen corresponding path program 1 times [2019-09-08 06:51:12,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:12,924 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:51:12,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:12,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:12,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:12,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:12,926 INFO L87 Difference]: Start difference. First operand 500 states and 734 transitions. Second operand 5 states. [2019-09-08 06:51:14,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:14,009 INFO L93 Difference]: Finished difference Result 1043 states and 1566 transitions. [2019-09-08 06:51:14,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:14,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:14,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:14,016 INFO L225 Difference]: With dead ends: 1043 [2019-09-08 06:51:14,017 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 06:51:14,020 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:51:14,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 06:51:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-08 06:51:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 733 transitions. [2019-09-08 06:51:14,142 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 733 transitions. Word has length 246 [2019-09-08 06:51:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:14,142 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 733 transitions. [2019-09-08 06:51:14,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 733 transitions. [2019-09-08 06:51:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:14,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:14,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:14,149 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:14,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:14,150 INFO L82 PathProgramCache]: Analyzing trace with hash 969331327, now seen corresponding path program 1 times [2019-09-08 06:51:14,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:14,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:14,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:14,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:14,346 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:51:14,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:14,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:14,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:14,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:14,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:14,350 INFO L87 Difference]: Start difference. First operand 500 states and 733 transitions. Second operand 5 states. [2019-09-08 06:51:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:15,545 INFO L93 Difference]: Finished difference Result 1041 states and 1560 transitions. [2019-09-08 06:51:15,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:15,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:15,551 INFO L225 Difference]: With dead ends: 1041 [2019-09-08 06:51:15,551 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 06:51:15,554 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:51:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 06:51:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 500. [2019-09-08 06:51:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 732 transitions. [2019-09-08 06:51:15,595 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 732 transitions. Word has length 246 [2019-09-08 06:51:15,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:15,596 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 732 transitions. [2019-09-08 06:51:15,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 732 transitions. [2019-09-08 06:51:15,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:15,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:15,601 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:15,601 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:15,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1099195905, now seen corresponding path program 1 times [2019-09-08 06:51:15,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:15,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:15,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:15,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:15,781 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:51:15,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:15,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:15,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:15,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:15,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:15,784 INFO L87 Difference]: Start difference. First operand 500 states and 732 transitions. Second operand 5 states. [2019-09-08 06:51:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:16,691 INFO L93 Difference]: Finished difference Result 1039 states and 1554 transitions. [2019-09-08 06:51:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:16,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:16,698 INFO L225 Difference]: With dead ends: 1039 [2019-09-08 06:51:16,698 INFO L226 Difference]: Without dead ends: 570 [2019-09-08 06:51:16,701 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:51:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-08 06:51:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 500. [2019-09-08 06:51:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 731 transitions. [2019-09-08 06:51:16,740 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 731 transitions. Word has length 246 [2019-09-08 06:51:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:16,741 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 731 transitions. [2019-09-08 06:51:16,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 731 transitions. [2019-09-08 06:51:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:16,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:16,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:16,745 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:16,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -974824897, now seen corresponding path program 1 times [2019-09-08 06:51:16,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:16,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:16,903 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:51:16,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:16,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:16,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:16,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:16,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:16,907 INFO L87 Difference]: Start difference. First operand 500 states and 731 transitions. Second operand 5 states. [2019-09-08 06:51:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:17,861 INFO L93 Difference]: Finished difference Result 1037 states and 1548 transitions. [2019-09-08 06:51:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:17,862 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:17,866 INFO L225 Difference]: With dead ends: 1037 [2019-09-08 06:51:17,867 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 06:51:17,869 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:51:17,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 06:51:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 500. [2019-09-08 06:51:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 730 transitions. [2019-09-08 06:51:17,906 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 730 transitions. Word has length 246 [2019-09-08 06:51:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:17,907 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 730 transitions. [2019-09-08 06:51:17,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 730 transitions. [2019-09-08 06:51:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:17,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:17,915 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:17,916 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash 2006312513, now seen corresponding path program 1 times [2019-09-08 06:51:17,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:18,132 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:51:18,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:18,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:18,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:18,136 INFO L87 Difference]: Start difference. First operand 500 states and 730 transitions. Second operand 5 states. [2019-09-08 06:51:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:19,166 INFO L93 Difference]: Finished difference Result 1035 states and 1542 transitions. [2019-09-08 06:51:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:19,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:19,174 INFO L225 Difference]: With dead ends: 1035 [2019-09-08 06:51:19,174 INFO L226 Difference]: Without dead ends: 566 [2019-09-08 06:51:19,179 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:51:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-08 06:51:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 500. [2019-09-08 06:51:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 729 transitions. [2019-09-08 06:51:19,229 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 729 transitions. Word has length 246 [2019-09-08 06:51:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:19,230 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 729 transitions. [2019-09-08 06:51:19,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:19,230 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 729 transitions. [2019-09-08 06:51:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:19,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:19,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:19,234 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:19,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:19,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1132646911, now seen corresponding path program 1 times [2019-09-08 06:51:19,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:19,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:19,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:19,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:19,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:19,369 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:51:19,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:19,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:19,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:19,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:19,371 INFO L87 Difference]: Start difference. First operand 500 states and 729 transitions. Second operand 5 states. [2019-09-08 06:51:20,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:20,346 INFO L93 Difference]: Finished difference Result 1031 states and 1532 transitions. [2019-09-08 06:51:20,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:20,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:20,352 INFO L225 Difference]: With dead ends: 1031 [2019-09-08 06:51:20,352 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 06:51:20,354 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:51:20,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 06:51:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 500. [2019-09-08 06:51:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 728 transitions. [2019-09-08 06:51:20,388 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 728 transitions. Word has length 246 [2019-09-08 06:51:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:20,388 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 728 transitions. [2019-09-08 06:51:20,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 728 transitions. [2019-09-08 06:51:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:20,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:20,391 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:20,391 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash 278107453, now seen corresponding path program 1 times [2019-09-08 06:51:20,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:20,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:20,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:20,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:20,520 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:51:20,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:20,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:20,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:20,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:20,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:20,522 INFO L87 Difference]: Start difference. First operand 500 states and 728 transitions. Second operand 5 states. [2019-09-08 06:51:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:21,551 INFO L93 Difference]: Finished difference Result 1029 states and 1526 transitions. [2019-09-08 06:51:21,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:21,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:21,556 INFO L225 Difference]: With dead ends: 1029 [2019-09-08 06:51:21,556 INFO L226 Difference]: Without dead ends: 560 [2019-09-08 06:51:21,558 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:51:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-08 06:51:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 500. [2019-09-08 06:51:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 727 transitions. [2019-09-08 06:51:21,592 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 727 transitions. Word has length 246 [2019-09-08 06:51:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:21,592 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 727 transitions. [2019-09-08 06:51:21,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 727 transitions. [2019-09-08 06:51:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:21,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:21,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:21,596 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:21,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:21,596 INFO L82 PathProgramCache]: Analyzing trace with hash -857836993, now seen corresponding path program 1 times [2019-09-08 06:51:21,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:21,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:21,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:21,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:21,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:21,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:21,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:21,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:21,757 INFO L87 Difference]: Start difference. First operand 500 states and 727 transitions. Second operand 5 states. [2019-09-08 06:51:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:23,058 INFO L93 Difference]: Finished difference Result 1027 states and 1520 transitions. [2019-09-08 06:51:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:23,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:23,066 INFO L225 Difference]: With dead ends: 1027 [2019-09-08 06:51:23,066 INFO L226 Difference]: Without dead ends: 558 [2019-09-08 06:51:23,071 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:51:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-08 06:51:23,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 500. [2019-09-08 06:51:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 726 transitions. [2019-09-08 06:51:23,122 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 726 transitions. Word has length 246 [2019-09-08 06:51:23,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:23,124 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 726 transitions. [2019-09-08 06:51:23,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:23,124 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 726 transitions. [2019-09-08 06:51:23,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:23,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:23,129 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:23,129 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:23,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:23,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1725764355, now seen corresponding path program 1 times [2019-09-08 06:51:23,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:23,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:23,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:23,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:23,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:23,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:23,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:23,277 INFO L87 Difference]: Start difference. First operand 500 states and 726 transitions. Second operand 5 states. [2019-09-08 06:51:24,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:24,260 INFO L93 Difference]: Finished difference Result 1025 states and 1514 transitions. [2019-09-08 06:51:24,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:24,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:24,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:24,267 INFO L225 Difference]: With dead ends: 1025 [2019-09-08 06:51:24,267 INFO L226 Difference]: Without dead ends: 556 [2019-09-08 06:51:24,269 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:51:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-08 06:51:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 500. [2019-09-08 06:51:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 725 transitions. [2019-09-08 06:51:24,304 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 725 transitions. Word has length 246 [2019-09-08 06:51:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:24,304 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 725 transitions. [2019-09-08 06:51:24,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 725 transitions. [2019-09-08 06:51:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:24,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:24,306 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:24,307 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:24,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:24,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1294279295, now seen corresponding path program 1 times [2019-09-08 06:51:24,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:24,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:24,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:24,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:24,440 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:51:24,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:24,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:24,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:24,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:24,443 INFO L87 Difference]: Start difference. First operand 500 states and 725 transitions. Second operand 5 states. [2019-09-08 06:51:25,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:25,375 INFO L93 Difference]: Finished difference Result 1023 states and 1508 transitions. [2019-09-08 06:51:25,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:25,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:25,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:25,379 INFO L225 Difference]: With dead ends: 1023 [2019-09-08 06:51:25,380 INFO L226 Difference]: Without dead ends: 554 [2019-09-08 06:51:25,383 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:51:25,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-08 06:51:25,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 500. [2019-09-08 06:51:25,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 724 transitions. [2019-09-08 06:51:25,423 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 724 transitions. Word has length 246 [2019-09-08 06:51:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:25,423 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 724 transitions. [2019-09-08 06:51:25,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 724 transitions. [2019-09-08 06:51:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:25,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:25,425 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:25,426 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash 421868733, now seen corresponding path program 1 times [2019-09-08 06:51:25,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:25,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:25,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:25,560 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:51:25,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:25,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:25,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:25,562 INFO L87 Difference]: Start difference. First operand 500 states and 724 transitions. Second operand 5 states. [2019-09-08 06:51:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:26,616 INFO L93 Difference]: Finished difference Result 1021 states and 1502 transitions. [2019-09-08 06:51:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:26,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:26,623 INFO L225 Difference]: With dead ends: 1021 [2019-09-08 06:51:26,623 INFO L226 Difference]: Without dead ends: 552 [2019-09-08 06:51:26,625 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:51:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-08 06:51:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 500. [2019-09-08 06:51:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 723 transitions. [2019-09-08 06:51:26,661 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 723 transitions. Word has length 246 [2019-09-08 06:51:26,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:26,662 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 723 transitions. [2019-09-08 06:51:26,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:26,662 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 723 transitions. [2019-09-08 06:51:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:26,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:26,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:26,664 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:26,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1545936193, now seen corresponding path program 1 times [2019-09-08 06:51:26,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:26,776 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:51:26,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:26,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:26,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:26,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:26,779 INFO L87 Difference]: Start difference. First operand 500 states and 723 transitions. Second operand 5 states. [2019-09-08 06:51:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:27,809 INFO L93 Difference]: Finished difference Result 1019 states and 1496 transitions. [2019-09-08 06:51:27,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:27,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:27,813 INFO L225 Difference]: With dead ends: 1019 [2019-09-08 06:51:27,813 INFO L226 Difference]: Without dead ends: 550 [2019-09-08 06:51:27,818 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:51:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-08 06:51:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 500. [2019-09-08 06:51:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 722 transitions. [2019-09-08 06:51:27,872 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 722 transitions. Word has length 246 [2019-09-08 06:51:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:27,872 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 722 transitions. [2019-09-08 06:51:27,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 722 transitions. [2019-09-08 06:51:27,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:27,875 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:27,875 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:27,875 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:27,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1332319107, now seen corresponding path program 1 times [2019-09-08 06:51:27,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:27,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:27,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:28,012 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:51:28,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:28,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:28,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:28,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:28,015 INFO L87 Difference]: Start difference. First operand 500 states and 722 transitions. Second operand 5 states. [2019-09-08 06:51:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:29,026 INFO L93 Difference]: Finished difference Result 1063 states and 1579 transitions. [2019-09-08 06:51:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:29,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:29,031 INFO L225 Difference]: With dead ends: 1063 [2019-09-08 06:51:29,031 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 06:51:29,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:51:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 06:51:29,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 500. [2019-09-08 06:51:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 721 transitions. [2019-09-08 06:51:29,074 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 721 transitions. Word has length 246 [2019-09-08 06:51:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:29,074 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 721 transitions. [2019-09-08 06:51:29,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:29,074 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 721 transitions. [2019-09-08 06:51:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:29,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:29,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:29,076 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:29,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:29,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1032146363, now seen corresponding path program 1 times [2019-09-08 06:51:29,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:29,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:29,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:29,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:29,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:29,204 INFO L87 Difference]: Start difference. First operand 500 states and 721 transitions. Second operand 5 states. [2019-09-08 06:51:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:30,413 INFO L93 Difference]: Finished difference Result 1065 states and 1578 transitions. [2019-09-08 06:51:30,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:30,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:30,418 INFO L225 Difference]: With dead ends: 1065 [2019-09-08 06:51:30,418 INFO L226 Difference]: Without dead ends: 596 [2019-09-08 06:51:30,420 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:51:30,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-08 06:51:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 500. [2019-09-08 06:51:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 720 transitions. [2019-09-08 06:51:30,467 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 720 transitions. Word has length 246 [2019-09-08 06:51:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:30,468 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 720 transitions. [2019-09-08 06:51:30,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 720 transitions. [2019-09-08 06:51:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:30,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:30,470 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:30,471 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash -692695875, now seen corresponding path program 1 times [2019-09-08 06:51:30,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:30,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:30,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:30,586 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:51:30,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:30,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:30,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:30,588 INFO L87 Difference]: Start difference. First operand 500 states and 720 transitions. Second operand 5 states. [2019-09-08 06:51:31,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:31,765 INFO L93 Difference]: Finished difference Result 1063 states and 1572 transitions. [2019-09-08 06:51:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:31,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:31,770 INFO L225 Difference]: With dead ends: 1063 [2019-09-08 06:51:31,770 INFO L226 Difference]: Without dead ends: 594 [2019-09-08 06:51:31,772 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:51:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-08 06:51:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 500. [2019-09-08 06:51:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 719 transitions. [2019-09-08 06:51:31,827 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 719 transitions. Word has length 246 [2019-09-08 06:51:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:31,827 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 719 transitions. [2019-09-08 06:51:31,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 719 transitions. [2019-09-08 06:51:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:31,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:31,830 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:31,830 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:31,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1606968699, now seen corresponding path program 1 times [2019-09-08 06:51:31,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:31,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:31,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:31,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:31,953 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:51:31,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:31,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:31,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:31,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:31,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:31,956 INFO L87 Difference]: Start difference. First operand 500 states and 719 transitions. Second operand 5 states. [2019-09-08 06:51:32,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:32,949 INFO L93 Difference]: Finished difference Result 1061 states and 1566 transitions. [2019-09-08 06:51:32,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:32,950 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:32,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:32,955 INFO L225 Difference]: With dead ends: 1061 [2019-09-08 06:51:32,955 INFO L226 Difference]: Without dead ends: 592 [2019-09-08 06:51:32,957 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:51:32,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-08 06:51:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 500. [2019-09-08 06:51:33,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 718 transitions. [2019-09-08 06:51:33,002 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 718 transitions. Word has length 246 [2019-09-08 06:51:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:33,002 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 718 transitions. [2019-09-08 06:51:33,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 718 transitions. [2019-09-08 06:51:33,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:33,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:33,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:33,005 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:33,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:33,005 INFO L82 PathProgramCache]: Analyzing trace with hash -674153219, now seen corresponding path program 1 times [2019-09-08 06:51:33,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:33,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:33,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:33,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:33,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:33,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:33,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:33,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:33,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:33,113 INFO L87 Difference]: Start difference. First operand 500 states and 718 transitions. Second operand 5 states. [2019-09-08 06:51:34,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:34,139 INFO L93 Difference]: Finished difference Result 1059 states and 1560 transitions. [2019-09-08 06:51:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:34,139 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:34,145 INFO L225 Difference]: With dead ends: 1059 [2019-09-08 06:51:34,145 INFO L226 Difference]: Without dead ends: 590 [2019-09-08 06:51:34,147 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:51:34,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-08 06:51:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2019-09-08 06:51:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 717 transitions. [2019-09-08 06:51:34,198 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 717 transitions. Word has length 246 [2019-09-08 06:51:34,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:34,198 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 717 transitions. [2019-09-08 06:51:34,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:34,198 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 717 transitions. [2019-09-08 06:51:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:34,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:34,200 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:34,200 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:34,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:34,201 INFO L82 PathProgramCache]: Analyzing trace with hash -747737797, now seen corresponding path program 1 times [2019-09-08 06:51:34,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:34,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:34,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:34,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:51:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:34,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:34,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:34,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:34,320 INFO L87 Difference]: Start difference. First operand 500 states and 717 transitions. Second operand 5 states. [2019-09-08 06:51:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:35,408 INFO L93 Difference]: Finished difference Result 1057 states and 1554 transitions. [2019-09-08 06:51:35,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:35,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:35,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:35,412 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 06:51:35,412 INFO L226 Difference]: Without dead ends: 588 [2019-09-08 06:51:35,414 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:51:35,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-08 06:51:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 500. [2019-09-08 06:51:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 716 transitions. [2019-09-08 06:51:35,463 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 716 transitions. Word has length 246 [2019-09-08 06:51:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:35,464 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 716 transitions. [2019-09-08 06:51:35,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 716 transitions. [2019-09-08 06:51:35,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:35,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:35,466 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:35,466 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:35,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1466645821, now seen corresponding path program 1 times [2019-09-08 06:51:35,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:35,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:35,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:35,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:35,580 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:51:35,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:35,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:35,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:35,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:35,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:35,582 INFO L87 Difference]: Start difference. First operand 500 states and 716 transitions. Second operand 5 states. [2019-09-08 06:51:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:36,666 INFO L93 Difference]: Finished difference Result 1055 states and 1548 transitions. [2019-09-08 06:51:36,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:36,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:36,674 INFO L225 Difference]: With dead ends: 1055 [2019-09-08 06:51:36,674 INFO L226 Difference]: Without dead ends: 586 [2019-09-08 06:51:36,676 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:51:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-08 06:51:36,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 500. [2019-09-08 06:51:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 715 transitions. [2019-09-08 06:51:36,727 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 715 transitions. Word has length 246 [2019-09-08 06:51:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:36,727 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 715 transitions. [2019-09-08 06:51:36,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:36,727 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 715 transitions. [2019-09-08 06:51:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:36,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:36,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:36,730 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1953719547, now seen corresponding path program 1 times [2019-09-08 06:51:36,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:36,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:36,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:36,837 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:51:36,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:36,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:36,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:36,839 INFO L87 Difference]: Start difference. First operand 500 states and 715 transitions. Second operand 5 states. [2019-09-08 06:51:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:37,855 INFO L93 Difference]: Finished difference Result 1051 states and 1538 transitions. [2019-09-08 06:51:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:37,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:37,859 INFO L225 Difference]: With dead ends: 1051 [2019-09-08 06:51:37,859 INFO L226 Difference]: Without dead ends: 582 [2019-09-08 06:51:37,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:51:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-08 06:51:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 500. [2019-09-08 06:51:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 714 transitions. [2019-09-08 06:51:37,913 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 714 transitions. Word has length 246 [2019-09-08 06:51:37,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:37,913 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 714 transitions. [2019-09-08 06:51:37,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 714 transitions. [2019-09-08 06:51:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:37,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:37,918 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:37,918 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:37,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:37,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1480483897, now seen corresponding path program 1 times [2019-09-08 06:51:37,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:37,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:37,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:37,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:38,032 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:51:38,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:38,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:38,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:38,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:38,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:38,037 INFO L87 Difference]: Start difference. First operand 500 states and 714 transitions. Second operand 5 states. [2019-09-08 06:51:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:39,047 INFO L93 Difference]: Finished difference Result 1049 states and 1532 transitions. [2019-09-08 06:51:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:39,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:39,051 INFO L225 Difference]: With dead ends: 1049 [2019-09-08 06:51:39,052 INFO L226 Difference]: Without dead ends: 580 [2019-09-08 06:51:39,053 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:51:39,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-08 06:51:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 500. [2019-09-08 06:51:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 713 transitions. [2019-09-08 06:51:39,109 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 713 transitions. Word has length 246 [2019-09-08 06:51:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:39,110 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 713 transitions. [2019-09-08 06:51:39,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 713 transitions. [2019-09-08 06:51:39,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:39,113 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:39,113 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:39,113 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:39,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1603765563, now seen corresponding path program 1 times [2019-09-08 06:51:39,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:39,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:39,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:39,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:39,222 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:51:39,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:39,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:39,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:39,224 INFO L87 Difference]: Start difference. First operand 500 states and 713 transitions. Second operand 5 states. [2019-09-08 06:51:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:40,236 INFO L93 Difference]: Finished difference Result 1047 states and 1526 transitions. [2019-09-08 06:51:40,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:40,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:40,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:40,240 INFO L225 Difference]: With dead ends: 1047 [2019-09-08 06:51:40,240 INFO L226 Difference]: Without dead ends: 578 [2019-09-08 06:51:40,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:51:40,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-08 06:51:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 500. [2019-09-08 06:51:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 712 transitions. [2019-09-08 06:51:40,302 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 712 transitions. Word has length 246 [2019-09-08 06:51:40,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:40,303 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 712 transitions. [2019-09-08 06:51:40,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:40,303 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 712 transitions. [2019-09-08 06:51:40,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:40,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:40,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:40,305 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:40,306 INFO L82 PathProgramCache]: Analyzing trace with hash -470467591, now seen corresponding path program 1 times [2019-09-08 06:51:40,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:40,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:40,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:40,426 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:51:40,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:40,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:40,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:40,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:40,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:40,428 INFO L87 Difference]: Start difference. First operand 500 states and 712 transitions. Second operand 5 states. [2019-09-08 06:51:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:41,451 INFO L93 Difference]: Finished difference Result 1045 states and 1520 transitions. [2019-09-08 06:51:41,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:41,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:41,455 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 06:51:41,455 INFO L226 Difference]: Without dead ends: 576 [2019-09-08 06:51:41,457 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:51:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-08 06:51:41,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 500. [2019-09-08 06:51:41,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 711 transitions. [2019-09-08 06:51:41,544 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 711 transitions. Word has length 246 [2019-09-08 06:51:41,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:41,544 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 711 transitions. [2019-09-08 06:51:41,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 711 transitions. [2019-09-08 06:51:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:41,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:41,546 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:41,546 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:41,547 INFO L82 PathProgramCache]: Analyzing trace with hash 432452987, now seen corresponding path program 1 times [2019-09-08 06:51:41,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:41,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:41,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:41,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:41,726 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:51:41,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:41,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:51:41,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:41,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:41,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:41,728 INFO L87 Difference]: Start difference. First operand 500 states and 711 transitions. Second operand 5 states. [2019-09-08 06:51:43,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:43,148 INFO L93 Difference]: Finished difference Result 1043 states and 1514 transitions. [2019-09-08 06:51:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:51:43,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-08 06:51:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:43,154 INFO L225 Difference]: With dead ends: 1043 [2019-09-08 06:51:43,155 INFO L226 Difference]: Without dead ends: 574 [2019-09-08 06:51:43,157 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:51:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-08 06:51:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-08 06:51:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-08 06:51:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 710 transitions. [2019-09-08 06:51:43,259 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 710 transitions. Word has length 246 [2019-09-08 06:51:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:43,259 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 710 transitions. [2019-09-08 06:51:43,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 710 transitions. [2019-09-08 06:51:43,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 06:51:43,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:43,263 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:43,263 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash 184484793, now seen corresponding path program 1 times [2019-09-08 06:51:43,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:43,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:43,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:43,453 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:51:43,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:43,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:43,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:43,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:43,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:43,455 INFO L87 Difference]: Start difference. First operand 500 states and 710 transitions. Second operand 4 states. [2019-09-08 06:51:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:44,294 INFO L93 Difference]: Finished difference Result 1424 states and 2088 transitions. [2019-09-08 06:51:44,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:44,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-08 06:51:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:44,302 INFO L225 Difference]: With dead ends: 1424 [2019-09-08 06:51:44,303 INFO L226 Difference]: Without dead ends: 956 [2019-09-08 06:51:44,305 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:51:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-08 06:51:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 955. [2019-09-08 06:51:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-09-08 06:51:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1352 transitions. [2019-09-08 06:51:44,475 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1352 transitions. Word has length 246 [2019-09-08 06:51:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:44,475 INFO L475 AbstractCegarLoop]: Abstraction has 955 states and 1352 transitions. [2019-09-08 06:51:44,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1352 transitions. [2019-09-08 06:51:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:44,479 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:44,480 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:44,480 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1747623780, now seen corresponding path program 1 times [2019-09-08 06:51:44,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:44,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:44,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 06:51:44,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:44,747 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:51:44,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:45,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 2714 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:45,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 06:51:45,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:45,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:45,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:45,440 INFO L87 Difference]: Start difference. First operand 955 states and 1352 transitions. Second operand 7 states. [2019-09-08 06:51:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:45,923 INFO L93 Difference]: Finished difference Result 2869 states and 4282 transitions. [2019-09-08 06:51:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:45,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 411 [2019-09-08 06:51:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:45,939 INFO L225 Difference]: With dead ends: 2869 [2019-09-08 06:51:45,939 INFO L226 Difference]: Without dead ends: 1946 [2019-09-08 06:51:45,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:45,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2019-09-08 06:51:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1854. [2019-09-08 06:51:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-09-08 06:51:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2683 transitions. [2019-09-08 06:51:46,288 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2683 transitions. Word has length 411 [2019-09-08 06:51:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:46,288 INFO L475 AbstractCegarLoop]: Abstraction has 1854 states and 2683 transitions. [2019-09-08 06:51:46,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2683 transitions. [2019-09-08 06:51:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-08 06:51:46,296 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:46,297 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:46,297 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1661474650, now seen corresponding path program 1 times [2019-09-08 06:51:46,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:46,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:46,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:46,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:46,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:46,462 INFO L87 Difference]: Start difference. First operand 1854 states and 2683 transitions. Second operand 4 states. [2019-09-08 06:51:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:46,912 INFO L93 Difference]: Finished difference Result 3659 states and 5288 transitions. [2019-09-08 06:51:46,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:46,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 411 [2019-09-08 06:51:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:46,922 INFO L225 Difference]: With dead ends: 3659 [2019-09-08 06:51:46,923 INFO L226 Difference]: Without dead ends: 1837 [2019-09-08 06:51:46,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:46,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2019-09-08 06:51:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1837. [2019-09-08 06:51:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1837 states. [2019-09-08 06:51:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2651 transitions. [2019-09-08 06:51:47,179 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2651 transitions. Word has length 411 [2019-09-08 06:51:47,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:47,179 INFO L475 AbstractCegarLoop]: Abstraction has 1837 states and 2651 transitions. [2019-09-08 06:51:47,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:47,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2651 transitions. [2019-09-08 06:51:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:51:47,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:47,185 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:47,186 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:47,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash 741950384, now seen corresponding path program 1 times [2019-09-08 06:51:47,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:47,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:47,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:47,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:47,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 44 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 06:51:47,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:47,393 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:51:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:47,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 2719 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:47,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:51:47,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:47,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:51:47,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:51:47,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:51:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:51:47,875 INFO L87 Difference]: Start difference. First operand 1837 states and 2651 transitions. Second operand 5 states. [2019-09-08 06:51:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:49,938 INFO L93 Difference]: Finished difference Result 7174 states and 11064 transitions. [2019-09-08 06:51:49,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:51:49,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 412 [2019-09-08 06:51:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:49,992 INFO L225 Difference]: With dead ends: 7174 [2019-09-08 06:51:49,992 INFO L226 Difference]: Without dead ends: 5369 [2019-09-08 06:51:50,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 416 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:51:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5369 states. [2019-09-08 06:51:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5369 to 5331. [2019-09-08 06:51:50,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5331 states. [2019-09-08 06:51:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 7870 transitions. [2019-09-08 06:51:50,972 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 7870 transitions. Word has length 412 [2019-09-08 06:51:50,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:50,972 INFO L475 AbstractCegarLoop]: Abstraction has 5331 states and 7870 transitions. [2019-09-08 06:51:50,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:51:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 7870 transitions. [2019-09-08 06:51:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-08 06:51:50,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:50,989 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:51:50,990 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1414944140, now seen corresponding path program 1 times [2019-09-08 06:51:50,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:50,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:50,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-08 06:51:51,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:51:51,160 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:51:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:51,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 2838 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:51:51,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:51:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 06:51:51,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:51:51,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:51:51,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:51:51,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:51:51,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:51:51,698 INFO L87 Difference]: Start difference. First operand 5331 states and 7870 transitions. Second operand 7 states. [2019-09-08 06:51:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:53,136 INFO L93 Difference]: Finished difference Result 16141 states and 25603 transitions. [2019-09-08 06:51:53,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:51:53,136 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 443 [2019-09-08 06:51:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:53,194 INFO L225 Difference]: With dead ends: 16141 [2019-09-08 06:51:53,194 INFO L226 Difference]: Without dead ends: 10857 [2019-09-08 06:51:53,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:51:53,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10857 states. [2019-09-08 06:51:55,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10857 to 10851. [2019-09-08 06:51:55,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10851 states. [2019-09-08 06:51:55,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10851 states to 10851 states and 16510 transitions. [2019-09-08 06:51:55,411 INFO L78 Accepts]: Start accepts. Automaton has 10851 states and 16510 transitions. Word has length 443 [2019-09-08 06:51:55,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:55,412 INFO L475 AbstractCegarLoop]: Abstraction has 10851 states and 16510 transitions. [2019-09-08 06:51:55,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:51:55,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10851 states and 16510 transitions. [2019-09-08 06:51:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-09-08 06:51:55,438 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:55,439 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:55,439 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:55,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:55,439 INFO L82 PathProgramCache]: Analyzing trace with hash -978725652, now seen corresponding path program 1 times [2019-09-08 06:51:55,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:55,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:55,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:55,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:55,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:55,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:55,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:55,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:55,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:55,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:55,592 INFO L87 Difference]: Start difference. First operand 10851 states and 16510 transitions. Second operand 4 states. [2019-09-08 06:51:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:56,861 INFO L93 Difference]: Finished difference Result 21621 states and 32887 transitions. [2019-09-08 06:51:56,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:56,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 412 [2019-09-08 06:51:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:56,920 INFO L225 Difference]: With dead ends: 21621 [2019-09-08 06:51:56,920 INFO L226 Difference]: Without dead ends: 10819 [2019-09-08 06:51:56,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2019-09-08 06:51:58,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10819. [2019-09-08 06:51:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10819 states. [2019-09-08 06:51:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10819 states to 10819 states and 16450 transitions. [2019-09-08 06:51:58,100 INFO L78 Accepts]: Start accepts. Automaton has 10819 states and 16450 transitions. Word has length 412 [2019-09-08 06:51:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:51:58,101 INFO L475 AbstractCegarLoop]: Abstraction has 10819 states and 16450 transitions. [2019-09-08 06:51:58,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:51:58,101 INFO L276 IsEmpty]: Start isEmpty. Operand 10819 states and 16450 transitions. [2019-09-08 06:51:58,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:51:58,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:51:58,121 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:51:58,121 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:51:58,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:51:58,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2146164513, now seen corresponding path program 1 times [2019-09-08 06:51:58,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:51:58,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:51:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:58,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:51:58,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:51:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:51:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:51:58,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:51:58,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:51:58,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:51:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:51:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:58,269 INFO L87 Difference]: Start difference. First operand 10819 states and 16450 transitions. Second operand 4 states. [2019-09-08 06:51:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:51:59,496 INFO L93 Difference]: Finished difference Result 19903 states and 30057 transitions. [2019-09-08 06:51:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:51:59,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2019-09-08 06:51:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:51:59,530 INFO L225 Difference]: With dead ends: 19903 [2019-09-08 06:51:59,530 INFO L226 Difference]: Without dead ends: 9117 [2019-09-08 06:51:59,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:51:59,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9117 states. [2019-09-08 06:52:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9117 to 9117. [2019-09-08 06:52:00,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9117 states. [2019-09-08 06:52:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 13653 transitions. [2019-09-08 06:52:00,398 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 13653 transitions. Word has length 413 [2019-09-08 06:52:00,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:00,398 INFO L475 AbstractCegarLoop]: Abstraction has 9117 states and 13653 transitions. [2019-09-08 06:52:00,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:00,398 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 13653 transitions. [2019-09-08 06:52:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:52:00,411 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:00,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:52:00,412 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:00,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1881394657, now seen corresponding path program 1 times [2019-09-08 06:52:00,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:00,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:00,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:00,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-09-08 06:52:00,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:00,589 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:52:00,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:00,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 2718 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:00,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 06:52:01,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:01,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:52:01,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:52:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:52:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:01,278 INFO L87 Difference]: Start difference. First operand 9117 states and 13653 transitions. Second operand 7 states. [2019-09-08 06:52:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:03,163 INFO L93 Difference]: Finished difference Result 28539 states and 46879 transitions. [2019-09-08 06:52:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:52:03,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 413 [2019-09-08 06:52:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:03,245 INFO L225 Difference]: With dead ends: 28539 [2019-09-08 06:52:03,245 INFO L226 Difference]: Without dead ends: 19454 [2019-09-08 06:52:03,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:52:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19454 states. [2019-09-08 06:52:06,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19454 to 19396. [2019-09-08 06:52:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19396 states. [2019-09-08 06:52:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 30936 transitions. [2019-09-08 06:52:06,166 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 30936 transitions. Word has length 413 [2019-09-08 06:52:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:06,167 INFO L475 AbstractCegarLoop]: Abstraction has 19396 states and 30936 transitions. [2019-09-08 06:52:06,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:52:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 30936 transitions. [2019-09-08 06:52:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 06:52:06,205 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:06,206 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:52:06,206 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1233643741, now seen corresponding path program 1 times [2019-09-08 06:52:06,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:06,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:06,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:06,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:06,344 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:52:06,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:52:06,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:52:06,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:52:06,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:52:06,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:52:06,346 INFO L87 Difference]: Start difference. First operand 19396 states and 30936 transitions. Second operand 4 states. [2019-09-08 06:52:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:08,364 INFO L93 Difference]: Finished difference Result 38745 states and 61798 transitions. [2019-09-08 06:52:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:08,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 413 [2019-09-08 06:52:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:08,472 INFO L225 Difference]: With dead ends: 38745 [2019-09-08 06:52:08,472 INFO L226 Difference]: Without dead ends: 19381 [2019-09-08 06:52:08,561 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:52:08,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19381 states. [2019-09-08 06:52:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19381 to 19381. [2019-09-08 06:52:10,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19381 states. [2019-09-08 06:52:10,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19381 states to 19381 states and 30906 transitions. [2019-09-08 06:52:10,680 INFO L78 Accepts]: Start accepts. Automaton has 19381 states and 30906 transitions. Word has length 413 [2019-09-08 06:52:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:10,680 INFO L475 AbstractCegarLoop]: Abstraction has 19381 states and 30906 transitions. [2019-09-08 06:52:10,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:10,680 INFO L276 IsEmpty]: Start isEmpty. Operand 19381 states and 30906 transitions. [2019-09-08 06:52:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-09-08 06:52:10,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:10,702 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:10,702 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash -343623814, now seen corresponding path program 1 times [2019-09-08 06:52:10,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 38 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-08 06:52:10,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:10,870 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:52:10,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:11,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 2863 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:11,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 06:52:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:11,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 06:52:11,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:52:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:52:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:52:11,410 INFO L87 Difference]: Start difference. First operand 19381 states and 30906 transitions. Second operand 5 states. [2019-09-08 06:52:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:19,003 INFO L93 Difference]: Finished difference Result 76963 states and 143163 transitions. [2019-09-08 06:52:19,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:52:19,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 447 [2019-09-08 06:52:19,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:19,314 INFO L225 Difference]: With dead ends: 76963 [2019-09-08 06:52:19,314 INFO L226 Difference]: Without dead ends: 57614 [2019-09-08 06:52:19,507 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 451 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:52:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57614 states. [2019-09-08 06:52:27,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57614 to 57368. [2019-09-08 06:52:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-09-08 06:52:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 98191 transitions. [2019-09-08 06:52:27,450 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 98191 transitions. Word has length 447 [2019-09-08 06:52:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:27,451 INFO L475 AbstractCegarLoop]: Abstraction has 57368 states and 98191 transitions. [2019-09-08 06:52:27,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:52:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 98191 transitions. [2019-09-08 06:52:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2019-09-08 06:52:27,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:27,519 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:52:27,520 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1059075153, now seen corresponding path program 1 times [2019-09-08 06:52:27,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:27,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:27,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-09-08 06:52:27,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:52:27,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:52:27,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:52:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:52:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:52:27,714 INFO L87 Difference]: Start difference. First operand 57368 states and 98191 transitions. Second operand 4 states. [2019-09-08 06:52:35,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:35,354 INFO L93 Difference]: Finished difference Result 114690 states and 196311 transitions. [2019-09-08 06:52:35,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:52:35,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 448 [2019-09-08 06:52:35,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:35,678 INFO L225 Difference]: With dead ends: 114690 [2019-09-08 06:52:35,678 INFO L226 Difference]: Without dead ends: 57354 [2019-09-08 06:52:35,909 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:52:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2019-09-08 06:52:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 57354. [2019-09-08 06:52:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57354 states. [2019-09-08 06:52:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57354 states to 57354 states and 98163 transitions. [2019-09-08 06:52:44,661 INFO L78 Accepts]: Start accepts. Automaton has 57354 states and 98163 transitions. Word has length 448 [2019-09-08 06:52:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:52:44,661 INFO L475 AbstractCegarLoop]: Abstraction has 57354 states and 98163 transitions. [2019-09-08 06:52:44,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:52:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 57354 states and 98163 transitions. [2019-09-08 06:52:44,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-09-08 06:52:44,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:52:44,713 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 06:52:44,713 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:52:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:52:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1636827806, now seen corresponding path program 1 times [2019-09-08 06:52:44,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:52:44,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:52:44,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:52:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-08 06:52:44,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:52:44,865 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:52:44,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:52:45,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:52:45,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 2724 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:52:45,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:52:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-08 06:52:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:52:45,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:52:45,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:52:45,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:52:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:52:45,357 INFO L87 Difference]: Start difference. First operand 57354 states and 98163 transitions. Second operand 7 states. [2019-09-08 06:52:58,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:52:58,202 INFO L93 Difference]: Finished difference Result 178613 states and 367215 transitions. [2019-09-08 06:52:58,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:52:58,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 415 [2019-09-08 06:52:58,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:52:58,987 INFO L225 Difference]: With dead ends: 178613 [2019-09-08 06:52:58,988 INFO L226 Difference]: Without dead ends: 121291 [2019-09-08 06:53:03,797 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:53:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121291 states. [2019-09-08 06:53:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121291 to 120963. [2019-09-08 06:53:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120963 states. [2019-09-08 06:53:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120963 states to 120963 states and 233701 transitions. [2019-09-08 06:53:17,742 INFO L78 Accepts]: Start accepts. Automaton has 120963 states and 233701 transitions. Word has length 415 [2019-09-08 06:53:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:53:17,742 INFO L475 AbstractCegarLoop]: Abstraction has 120963 states and 233701 transitions. [2019-09-08 06:53:17,742 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:53:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 120963 states and 233701 transitions. [2019-09-08 06:53:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-09-08 06:53:17,877 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:53:17,877 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 06:53:17,877 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:53:17,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:53:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1852861734, now seen corresponding path program 1 times [2019-09-08 06:53:17,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:53:17,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:53:17,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:17,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:17,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:53:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-09-08 06:53:18,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:53:18,039 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:53:18,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:53:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:53:18,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 2729 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:53:18,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:53:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-08 06:53:19,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:53:19,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:53:19,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:53:19,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:53:19,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:53:19,230 INFO L87 Difference]: Start difference. First operand 120963 states and 233701 transitions. Second operand 7 states. [2019-09-08 06:54:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:54:04,480 INFO L93 Difference]: Finished difference Result 388173 states and 948523 transitions. [2019-09-08 06:54:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:54:04,480 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 416 [2019-09-08 06:54:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:54:06,414 INFO L225 Difference]: With dead ends: 388173 [2019-09-08 06:54:06,414 INFO L226 Difference]: Without dead ends: 267242 [2019-09-08 06:54:09,375 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:54:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267242 states. [2019-09-08 06:55:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267242 to 266590. [2019-09-08 06:55:10,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266590 states. [2019-09-08 06:55:22,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266590 states to 266590 states and 605141 transitions. [2019-09-08 06:55:22,824 INFO L78 Accepts]: Start accepts. Automaton has 266590 states and 605141 transitions. Word has length 416 [2019-09-08 06:55:22,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:55:22,824 INFO L475 AbstractCegarLoop]: Abstraction has 266590 states and 605141 transitions. [2019-09-08 06:55:22,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:55:22,824 INFO L276 IsEmpty]: Start isEmpty. Operand 266590 states and 605141 transitions. [2019-09-08 06:55:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2019-09-08 06:55:23,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:55:23,316 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:55:23,316 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:55:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:55:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 818865169, now seen corresponding path program 1 times [2019-09-08 06:55:23,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:55:23,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:55:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:23,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:55:23,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:55:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:55:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-08 06:55:25,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:55:25,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:55:25,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:55:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:55:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:55:25,068 INFO L87 Difference]: Start difference. First operand 266590 states and 605141 transitions. Second operand 4 states. [2019-09-08 06:56:22,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:56:22,623 INFO L93 Difference]: Finished difference Result 533136 states and 1210209 transitions. [2019-09-08 06:56:22,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:56:22,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 452 [2019-09-08 06:56:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:56:24,447 INFO L225 Difference]: With dead ends: 533136 [2019-09-08 06:56:24,448 INFO L226 Difference]: Without dead ends: 266578 [2019-09-08 06:56:29,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:56:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266578 states. [2019-09-08 06:57:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266578 to 266578. [2019-09-08 06:57:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266578 states. [2019-09-08 06:57:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266578 states to 266578 states and 605112 transitions. [2019-09-08 06:57:43,087 INFO L78 Accepts]: Start accepts. Automaton has 266578 states and 605112 transitions. Word has length 452 [2019-09-08 06:57:43,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:43,087 INFO L475 AbstractCegarLoop]: Abstraction has 266578 states and 605112 transitions. [2019-09-08 06:57:43,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 266578 states and 605112 transitions. [2019-09-08 06:57:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2019-09-08 06:57:43,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:43,567 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:43,567 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:43,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1909260568, now seen corresponding path program 1 times [2019-09-08 06:57:43,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:43,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:43,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:43,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:43,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-08 06:57:43,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:57:43,743 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:57:43,756 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:57:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:44,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 2895 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 06:57:44,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:57:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 06:57:45,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 06:57:45,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-08 06:57:45,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:57:45,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:57:45,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:45,428 INFO L87 Difference]: Start difference. First operand 266578 states and 605112 transitions. Second operand 7 states.