java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:57:24,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:57:24,853 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:57:24,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:57:24,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:57:24,872 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:57:24,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:57:24,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:57:24,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:57:24,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:57:24,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:57:24,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:57:24,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:57:24,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:57:24,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:57:24,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:57:24,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:57:24,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:57:24,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:57:24,911 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:57:24,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:57:24,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:57:24,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:57:24,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:57:24,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:57:24,923 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:57:24,923 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:57:24,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:57:24,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:57:24,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:57:24,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:57:24,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:57:24,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:57:24,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:57:24,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:57:24,932 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:57:24,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:57:24,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:57:24,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:57:24,935 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:57:24,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:57:24,936 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:57:24,959 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:57:24,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:57:24,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:57:24,962 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:57:24,962 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:57:24,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:57:24,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:57:24,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:57:24,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:57:24,963 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:57:24,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:57:24,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:57:24,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:57:24,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:57:24,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:57:24,965 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:57:24,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:57:24,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:57:24,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:57:24,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:57:24,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:57:24,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:57:24,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:57:24,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:57:24,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:57:24,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:57:24,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:57:24,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:57:24,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:57:25,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:57:25,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:57:25,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:57:25,041 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:57:25,042 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:57:25,042 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.12.cil.c [2019-09-08 06:57:25,099 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83093fab/edd6cd39579d4bf6a75f6bc517ef5544/FLAG17bb5dbd0 [2019-09-08 06:57:25,581 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:57:25,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/transmitter.12.cil.c [2019-09-08 06:57:25,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83093fab/edd6cd39579d4bf6a75f6bc517ef5544/FLAG17bb5dbd0 [2019-09-08 06:57:25,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d83093fab/edd6cd39579d4bf6a75f6bc517ef5544 [2019-09-08 06:57:25,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:57:25,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:57:25,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:57:25,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:57:25,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:57:25,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:57:25" (1/1) ... [2019-09-08 06:57:25,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f586b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:25, skipping insertion in model container [2019-09-08 06:57:25,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:57:25" (1/1) ... [2019-09-08 06:57:25,889 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:57:25,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:57:26,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:57:26,332 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:57:26,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:57:26,451 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:57:26,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26 WrapperNode [2019-09-08 06:57:26,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:57:26,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:57:26,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:57:26,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:57:26,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (1/1) ... [2019-09-08 06:57:26,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:57:26,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:57:26,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:57:26,552 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:57:26,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (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:57:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:57:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:57:26,630 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-08 06:57:26,631 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-08 06:57:26,631 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-08 06:57:26,632 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-08 06:57:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-08 06:57:26,633 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-08 06:57:26,634 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-08 06:57:26,634 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-08 06:57:26,635 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-08 06:57:26,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-08 06:57:26,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-08 06:57:26,637 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-08 06:57:26,638 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-08 06:57:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-08 06:57:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-08 06:57:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-08 06:57:26,639 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-08 06:57:26,640 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-08 06:57:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-08 06:57:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-08 06:57:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-08 06:57:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-08 06:57:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-08 06:57:26,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:57:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:57:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:57:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-08 06:57:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-08 06:57:26,642 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-08 06:57:26,643 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-08 06:57:26,644 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-08 06:57:26,645 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-08 06:57:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-08 06:57:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-08 06:57:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-08 06:57:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-08 06:57:26,646 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-08 06:57:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-08 06:57:26,647 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-08 06:57:26,648 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-08 06:57:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-08 06:57:26,649 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-08 06:57:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-08 06:57:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:57:26,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:57:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:57:27,840 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:57:27,841 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-08 06:57:27,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:27 BoogieIcfgContainer [2019-09-08 06:57:27,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:57:27,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:57:27,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:57:27,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:57:27,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:57:25" (1/3) ... [2019-09-08 06:57:27,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f18ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:27, skipping insertion in model container [2019-09-08 06:57:27,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:57:26" (2/3) ... [2019-09-08 06:57:27,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f18ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:27, skipping insertion in model container [2019-09-08 06:57:27,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:27" (3/3) ... [2019-09-08 06:57:27,853 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.12.cil.c [2019-09-08 06:57:27,863 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:57:27,885 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:57:27,903 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:57:27,955 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:57:27,956 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:57:27,957 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:57:27,957 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:57:27,958 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:57:27,958 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:57:27,958 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:57:27,958 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:57:27,958 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:57:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states. [2019-09-08 06:57:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:28,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:28,036 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] [2019-09-08 06:57:28,038 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:28,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash 801551935, now seen corresponding path program 1 times [2019-09-08 06:57:28,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:28,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:28,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:28,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:28,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:57:28,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:28,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:28,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:28,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:28,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:28,596 INFO L87 Difference]: Start difference. First operand 469 states. Second operand 4 states. [2019-09-08 06:57:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:29,076 INFO L93 Difference]: Finished difference Result 918 states and 1420 transitions. [2019-09-08 06:57:29,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:29,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:57:29,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:29,097 INFO L225 Difference]: With dead ends: 918 [2019-09-08 06:57:29,098 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 06:57:29,108 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:57:29,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 06:57:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-09-08 06:57:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 672 transitions. [2019-09-08 06:57:29,211 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 672 transitions. Word has length 240 [2019-09-08 06:57:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:29,214 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 672 transitions. [2019-09-08 06:57:29,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:29,214 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 672 transitions. [2019-09-08 06:57:29,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:29,225 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:29,226 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] [2019-09-08 06:57:29,226 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:29,228 INFO L82 PathProgramCache]: Analyzing trace with hash 25304381, now seen corresponding path program 1 times [2019-09-08 06:57:29,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:29,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:29,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:29,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:29,480 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:57:29,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:29,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:29,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:29,491 INFO L87 Difference]: Start difference. First operand 460 states and 672 transitions. Second operand 4 states. [2019-09-08 06:57:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:29,825 INFO L93 Difference]: Finished difference Result 894 states and 1306 transitions. [2019-09-08 06:57:29,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:29,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:57:29,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:29,834 INFO L225 Difference]: With dead ends: 894 [2019-09-08 06:57:29,835 INFO L226 Difference]: Without dead ends: 460 [2019-09-08 06:57:29,837 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:57:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-09-08 06:57:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2019-09-08 06:57:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:29,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 671 transitions. [2019-09-08 06:57:29,892 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 671 transitions. Word has length 240 [2019-09-08 06:57:29,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:29,893 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 671 transitions. [2019-09-08 06:57:29,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 671 transitions. [2019-09-08 06:57:29,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:29,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:29,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:29,898 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:29,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -220503493, now seen corresponding path program 1 times [2019-09-08 06:57:29,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:29,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:29,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:29,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:29,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:30,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:57:30,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:30,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:30,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:30,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:30,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:30,114 INFO L87 Difference]: Start difference. First operand 460 states and 671 transitions. Second operand 5 states. [2019-09-08 06:57:31,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:31,045 INFO L93 Difference]: Finished difference Result 958 states and 1429 transitions. [2019-09-08 06:57:31,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:31,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:31,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:31,051 INFO L225 Difference]: With dead ends: 958 [2019-09-08 06:57:31,052 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 06:57:31,054 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:57:31,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 06:57:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 460. [2019-09-08 06:57:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 670 transitions. [2019-09-08 06:57:31,085 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 670 transitions. Word has length 240 [2019-09-08 06:57:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:31,086 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 670 transitions. [2019-09-08 06:57:31,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 670 transitions. [2019-09-08 06:57:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:31,090 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:31,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:31,090 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1094169095, now seen corresponding path program 1 times [2019-09-08 06:57:31,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:31,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:31,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:31,279 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:57:31,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:31,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:31,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:31,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:31,281 INFO L87 Difference]: Start difference. First operand 460 states and 670 transitions. Second operand 5 states. [2019-09-08 06:57:32,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:32,131 INFO L93 Difference]: Finished difference Result 958 states and 1428 transitions. [2019-09-08 06:57:32,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:32,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:32,136 INFO L225 Difference]: With dead ends: 958 [2019-09-08 06:57:32,136 INFO L226 Difference]: Without dead ends: 528 [2019-09-08 06:57:32,138 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:57:32,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-09-08 06:57:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 460. [2019-09-08 06:57:32,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 669 transitions. [2019-09-08 06:57:32,166 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 669 transitions. Word has length 240 [2019-09-08 06:57:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:32,166 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 669 transitions. [2019-09-08 06:57:32,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:32,167 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 669 transitions. [2019-09-08 06:57:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:32,171 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:32,171 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] [2019-09-08 06:57:32,171 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:32,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:32,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1815088517, now seen corresponding path program 1 times [2019-09-08 06:57:32,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:32,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:32,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:32,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:32,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:32,339 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:57:32,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:32,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:32,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:32,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:32,341 INFO L87 Difference]: Start difference. First operand 460 states and 669 transitions. Second operand 5 states. [2019-09-08 06:57:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:33,318 INFO L93 Difference]: Finished difference Result 956 states and 1422 transitions. [2019-09-08 06:57:33,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:33,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:33,324 INFO L225 Difference]: With dead ends: 956 [2019-09-08 06:57:33,324 INFO L226 Difference]: Without dead ends: 526 [2019-09-08 06:57:33,326 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:57:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-08 06:57:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 460. [2019-09-08 06:57:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 668 transitions. [2019-09-08 06:57:33,363 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 668 transitions. Word has length 240 [2019-09-08 06:57:33,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:33,364 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 668 transitions. [2019-09-08 06:57:33,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 668 transitions. [2019-09-08 06:57:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:33,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:33,370 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] [2019-09-08 06:57:33,371 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:33,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:33,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1625339321, now seen corresponding path program 1 times [2019-09-08 06:57:33,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:33,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:33,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:33,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:33,535 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:57:33,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:33,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:33,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:33,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:33,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:33,537 INFO L87 Difference]: Start difference. First operand 460 states and 668 transitions. Second operand 5 states. [2019-09-08 06:57:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:34,377 INFO L93 Difference]: Finished difference Result 954 states and 1416 transitions. [2019-09-08 06:57:34,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:34,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:34,387 INFO L225 Difference]: With dead ends: 954 [2019-09-08 06:57:34,387 INFO L226 Difference]: Without dead ends: 524 [2019-09-08 06:57:34,390 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:57:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-09-08 06:57:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 460. [2019-09-08 06:57:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 667 transitions. [2019-09-08 06:57:34,423 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 667 transitions. Word has length 240 [2019-09-08 06:57:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:34,424 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 667 transitions. [2019-09-08 06:57:34,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 667 transitions. [2019-09-08 06:57:34,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:34,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:34,427 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] [2019-09-08 06:57:34,427 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 489394875, now seen corresponding path program 1 times [2019-09-08 06:57:34,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:34,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:34,589 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:57:34,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:34,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:34,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:34,592 INFO L87 Difference]: Start difference. First operand 460 states and 667 transitions. Second operand 5 states. [2019-09-08 06:57:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:35,423 INFO L93 Difference]: Finished difference Result 952 states and 1410 transitions. [2019-09-08 06:57:35,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:35,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:35,427 INFO L225 Difference]: With dead ends: 952 [2019-09-08 06:57:35,427 INFO L226 Difference]: Without dead ends: 522 [2019-09-08 06:57:35,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:35,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-09-08 06:57:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 460. [2019-09-08 06:57:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 666 transitions. [2019-09-08 06:57:35,457 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 666 transitions. Word has length 240 [2019-09-08 06:57:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:35,458 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 666 transitions. [2019-09-08 06:57:35,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 666 transitions. [2019-09-08 06:57:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:35,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:35,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,460 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -378532487, now seen corresponding path program 1 times [2019-09-08 06:57:35,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:35,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:35,568 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:57:35,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:35,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:35,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:35,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:35,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:35,570 INFO L87 Difference]: Start difference. First operand 460 states and 666 transitions. Second operand 5 states. [2019-09-08 06:57:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:36,715 INFO L93 Difference]: Finished difference Result 950 states and 1404 transitions. [2019-09-08 06:57:36,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:36,716 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:36,722 INFO L225 Difference]: With dead ends: 950 [2019-09-08 06:57:36,722 INFO L226 Difference]: Without dead ends: 520 [2019-09-08 06:57:36,725 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:57:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-09-08 06:57:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 460. [2019-09-08 06:57:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:36,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 665 transitions. [2019-09-08 06:57:36,777 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 665 transitions. Word has length 240 [2019-09-08 06:57:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:36,778 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 665 transitions. [2019-09-08 06:57:36,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 665 transitions. [2019-09-08 06:57:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:36,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:36,786 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] [2019-09-08 06:57:36,787 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:36,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:36,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1653456133, now seen corresponding path program 1 times [2019-09-08 06:57:36,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:36,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:36,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:36,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:36,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:36,932 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:57:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:36,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:36,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:36,934 INFO L87 Difference]: Start difference. First operand 460 states and 665 transitions. Second operand 5 states. [2019-09-08 06:57:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:37,752 INFO L93 Difference]: Finished difference Result 946 states and 1394 transitions. [2019-09-08 06:57:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:37,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:37,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:37,757 INFO L225 Difference]: With dead ends: 946 [2019-09-08 06:57:37,757 INFO L226 Difference]: Without dead ends: 516 [2019-09-08 06:57:37,760 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:57:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2019-09-08 06:57:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 460. [2019-09-08 06:57:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 664 transitions. [2019-09-08 06:57:37,820 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 664 transitions. Word has length 240 [2019-09-08 06:57:37,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:37,820 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 664 transitions. [2019-09-08 06:57:37,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 664 transitions. [2019-09-08 06:57:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:37,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:37,823 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] [2019-09-08 06:57:37,823 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:37,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:37,824 INFO L82 PathProgramCache]: Analyzing trace with hash 673706237, now seen corresponding path program 1 times [2019-09-08 06:57:37,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:37,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:37,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:57:37,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:37,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:37,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:37,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:37,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:37,942 INFO L87 Difference]: Start difference. First operand 460 states and 664 transitions. Second operand 5 states. [2019-09-08 06:57:38,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:38,730 INFO L93 Difference]: Finished difference Result 944 states and 1388 transitions. [2019-09-08 06:57:38,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:38,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:38,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:38,735 INFO L225 Difference]: With dead ends: 944 [2019-09-08 06:57:38,735 INFO L226 Difference]: Without dead ends: 514 [2019-09-08 06:57:38,737 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:57:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-09-08 06:57:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 460. [2019-09-08 06:57:38,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:38,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 663 transitions. [2019-09-08 06:57:38,775 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 663 transitions. Word has length 240 [2019-09-08 06:57:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:38,775 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 663 transitions. [2019-09-08 06:57:38,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:38,775 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 663 transitions. [2019-09-08 06:57:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:38,779 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:38,779 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,780 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 887323323, now seen corresponding path program 1 times [2019-09-08 06:57:38,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:38,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:38,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:38,957 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:57:38,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:38,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:38,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:38,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:38,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:38,960 INFO L87 Difference]: Start difference. First operand 460 states and 663 transitions. Second operand 5 states. [2019-09-08 06:57:39,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:39,875 INFO L93 Difference]: Finished difference Result 942 states and 1382 transitions. [2019-09-08 06:57:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:39,876 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:39,880 INFO L225 Difference]: With dead ends: 942 [2019-09-08 06:57:39,880 INFO L226 Difference]: Without dead ends: 512 [2019-09-08 06:57:39,883 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:57:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-09-08 06:57:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 460. [2019-09-08 06:57:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 662 transitions. [2019-09-08 06:57:39,915 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 662 transitions. Word has length 240 [2019-09-08 06:57:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:39,916 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 662 transitions. [2019-09-08 06:57:39,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 662 transitions. [2019-09-08 06:57:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:39,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:39,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] [2019-09-08 06:57:39,919 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:39,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1171308861, now seen corresponding path program 1 times [2019-09-08 06:57:39,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:39,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:39,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:40,037 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:57:40,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:40,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:40,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:40,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:40,042 INFO L87 Difference]: Start difference. First operand 460 states and 662 transitions. Second operand 5 states. [2019-09-08 06:57:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:40,842 INFO L93 Difference]: Finished difference Result 940 states and 1376 transitions. [2019-09-08 06:57:40,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:40,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:40,846 INFO L225 Difference]: With dead ends: 940 [2019-09-08 06:57:40,846 INFO L226 Difference]: Without dead ends: 510 [2019-09-08 06:57:40,849 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:57:40,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-09-08 06:57:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 460. [2019-09-08 06:57:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:40,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 661 transitions. [2019-09-08 06:57:40,880 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 661 transitions. Word has length 240 [2019-09-08 06:57:40,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:40,880 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 661 transitions. [2019-09-08 06:57:40,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:40,880 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 661 transitions. [2019-09-08 06:57:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:40,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:40,882 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] [2019-09-08 06:57:40,883 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:40,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:40,883 INFO L82 PathProgramCache]: Analyzing trace with hash -759192965, now seen corresponding path program 1 times [2019-09-08 06:57:40,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:40,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:40,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:40,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:40,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:41,142 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:57:41,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:41,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:41,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:41,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:41,149 INFO L87 Difference]: Start difference. First operand 460 states and 661 transitions. Second operand 5 states. [2019-09-08 06:57:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:42,325 INFO L93 Difference]: Finished difference Result 938 states and 1370 transitions. [2019-09-08 06:57:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:42,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:42,335 INFO L225 Difference]: With dead ends: 938 [2019-09-08 06:57:42,335 INFO L226 Difference]: Without dead ends: 508 [2019-09-08 06:57:42,338 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:57:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2019-09-08 06:57:42,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 460. [2019-09-08 06:57:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 660 transitions. [2019-09-08 06:57:42,391 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 660 transitions. Word has length 240 [2019-09-08 06:57:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:42,392 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 660 transitions. [2019-09-08 06:57:42,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 660 transitions. [2019-09-08 06:57:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:42,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:42,396 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] [2019-09-08 06:57:42,396 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1810932093, now seen corresponding path program 1 times [2019-09-08 06:57:42,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:42,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:42,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:42,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:42,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:42,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:57:42,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:42,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:42,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:42,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:42,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:42,567 INFO L87 Difference]: Start difference. First operand 460 states and 660 transitions. Second operand 5 states. [2019-09-08 06:57:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:43,535 INFO L93 Difference]: Finished difference Result 936 states and 1364 transitions. [2019-09-08 06:57:43,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:43,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:43,539 INFO L225 Difference]: With dead ends: 936 [2019-09-08 06:57:43,539 INFO L226 Difference]: Without dead ends: 506 [2019-09-08 06:57:43,541 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:57:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-09-08 06:57:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 460. [2019-09-08 06:57:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 659 transitions. [2019-09-08 06:57:43,583 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 659 transitions. Word has length 240 [2019-09-08 06:57:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:43,583 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 659 transitions. [2019-09-08 06:57:43,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 659 transitions. [2019-09-08 06:57:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:43,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:43,586 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] [2019-09-08 06:57:43,587 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:43,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -184370629, now seen corresponding path program 1 times [2019-09-08 06:57:43,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:43,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:43,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:43,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:43,784 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:57:43,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:43,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:43,786 INFO L87 Difference]: Start difference. First operand 460 states and 659 transitions. Second operand 5 states. [2019-09-08 06:57:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:44,665 INFO L93 Difference]: Finished difference Result 983 states and 1450 transitions. [2019-09-08 06:57:44,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:44,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:44,669 INFO L225 Difference]: With dead ends: 983 [2019-09-08 06:57:44,669 INFO L226 Difference]: Without dead ends: 553 [2019-09-08 06:57:44,671 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:57:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2019-09-08 06:57:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 460. [2019-09-08 06:57:44,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 658 transitions. [2019-09-08 06:57:44,707 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 658 transitions. Word has length 240 [2019-09-08 06:57:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:44,708 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 658 transitions. [2019-09-08 06:57:44,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 658 transitions. [2019-09-08 06:57:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:44,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:44,710 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:57:44,710 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:44,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1829474749, now seen corresponding path program 1 times [2019-09-08 06:57:44,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:44,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:44,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:44,811 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:57:44,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:44,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:44,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:44,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:44,812 INFO L87 Difference]: Start difference. First operand 460 states and 658 transitions. Second operand 5 states. [2019-09-08 06:57:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:45,667 INFO L93 Difference]: Finished difference Result 979 states and 1440 transitions. [2019-09-08 06:57:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:45,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:45,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:45,670 INFO L225 Difference]: With dead ends: 979 [2019-09-08 06:57:45,670 INFO L226 Difference]: Without dead ends: 549 [2019-09-08 06:57:45,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:45,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-09-08 06:57:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 460. [2019-09-08 06:57:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 657 transitions. [2019-09-08 06:57:45,710 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 657 transitions. Word has length 240 [2019-09-08 06:57:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:45,711 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 657 transitions. [2019-09-08 06:57:45,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 657 transitions. [2019-09-08 06:57:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:45,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:45,713 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] [2019-09-08 06:57:45,714 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:45,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:45,714 INFO L82 PathProgramCache]: Analyzing trace with hash -251108929, now seen corresponding path program 1 times [2019-09-08 06:57:45,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:45,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:45,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:45,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:45,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:45,839 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:57:45,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:45,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:45,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:45,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:45,841 INFO L87 Difference]: Start difference. First operand 460 states and 657 transitions. Second operand 5 states. [2019-09-08 06:57:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:46,722 INFO L93 Difference]: Finished difference Result 977 states and 1434 transitions. [2019-09-08 06:57:46,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:46,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:46,726 INFO L225 Difference]: With dead ends: 977 [2019-09-08 06:57:46,726 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 06:57:46,728 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:57:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 06:57:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 460. [2019-09-08 06:57:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2019-09-08 06:57:46,768 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 240 [2019-09-08 06:57:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:46,769 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2019-09-08 06:57:46,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2019-09-08 06:57:46,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:46,771 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:46,771 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] [2019-09-08 06:57:46,771 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:46,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:46,772 INFO L82 PathProgramCache]: Analyzing trace with hash 235964797, now seen corresponding path program 1 times [2019-09-08 06:57:46,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:46,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:46,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:46,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:46,876 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:57:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:46,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:46,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:46,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:46,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:46,878 INFO L87 Difference]: Start difference. First operand 460 states and 656 transitions. Second operand 5 states. [2019-09-08 06:57:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:47,694 INFO L93 Difference]: Finished difference Result 975 states and 1428 transitions. [2019-09-08 06:57:47,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:47,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:47,698 INFO L225 Difference]: With dead ends: 975 [2019-09-08 06:57:47,699 INFO L226 Difference]: Without dead ends: 545 [2019-09-08 06:57:47,700 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2019-09-08 06:57:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 460. [2019-09-08 06:57:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 655 transitions. [2019-09-08 06:57:47,740 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 655 transitions. Word has length 240 [2019-09-08 06:57:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:47,740 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 655 transitions. [2019-09-08 06:57:47,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 655 transitions. [2019-09-08 06:57:47,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:47,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:47,742 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] [2019-09-08 06:57:47,743 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:47,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:47,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1549438465, now seen corresponding path program 1 times [2019-09-08 06:57:47,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:47,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:47,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:47,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:47,902 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:57:47,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:47,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:47,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:47,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:47,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:47,904 INFO L87 Difference]: Start difference. First operand 460 states and 655 transitions. Second operand 5 states. [2019-09-08 06:57:48,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:48,741 INFO L93 Difference]: Finished difference Result 973 states and 1422 transitions. [2019-09-08 06:57:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:48,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:48,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:48,745 INFO L225 Difference]: With dead ends: 973 [2019-09-08 06:57:48,745 INFO L226 Difference]: Without dead ends: 543 [2019-09-08 06:57:48,747 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:57:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-09-08 06:57:48,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 460. [2019-09-08 06:57:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:48,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 654 transitions. [2019-09-08 06:57:48,787 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 654 transitions. Word has length 240 [2019-09-08 06:57:48,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:48,788 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 654 transitions. [2019-09-08 06:57:48,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 654 transitions. [2019-09-08 06:57:48,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:48,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:48,790 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] [2019-09-08 06:57:48,790 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:48,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2022674115, now seen corresponding path program 1 times [2019-09-08 06:57:48,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:48,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:48,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:48,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:48,882 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:57:48,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:48,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:48,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:48,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:48,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:48,884 INFO L87 Difference]: Start difference. First operand 460 states and 654 transitions. Second operand 5 states. [2019-09-08 06:57:49,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:49,724 INFO L93 Difference]: Finished difference Result 971 states and 1416 transitions. [2019-09-08 06:57:49,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:49,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:49,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:49,728 INFO L225 Difference]: With dead ends: 971 [2019-09-08 06:57:49,728 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 06:57:49,730 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:57:49,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 06:57:49,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 460. [2019-09-08 06:57:49,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 653 transitions. [2019-09-08 06:57:49,772 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 653 transitions. Word has length 240 [2019-09-08 06:57:49,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:49,772 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 653 transitions. [2019-09-08 06:57:49,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:49,772 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 653 transitions. [2019-09-08 06:57:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:49,774 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:49,774 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] [2019-09-08 06:57:49,775 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1899392449, now seen corresponding path program 1 times [2019-09-08 06:57:49,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:49,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:49,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:49,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:57:49,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:49,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:49,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:49,869 INFO L87 Difference]: Start difference. First operand 460 states and 653 transitions. Second operand 5 states. [2019-09-08 06:57:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:50,756 INFO L93 Difference]: Finished difference Result 969 states and 1410 transitions. [2019-09-08 06:57:50,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:50,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:50,760 INFO L225 Difference]: With dead ends: 969 [2019-09-08 06:57:50,760 INFO L226 Difference]: Without dead ends: 539 [2019-09-08 06:57:50,761 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:57:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-09-08 06:57:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 460. [2019-09-08 06:57:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:50,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 652 transitions. [2019-09-08 06:57:50,805 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 652 transitions. Word has length 240 [2019-09-08 06:57:50,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:50,806 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 652 transitions. [2019-09-08 06:57:50,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 652 transitions. [2019-09-08 06:57:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:50,808 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:50,808 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] [2019-09-08 06:57:50,808 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:50,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash 321341693, now seen corresponding path program 1 times [2019-09-08 06:57:50,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:50,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:50,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:50,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:50,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:50,905 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:57:50,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:50,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:50,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:50,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:50,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:50,907 INFO L87 Difference]: Start difference. First operand 460 states and 652 transitions. Second operand 5 states. [2019-09-08 06:57:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:51,732 INFO L93 Difference]: Finished difference Result 967 states and 1404 transitions. [2019-09-08 06:57:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:51,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:51,738 INFO L225 Difference]: With dead ends: 967 [2019-09-08 06:57:51,738 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 06:57:51,740 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:57:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 06:57:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 460. [2019-09-08 06:57:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 651 transitions. [2019-09-08 06:57:51,786 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 651 transitions. Word has length 240 [2019-09-08 06:57:51,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:51,786 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 651 transitions. [2019-09-08 06:57:51,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 651 transitions. [2019-09-08 06:57:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:51,788 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:51,789 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] [2019-09-08 06:57:51,789 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:51,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:51,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1224262271, now seen corresponding path program 1 times [2019-09-08 06:57:51,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:51,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:51,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:51,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:51,883 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:57:51,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:51,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:51,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:51,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:51,885 INFO L87 Difference]: Start difference. First operand 460 states and 651 transitions. Second operand 5 states. [2019-09-08 06:57:52,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:52,774 INFO L93 Difference]: Finished difference Result 963 states and 1394 transitions. [2019-09-08 06:57:52,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:52,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:52,778 INFO L225 Difference]: With dead ends: 963 [2019-09-08 06:57:52,778 INFO L226 Difference]: Without dead ends: 533 [2019-09-08 06:57:52,779 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:57:52,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-09-08 06:57:52,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 460. [2019-09-08 06:57:52,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 650 transitions. [2019-09-08 06:57:52,829 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 650 transitions. Word has length 240 [2019-09-08 06:57:52,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:52,829 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 650 transitions. [2019-09-08 06:57:52,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:52,829 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 650 transitions. [2019-09-08 06:57:52,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:52,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:52,831 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] [2019-09-08 06:57:52,832 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:52,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:52,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1216263297, now seen corresponding path program 1 times [2019-09-08 06:57:52,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:52,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:52,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:52,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:52,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:57:52,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:57:52,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:57:52,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:57:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:57:52,926 INFO L87 Difference]: Start difference. First operand 460 states and 650 transitions. Second operand 5 states. [2019-09-08 06:57:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:53,761 INFO L93 Difference]: Finished difference Result 961 states and 1388 transitions. [2019-09-08 06:57:53,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:57:53,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:57:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:53,765 INFO L225 Difference]: With dead ends: 961 [2019-09-08 06:57:53,766 INFO L226 Difference]: Without dead ends: 531 [2019-09-08 06:57:53,767 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:57:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2019-09-08 06:57:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 460. [2019-09-08 06:57:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2019-09-08 06:57:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 649 transitions. [2019-09-08 06:57:53,816 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 649 transitions. Word has length 240 [2019-09-08 06:57:53,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:53,816 INFO L475 AbstractCegarLoop]: Abstraction has 460 states and 649 transitions. [2019-09-08 06:57:53,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:57:53,816 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 649 transitions. [2019-09-08 06:57:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:53,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:53,818 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] [2019-09-08 06:57:53,819 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1554941377, now seen corresponding path program 1 times [2019-09-08 06:57:53,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:53,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:53,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:53,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:53,928 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:57:53,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:53,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:53,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:53,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:53,930 INFO L87 Difference]: Start difference. First operand 460 states and 649 transitions. Second operand 4 states. [2019-09-08 06:57:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:54,372 INFO L93 Difference]: Finished difference Result 1310 states and 1906 transitions. [2019-09-08 06:57:54,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:54,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:57:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:54,379 INFO L225 Difference]: With dead ends: 1310 [2019-09-08 06:57:54,379 INFO L226 Difference]: Without dead ends: 881 [2019-09-08 06:57:54,381 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:57:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-09-08 06:57:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 876. [2019-09-08 06:57:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-09-08 06:57:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1235 transitions. [2019-09-08 06:57:54,480 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1235 transitions. Word has length 240 [2019-09-08 06:57:54,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:54,481 INFO L475 AbstractCegarLoop]: Abstraction has 876 states and 1235 transitions. [2019-09-08 06:57:54,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:54,481 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1235 transitions. [2019-09-08 06:57:54,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:54,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:54,483 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,483 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1564437376, now seen corresponding path program 1 times [2019-09-08 06:57:54,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:54,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:54,598 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:57:54,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:54,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:54,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:54,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:54,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:54,601 INFO L87 Difference]: Start difference. First operand 876 states and 1235 transitions. Second operand 6 states. [2019-09-08 06:57:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:54,745 INFO L93 Difference]: Finished difference Result 1764 states and 2551 transitions. [2019-09-08 06:57:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:54,746 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:54,750 INFO L225 Difference]: With dead ends: 1764 [2019-09-08 06:57:54,750 INFO L226 Difference]: Without dead ends: 919 [2019-09-08 06:57:54,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-09-08 06:57:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 881. [2019-09-08 06:57:54,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-09-08 06:57:54,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1239 transitions. [2019-09-08 06:57:54,849 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1239 transitions. Word has length 240 [2019-09-08 06:57:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:54,849 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1239 transitions. [2019-09-08 06:57:54,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1239 transitions. [2019-09-08 06:57:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:54,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:54,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,852 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:54,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:54,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2081937150, now seen corresponding path program 1 times [2019-09-08 06:57:54,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:54,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:54,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:54,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:57:54,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:54,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:54,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:54,948 INFO L87 Difference]: Start difference. First operand 881 states and 1239 transitions. Second operand 4 states. [2019-09-08 06:57:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:55,546 INFO L93 Difference]: Finished difference Result 2568 states and 3727 transitions. [2019-09-08 06:57:55,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:57:55,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:57:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:55,554 INFO L225 Difference]: With dead ends: 2568 [2019-09-08 06:57:55,555 INFO L226 Difference]: Without dead ends: 1718 [2019-09-08 06:57:55,558 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:57:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2019-09-08 06:57:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1711. [2019-09-08 06:57:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1711 states. [2019-09-08 06:57:55,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2404 transitions. [2019-09-08 06:57:55,766 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2404 transitions. Word has length 240 [2019-09-08 06:57:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:55,767 INFO L475 AbstractCegarLoop]: Abstraction has 1711 states and 2404 transitions. [2019-09-08 06:57:55,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:57:55,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2404 transitions. [2019-09-08 06:57:55,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:55,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:55,770 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] [2019-09-08 06:57:55,770 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:55,771 INFO L82 PathProgramCache]: Analyzing trace with hash -129590623, now seen corresponding path program 1 times [2019-09-08 06:57:55,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:55,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:55,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:55,871 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:57:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:55,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:55,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:55,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:55,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:55,873 INFO L87 Difference]: Start difference. First operand 1711 states and 2404 transitions. Second operand 6 states. [2019-09-08 06:57:56,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:56,116 INFO L93 Difference]: Finished difference Result 3471 states and 5003 transitions. [2019-09-08 06:57:56,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:56,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:56,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:56,127 INFO L225 Difference]: With dead ends: 3471 [2019-09-08 06:57:56,128 INFO L226 Difference]: Without dead ends: 1791 [2019-09-08 06:57:56,134 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-09-08 06:57:56,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1721. [2019-09-08 06:57:56,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1721 states. [2019-09-08 06:57:56,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2412 transitions. [2019-09-08 06:57:56,374 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2412 transitions. Word has length 240 [2019-09-08 06:57:56,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:56,375 INFO L475 AbstractCegarLoop]: Abstraction has 1721 states and 2412 transitions. [2019-09-08 06:57:56,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2412 transitions. [2019-09-08 06:57:56,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:56,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:56,377 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] [2019-09-08 06:57:56,377 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:56,378 INFO L82 PathProgramCache]: Analyzing trace with hash 440681183, now seen corresponding path program 1 times [2019-09-08 06:57:56,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:56,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:56,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:56,460 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:57:56,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:56,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:56,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:56,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:56,462 INFO L87 Difference]: Start difference. First operand 1721 states and 2412 transitions. Second operand 6 states. [2019-09-08 06:57:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:56,704 INFO L93 Difference]: Finished difference Result 3559 states and 5130 transitions. [2019-09-08 06:57:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:56,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:56,717 INFO L225 Difference]: With dead ends: 3559 [2019-09-08 06:57:56,717 INFO L226 Difference]: Without dead ends: 1869 [2019-09-08 06:57:56,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-08 06:57:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1741. [2019-09-08 06:57:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-09-08 06:57:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2432 transitions. [2019-09-08 06:57:56,931 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2432 transitions. Word has length 240 [2019-09-08 06:57:56,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:56,932 INFO L475 AbstractCegarLoop]: Abstraction has 1741 states and 2432 transitions. [2019-09-08 06:57:56,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:56,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2432 transitions. [2019-09-08 06:57:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:56,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:56,934 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] [2019-09-08 06:57:56,935 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash -964510495, now seen corresponding path program 1 times [2019-09-08 06:57:56,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:56,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:56,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:56,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:57,028 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:57:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:57,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:57,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:57,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:57,031 INFO L87 Difference]: Start difference. First operand 1741 states and 2432 transitions. Second operand 6 states. [2019-09-08 06:57:57,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:57,352 INFO L93 Difference]: Finished difference Result 3587 states and 5150 transitions. [2019-09-08 06:57:57,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:57,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:57,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:57,363 INFO L225 Difference]: With dead ends: 3587 [2019-09-08 06:57:57,363 INFO L226 Difference]: Without dead ends: 1877 [2019-09-08 06:57:57,369 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-09-08 06:57:57,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1761. [2019-09-08 06:57:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1761 states. [2019-09-08 06:57:57,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1761 states to 1761 states and 2452 transitions. [2019-09-08 06:57:57,579 INFO L78 Accepts]: Start accepts. Automaton has 1761 states and 2452 transitions. Word has length 240 [2019-09-08 06:57:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:57,582 INFO L475 AbstractCegarLoop]: Abstraction has 1761 states and 2452 transitions. [2019-09-08 06:57:57,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:57,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1761 states and 2452 transitions. [2019-09-08 06:57:57,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:57,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:57,586 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] [2019-09-08 06:57:57,586 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:57,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash -626222945, now seen corresponding path program 1 times [2019-09-08 06:57:57,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:57,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:57,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:57:57,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:57,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:57,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:57,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:57,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:57,720 INFO L87 Difference]: Start difference. First operand 1761 states and 2452 transitions. Second operand 6 states. [2019-09-08 06:57:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:57,935 INFO L93 Difference]: Finished difference Result 3615 states and 5170 transitions. [2019-09-08 06:57:57,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:57,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:57,945 INFO L225 Difference]: With dead ends: 3615 [2019-09-08 06:57:57,945 INFO L226 Difference]: Without dead ends: 1885 [2019-09-08 06:57:57,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2019-09-08 06:57:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1781. [2019-09-08 06:57:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1781 states. [2019-09-08 06:57:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2472 transitions. [2019-09-08 06:57:58,144 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2472 transitions. Word has length 240 [2019-09-08 06:57:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:58,144 INFO L475 AbstractCegarLoop]: Abstraction has 1781 states and 2472 transitions. [2019-09-08 06:57:58,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2472 transitions. [2019-09-08 06:57:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:58,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:58,147 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] [2019-09-08 06:57:58,147 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:58,147 INFO L82 PathProgramCache]: Analyzing trace with hash 772730657, now seen corresponding path program 1 times [2019-09-08 06:57:58,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:58,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:58,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:58,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:58,244 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:57:58,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:58,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:58,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:58,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:58,245 INFO L87 Difference]: Start difference. First operand 1781 states and 2472 transitions. Second operand 6 states. [2019-09-08 06:57:58,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:58,454 INFO L93 Difference]: Finished difference Result 3643 states and 5190 transitions. [2019-09-08 06:57:58,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:58,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:58,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:58,464 INFO L225 Difference]: With dead ends: 3643 [2019-09-08 06:57:58,465 INFO L226 Difference]: Without dead ends: 1893 [2019-09-08 06:57:58,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:58,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2019-09-08 06:57:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1801. [2019-09-08 06:57:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2019-09-08 06:57:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2492 transitions. [2019-09-08 06:57:58,676 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2492 transitions. Word has length 240 [2019-09-08 06:57:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:58,676 INFO L475 AbstractCegarLoop]: Abstraction has 1801 states and 2492 transitions. [2019-09-08 06:57:58,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2492 transitions. [2019-09-08 06:57:58,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:58,679 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:58,679 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] [2019-09-08 06:57:58,679 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 343072351, now seen corresponding path program 1 times [2019-09-08 06:57:58,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:58,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:58,764 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:57:58,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:58,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:57:58,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:57:58,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:57:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:57:58,766 INFO L87 Difference]: Start difference. First operand 1801 states and 2492 transitions. Second operand 6 states. [2019-09-08 06:57:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:57:59,030 INFO L93 Difference]: Finished difference Result 3671 states and 5210 transitions. [2019-09-08 06:57:59,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:57:59,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:57:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:57:59,038 INFO L225 Difference]: With dead ends: 3671 [2019-09-08 06:57:59,038 INFO L226 Difference]: Without dead ends: 1901 [2019-09-08 06:57:59,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:57:59,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-09-08 06:57:59,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1821. [2019-09-08 06:57:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2019-09-08 06:57:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2512 transitions. [2019-09-08 06:57:59,237 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2512 transitions. Word has length 240 [2019-09-08 06:57:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:57:59,239 INFO L475 AbstractCegarLoop]: Abstraction has 1821 states and 2512 transitions. [2019-09-08 06:57:59,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:57:59,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2512 transitions. [2019-09-08 06:57:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:57:59,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:57:59,241 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] [2019-09-08 06:57:59,241 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:57:59,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:57:59,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1378930335, now seen corresponding path program 1 times [2019-09-08 06:57:59,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:57:59,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:57:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:59,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:57:59,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:57:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:57:59,351 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:57:59,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:57:59,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:57:59,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:57:59,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:57:59,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:57:59,353 INFO L87 Difference]: Start difference. First operand 1821 states and 2512 transitions. Second operand 4 states. [2019-09-08 06:58:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:00,006 INFO L93 Difference]: Finished difference Result 5376 states and 7648 transitions. [2019-09-08 06:58:00,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:58:00,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:58:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:00,019 INFO L225 Difference]: With dead ends: 5376 [2019-09-08 06:58:00,020 INFO L226 Difference]: Without dead ends: 3586 [2019-09-08 06:58:00,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-09-08 06:58:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3575. [2019-09-08 06:58:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3575 states. [2019-09-08 06:58:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3575 states to 3575 states and 4928 transitions. [2019-09-08 06:58:00,318 INFO L78 Accepts]: Start accepts. Automaton has 3575 states and 4928 transitions. Word has length 240 [2019-09-08 06:58:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:00,318 INFO L475 AbstractCegarLoop]: Abstraction has 3575 states and 4928 transitions. [2019-09-08 06:58:00,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:58:00,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3575 states and 4928 transitions. [2019-09-08 06:58:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:00,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:00,321 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] [2019-09-08 06:58:00,321 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:00,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:00,321 INFO L82 PathProgramCache]: Analyzing trace with hash 71688256, now seen corresponding path program 1 times [2019-09-08 06:58:00,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:00,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:00,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:00,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:00,417 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:58:00,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:00,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:00,418 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:00,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:00,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:00,418 INFO L87 Difference]: Start difference. First operand 3575 states and 4928 transitions. Second operand 6 states. [2019-09-08 06:58:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:00,759 INFO L93 Difference]: Finished difference Result 7207 states and 10171 transitions. [2019-09-08 06:58:00,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:00,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:00,773 INFO L225 Difference]: With dead ends: 7207 [2019-09-08 06:58:00,773 INFO L226 Difference]: Without dead ends: 3663 [2019-09-08 06:58:00,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3663 states. [2019-09-08 06:58:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3663 to 3595. [2019-09-08 06:58:01,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3595 states. [2019-09-08 06:58:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 4944 transitions. [2019-09-08 06:58:01,172 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 4944 transitions. Word has length 240 [2019-09-08 06:58:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:01,173 INFO L475 AbstractCegarLoop]: Abstraction has 3595 states and 4944 transitions. [2019-09-08 06:58:01,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 4944 transitions. [2019-09-08 06:58:01,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:01,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:01,175 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] [2019-09-08 06:58:01,175 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:01,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1901477122, now seen corresponding path program 1 times [2019-09-08 06:58:01,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:01,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:01,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:01,271 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:58:01,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:01,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:58:01,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:58:01,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:58:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:01,273 INFO L87 Difference]: Start difference. First operand 3595 states and 4944 transitions. Second operand 4 states. [2019-09-08 06:58:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:02,222 INFO L93 Difference]: Finished difference Result 10674 states and 15158 transitions. [2019-09-08 06:58:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:58:02,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:58:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:02,250 INFO L225 Difference]: With dead ends: 10674 [2019-09-08 06:58:02,250 INFO L226 Difference]: Without dead ends: 7110 [2019-09-08 06:58:02,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:02,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7110 states. [2019-09-08 06:58:02,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7110 to 7091. [2019-09-08 06:58:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7091 states. [2019-09-08 06:58:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7091 states to 7091 states and 9754 transitions. [2019-09-08 06:58:02,872 INFO L78 Accepts]: Start accepts. Automaton has 7091 states and 9754 transitions. Word has length 240 [2019-09-08 06:58:02,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:02,873 INFO L475 AbstractCegarLoop]: Abstraction has 7091 states and 9754 transitions. [2019-09-08 06:58:02,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:58:02,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7091 states and 9754 transitions. [2019-09-08 06:58:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:02,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:02,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] [2019-09-08 06:58:02,875 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:02,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:02,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1614017217, now seen corresponding path program 1 times [2019-09-08 06:58:02,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:02,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:02,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:02,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:02,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:02,964 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:58:02,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:02,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:02,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:02,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:02,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:02,966 INFO L87 Difference]: Start difference. First operand 7091 states and 9754 transitions. Second operand 6 states. [2019-09-08 06:58:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:03,596 INFO L93 Difference]: Finished difference Result 14303 states and 20153 transitions. [2019-09-08 06:58:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:03,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:03,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:03,624 INFO L225 Difference]: With dead ends: 14303 [2019-09-08 06:58:03,624 INFO L226 Difference]: Without dead ends: 7243 [2019-09-08 06:58:03,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7243 states. [2019-09-08 06:58:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7243 to 7131. [2019-09-08 06:58:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7131 states. [2019-09-08 06:58:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7131 states to 7131 states and 9786 transitions. [2019-09-08 06:58:04,258 INFO L78 Accepts]: Start accepts. Automaton has 7131 states and 9786 transitions. Word has length 240 [2019-09-08 06:58:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:04,258 INFO L475 AbstractCegarLoop]: Abstraction has 7131 states and 9786 transitions. [2019-09-08 06:58:04,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 7131 states and 9786 transitions. [2019-09-08 06:58:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:04,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:04,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:04,261 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:04,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:04,261 INFO L82 PathProgramCache]: Analyzing trace with hash -582976319, now seen corresponding path program 1 times [2019-09-08 06:58:04,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:04,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:04,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:04,348 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:58:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:04,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:04,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:04,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:04,352 INFO L87 Difference]: Start difference. First operand 7131 states and 9786 transitions. Second operand 6 states. [2019-09-08 06:58:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:05,520 INFO L93 Difference]: Finished difference Result 14487 states and 20378 transitions. [2019-09-08 06:58:05,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:05,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:05,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:05,543 INFO L225 Difference]: With dead ends: 14487 [2019-09-08 06:58:05,543 INFO L226 Difference]: Without dead ends: 7387 [2019-09-08 06:58:05,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:05,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7387 states. [2019-09-08 06:58:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7387 to 7211. [2019-09-08 06:58:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7211 states. [2019-09-08 06:58:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7211 states to 7211 states and 9866 transitions. [2019-09-08 06:58:06,112 INFO L78 Accepts]: Start accepts. Automaton has 7211 states and 9866 transitions. Word has length 240 [2019-09-08 06:58:06,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:06,112 INFO L475 AbstractCegarLoop]: Abstraction has 7211 states and 9866 transitions. [2019-09-08 06:58:06,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7211 states and 9866 transitions. [2019-09-08 06:58:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:06,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:06,114 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:06,114 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:06,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:06,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1294086911, now seen corresponding path program 1 times [2019-09-08 06:58:06,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:06,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:06,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:06,207 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:58:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:06,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:06,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:06,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:06,208 INFO L87 Difference]: Start difference. First operand 7211 states and 9866 transitions. Second operand 6 states. [2019-09-08 06:58:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:06,805 INFO L93 Difference]: Finished difference Result 14599 states and 20458 transitions. [2019-09-08 06:58:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:06,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:06,828 INFO L225 Difference]: With dead ends: 14599 [2019-09-08 06:58:06,828 INFO L226 Difference]: Without dead ends: 7419 [2019-09-08 06:58:06,843 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7419 states. [2019-09-08 06:58:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7419 to 7291. [2019-09-08 06:58:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2019-09-08 06:58:07,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 9946 transitions. [2019-09-08 06:58:07,380 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 9946 transitions. Word has length 240 [2019-09-08 06:58:07,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:07,380 INFO L475 AbstractCegarLoop]: Abstraction has 7291 states and 9946 transitions. [2019-09-08 06:58:07,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 9946 transitions. [2019-09-08 06:58:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:07,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:07,383 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] [2019-09-08 06:58:07,383 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 236248833, now seen corresponding path program 1 times [2019-09-08 06:58:07,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:07,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:07,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:07,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:07,477 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:58:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:07,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 06:58:07,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 06:58:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 06:58:07,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:07,478 INFO L87 Difference]: Start difference. First operand 7291 states and 9946 transitions. Second operand 4 states. [2019-09-08 06:58:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:08,952 INFO L93 Difference]: Finished difference Result 21714 states and 30630 transitions. [2019-09-08 06:58:08,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 06:58:08,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-08 06:58:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:09,001 INFO L225 Difference]: With dead ends: 21714 [2019-09-08 06:58:09,002 INFO L226 Difference]: Without dead ends: 14454 [2019-09-08 06:58:09,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 06:58:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14454 states. [2019-09-08 06:58:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14454 to 14419. [2019-09-08 06:58:10,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14419 states. [2019-09-08 06:58:10,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14419 states to 14419 states and 19700 transitions. [2019-09-08 06:58:10,417 INFO L78 Accepts]: Start accepts. Automaton has 14419 states and 19700 transitions. Word has length 240 [2019-09-08 06:58:10,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:10,418 INFO L475 AbstractCegarLoop]: Abstraction has 14419 states and 19700 transitions. [2019-09-08 06:58:10,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 06:58:10,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14419 states and 19700 transitions. [2019-09-08 06:58:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:10,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:10,420 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] [2019-09-08 06:58:10,420 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:10,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1040903840, now seen corresponding path program 1 times [2019-09-08 06:58:10,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:10,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:10,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:10,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:10,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:10,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:58:10,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:10,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:10,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:10,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:10,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:10,513 INFO L87 Difference]: Start difference. First operand 14419 states and 19700 transitions. Second operand 6 states. [2019-09-08 06:58:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:11,789 INFO L93 Difference]: Finished difference Result 28967 states and 40543 transitions. [2019-09-08 06:58:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:11,789 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:11,833 INFO L225 Difference]: With dead ends: 28967 [2019-09-08 06:58:11,833 INFO L226 Difference]: Without dead ends: 14579 [2019-09-08 06:58:11,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14579 states. [2019-09-08 06:58:12,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14579 to 14499. [2019-09-08 06:58:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14499 states. [2019-09-08 06:58:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14499 states to 14499 states and 19764 transitions. [2019-09-08 06:58:13,015 INFO L78 Accepts]: Start accepts. Automaton has 14499 states and 19764 transitions. Word has length 240 [2019-09-08 06:58:13,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:13,015 INFO L475 AbstractCegarLoop]: Abstraction has 14499 states and 19764 transitions. [2019-09-08 06:58:13,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:13,015 INFO L276 IsEmpty]: Start isEmpty. Operand 14499 states and 19764 transitions. [2019-09-08 06:58:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:13,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:13,017 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:13,017 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:13,017 INFO L82 PathProgramCache]: Analyzing trace with hash -964003042, now seen corresponding path program 1 times [2019-09-08 06:58:13,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:13,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:13,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:13,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:58:13,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:13,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 06:58:13,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 06:58:13,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 06:58:13,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:13,113 INFO L87 Difference]: Start difference. First operand 14499 states and 19764 transitions. Second operand 6 states. [2019-09-08 06:58:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:14,707 INFO L93 Difference]: Finished difference Result 29191 states and 40752 transitions. [2019-09-08 06:58:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:14,708 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-09-08 06:58:14,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:14,756 INFO L225 Difference]: With dead ends: 29191 [2019-09-08 06:58:14,756 INFO L226 Difference]: Without dead ends: 14723 [2019-09-08 06:58:14,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14723 states. [2019-09-08 06:58:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14723 to 14659. [2019-09-08 06:58:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14659 states. [2019-09-08 06:58:16,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14659 states to 14659 states and 19924 transitions. [2019-09-08 06:58:16,063 INFO L78 Accepts]: Start accepts. Automaton has 14659 states and 19924 transitions. Word has length 240 [2019-09-08 06:58:16,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:16,063 INFO L475 AbstractCegarLoop]: Abstraction has 14659 states and 19924 transitions. [2019-09-08 06:58:16,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 06:58:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 14659 states and 19924 transitions. [2019-09-08 06:58:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:16,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:16,065 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] [2019-09-08 06:58:16,065 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:16,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1381399648, now seen corresponding path program 1 times [2019-09-08 06:58:16,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:16,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:16,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:16,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:16,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:58:16,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:16,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:16,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:16,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:16,170 INFO L87 Difference]: Start difference. First operand 14659 states and 19924 transitions. Second operand 5 states. [2019-09-08 06:58:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:19,105 INFO L93 Difference]: Finished difference Result 36342 states and 49825 transitions. [2019-09-08 06:58:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:58:19,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:19,173 INFO L225 Difference]: With dead ends: 36342 [2019-09-08 06:58:19,174 INFO L226 Difference]: Without dead ends: 21715 [2019-09-08 06:58:19,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:58:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21715 states. [2019-09-08 06:58:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21715 to 20787. [2019-09-08 06:58:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-09-08 06:58:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 27316 transitions. [2019-09-08 06:58:20,694 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 27316 transitions. Word has length 240 [2019-09-08 06:58:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:20,694 INFO L475 AbstractCegarLoop]: Abstraction has 20787 states and 27316 transitions. [2019-09-08 06:58:20,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:20,695 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 27316 transitions. [2019-09-08 06:58:20,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:20,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:20,696 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] [2019-09-08 06:58:20,696 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:20,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:20,697 INFO L82 PathProgramCache]: Analyzing trace with hash -820699870, now seen corresponding path program 1 times [2019-09-08 06:58:20,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:20,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:20,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:20,813 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:58:20,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:20,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:20,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:20,816 INFO L87 Difference]: Start difference. First operand 20787 states and 27316 transitions. Second operand 5 states. [2019-09-08 06:58:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:23,167 INFO L93 Difference]: Finished difference Result 41542 states and 54682 transitions. [2019-09-08 06:58:23,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:23,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:23,228 INFO L225 Difference]: With dead ends: 41542 [2019-09-08 06:58:23,229 INFO L226 Difference]: Without dead ends: 20787 [2019-09-08 06:58:23,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:23,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20787 states. [2019-09-08 06:58:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20787 to 20787. [2019-09-08 06:58:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-09-08 06:58:24,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 27236 transitions. [2019-09-08 06:58:24,967 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 27236 transitions. Word has length 240 [2019-09-08 06:58:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:24,967 INFO L475 AbstractCegarLoop]: Abstraction has 20787 states and 27236 transitions. [2019-09-08 06:58:24,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 27236 transitions. [2019-09-08 06:58:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:24,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:24,969 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] [2019-09-08 06:58:24,969 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash -386970784, now seen corresponding path program 1 times [2019-09-08 06:58:24,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:25,063 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:58:25,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:25,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:25,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:25,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:25,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:25,064 INFO L87 Difference]: Start difference. First operand 20787 states and 27236 transitions. Second operand 5 states. [2019-09-08 06:58:27,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:27,488 INFO L93 Difference]: Finished difference Result 41542 states and 54522 transitions. [2019-09-08 06:58:27,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:27,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:27,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:27,531 INFO L225 Difference]: With dead ends: 41542 [2019-09-08 06:58:27,532 INFO L226 Difference]: Without dead ends: 20787 [2019-09-08 06:58:27,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:27,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20787 states. [2019-09-08 06:58:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20787 to 20787. [2019-09-08 06:58:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-09-08 06:58:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 27156 transitions. [2019-09-08 06:58:28,956 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 27156 transitions. Word has length 240 [2019-09-08 06:58:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:28,957 INFO L475 AbstractCegarLoop]: Abstraction has 20787 states and 27156 transitions. [2019-09-08 06:58:28,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 27156 transitions. [2019-09-08 06:58:28,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:28,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:28,958 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] [2019-09-08 06:58:28,958 INFO L418 AbstractCegarLoop]: === Iteration 46 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:28,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:28,959 INFO L82 PathProgramCache]: Analyzing trace with hash 873946466, now seen corresponding path program 1 times [2019-09-08 06:58:28,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:28,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:28,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:28,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:28,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:29,062 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:58:29,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:29,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:29,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:29,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:29,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:29,063 INFO L87 Difference]: Start difference. First operand 20787 states and 27156 transitions. Second operand 5 states. [2019-09-08 06:58:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:31,420 INFO L93 Difference]: Finished difference Result 41542 states and 54362 transitions. [2019-09-08 06:58:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:31,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:31,465 INFO L225 Difference]: With dead ends: 41542 [2019-09-08 06:58:31,465 INFO L226 Difference]: Without dead ends: 20787 [2019-09-08 06:58:31,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20787 states. [2019-09-08 06:58:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20787 to 20787. [2019-09-08 06:58:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-09-08 06:58:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 27076 transitions. [2019-09-08 06:58:33,947 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 27076 transitions. Word has length 240 [2019-09-08 06:58:33,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:33,948 INFO L475 AbstractCegarLoop]: Abstraction has 20787 states and 27076 transitions. [2019-09-08 06:58:33,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:33,948 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 27076 transitions. [2019-09-08 06:58:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:33,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:33,949 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] [2019-09-08 06:58:33,949 INFO L418 AbstractCegarLoop]: === Iteration 47 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:33,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 914621216, now seen corresponding path program 1 times [2019-09-08 06:58:33,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:33,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:33,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:33,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:34,050 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:58:34,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:34,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:34,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:34,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:34,051 INFO L87 Difference]: Start difference. First operand 20787 states and 27076 transitions. Second operand 5 states. [2019-09-08 06:58:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:36,452 INFO L93 Difference]: Finished difference Result 41542 states and 54202 transitions. [2019-09-08 06:58:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:36,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:36,500 INFO L225 Difference]: With dead ends: 41542 [2019-09-08 06:58:36,500 INFO L226 Difference]: Without dead ends: 20787 [2019-09-08 06:58:36,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20787 states. [2019-09-08 06:58:37,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20787 to 20787. [2019-09-08 06:58:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20787 states. [2019-09-08 06:58:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20787 states to 20787 states and 26996 transitions. [2019-09-08 06:58:37,966 INFO L78 Accepts]: Start accepts. Automaton has 20787 states and 26996 transitions. Word has length 240 [2019-09-08 06:58:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:37,967 INFO L475 AbstractCegarLoop]: Abstraction has 20787 states and 26996 transitions. [2019-09-08 06:58:37,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 20787 states and 26996 transitions. [2019-09-08 06:58:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:37,969 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:37,969 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] [2019-09-08 06:58:37,969 INFO L418 AbstractCegarLoop]: === Iteration 48 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:37,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1790640222, now seen corresponding path program 1 times [2019-09-08 06:58:37,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:37,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:37,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:37,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:38,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 06:58:38,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:38,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:38,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:38,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:38,082 INFO L87 Difference]: Start difference. First operand 20787 states and 26996 transitions. Second operand 5 states. [2019-09-08 06:58:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:41,215 INFO L93 Difference]: Finished difference Result 49480 states and 64355 transitions. [2019-09-08 06:58:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:58:41,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:41,290 INFO L225 Difference]: With dead ends: 49480 [2019-09-08 06:58:41,290 INFO L226 Difference]: Without dead ends: 28725 [2019-09-08 06:58:41,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:58:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28725 states. [2019-09-08 06:58:44,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28725 to 28133. [2019-09-08 06:58:44,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:58:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35898 transitions. [2019-09-08 06:58:44,330 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35898 transitions. Word has length 240 [2019-09-08 06:58:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:44,330 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35898 transitions. [2019-09-08 06:58:44,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35898 transitions. [2019-09-08 06:58:44,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:44,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:44,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:58:44,333 INFO L418 AbstractCegarLoop]: === Iteration 49 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:44,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:44,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2060426400, now seen corresponding path program 1 times [2019-09-08 06:58:44,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:44,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:44,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:44,422 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:58:44,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:44,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:44,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:44,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:44,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:44,424 INFO L87 Difference]: Start difference. First operand 28133 states and 35898 transitions. Second operand 5 states. [2019-09-08 06:58:47,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:47,253 INFO L93 Difference]: Finished difference Result 56232 states and 71906 transitions. [2019-09-08 06:58:47,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:47,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:47,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:47,311 INFO L225 Difference]: With dead ends: 56232 [2019-09-08 06:58:47,312 INFO L226 Difference]: Without dead ends: 28133 [2019-09-08 06:58:47,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28133 states. [2019-09-08 06:58:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28133 to 28133. [2019-09-08 06:58:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:58:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35786 transitions. [2019-09-08 06:58:49,468 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35786 transitions. Word has length 240 [2019-09-08 06:58:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:49,468 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35786 transitions. [2019-09-08 06:58:49,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35786 transitions. [2019-09-08 06:58:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:49,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:49,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] [2019-09-08 06:58:49,470 INFO L418 AbstractCegarLoop]: === Iteration 50 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:49,471 INFO L82 PathProgramCache]: Analyzing trace with hash -522086370, now seen corresponding path program 1 times [2019-09-08 06:58:49,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:49,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:49,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:49,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:49,574 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:58:49,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:49,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:49,575 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:49,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:49,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:49,576 INFO L87 Difference]: Start difference. First operand 28133 states and 35786 transitions. Second operand 5 states. [2019-09-08 06:58:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:53,166 INFO L93 Difference]: Finished difference Result 56232 states and 71682 transitions. [2019-09-08 06:58:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:53,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:53,230 INFO L225 Difference]: With dead ends: 56232 [2019-09-08 06:58:53,231 INFO L226 Difference]: Without dead ends: 28133 [2019-09-08 06:58:53,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:53,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28133 states. [2019-09-08 06:58:55,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28133 to 28133. [2019-09-08 06:58:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:58:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35674 transitions. [2019-09-08 06:58:55,347 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35674 transitions. Word has length 240 [2019-09-08 06:58:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:58:55,348 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35674 transitions. [2019-09-08 06:58:55,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:58:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35674 transitions. [2019-09-08 06:58:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:58:55,349 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:58:55,349 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] [2019-09-08 06:58:55,350 INFO L418 AbstractCegarLoop]: === Iteration 51 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:58:55,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:58:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1744294816, now seen corresponding path program 1 times [2019-09-08 06:58:55,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:58:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:58:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:55,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:58:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:58:55,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:58:55,425 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:58:55,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:58:55,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:58:55,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:58:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:58:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:58:55,426 INFO L87 Difference]: Start difference. First operand 28133 states and 35674 transitions. Second operand 5 states. [2019-09-08 06:58:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:58:58,371 INFO L93 Difference]: Finished difference Result 56232 states and 71458 transitions. [2019-09-08 06:58:58,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:58:58,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:58:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:58:58,443 INFO L225 Difference]: With dead ends: 56232 [2019-09-08 06:58:58,444 INFO L226 Difference]: Without dead ends: 28133 [2019-09-08 06:58:58,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:58:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28133 states. [2019-09-08 06:59:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28133 to 28133. [2019-09-08 06:59:01,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:59:01,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35562 transitions. [2019-09-08 06:59:01,865 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35562 transitions. Word has length 240 [2019-09-08 06:59:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:01,865 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35562 transitions. [2019-09-08 06:59:01,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35562 transitions. [2019-09-08 06:59:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:01,868 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:01,868 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:59:01,868 INFO L418 AbstractCegarLoop]: === Iteration 52 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1263214558, now seen corresponding path program 1 times [2019-09-08 06:59:01,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:01,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:01,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:01,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:01,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:01,959 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:59:01,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:01,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:01,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:01,960 INFO L87 Difference]: Start difference. First operand 28133 states and 35562 transitions. Second operand 5 states. [2019-09-08 06:59:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:04,824 INFO L93 Difference]: Finished difference Result 56232 states and 71234 transitions. [2019-09-08 06:59:04,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:59:04,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:04,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:04,879 INFO L225 Difference]: With dead ends: 56232 [2019-09-08 06:59:04,880 INFO L226 Difference]: Without dead ends: 28133 [2019-09-08 06:59:04,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:59:04,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28133 states. [2019-09-08 06:59:07,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28133 to 28133. [2019-09-08 06:59:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:59:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35450 transitions. [2019-09-08 06:59:07,137 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35450 transitions. Word has length 240 [2019-09-08 06:59:07,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:07,138 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35450 transitions. [2019-09-08 06:59:07,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:07,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35450 transitions. [2019-09-08 06:59:07,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:07,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:07,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:59:07,141 INFO L418 AbstractCegarLoop]: === Iteration 53 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:07,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:07,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1247695840, now seen corresponding path program 1 times [2019-09-08 06:59:07,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:07,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:07,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:07,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:07,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:07,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:07,246 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:59:07,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:07,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:07,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:07,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:07,248 INFO L87 Difference]: Start difference. First operand 28133 states and 35450 transitions. Second operand 5 states. [2019-09-08 06:59:11,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:11,132 INFO L93 Difference]: Finished difference Result 56232 states and 71010 transitions. [2019-09-08 06:59:11,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:59:11,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:11,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:11,188 INFO L225 Difference]: With dead ends: 56232 [2019-09-08 06:59:11,188 INFO L226 Difference]: Without dead ends: 28133 [2019-09-08 06:59:11,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 06:59:11,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28133 states. [2019-09-08 06:59:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28133 to 28133. [2019-09-08 06:59:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28133 states. [2019-09-08 06:59:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28133 states to 28133 states and 35338 transitions. [2019-09-08 06:59:13,349 INFO L78 Accepts]: Start accepts. Automaton has 28133 states and 35338 transitions. Word has length 240 [2019-09-08 06:59:13,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:13,349 INFO L475 AbstractCegarLoop]: Abstraction has 28133 states and 35338 transitions. [2019-09-08 06:59:13,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:13,349 INFO L276 IsEmpty]: Start isEmpty. Operand 28133 states and 35338 transitions. [2019-09-08 06:59:13,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:13,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:13,351 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] [2019-09-08 06:59:13,351 INFO L418 AbstractCegarLoop]: === Iteration 54 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1108109410, now seen corresponding path program 1 times [2019-09-08 06:59:13,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:13,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:13,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:13,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:59:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:13,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:13,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:13,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:13,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:13,427 INFO L87 Difference]: Start difference. First operand 28133 states and 35338 transitions. Second operand 5 states. [2019-09-08 06:59:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:17,193 INFO L93 Difference]: Finished difference Result 59664 states and 75912 transitions. [2019-09-08 06:59:17,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:59:17,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:17,282 INFO L225 Difference]: With dead ends: 59664 [2019-09-08 06:59:17,283 INFO L226 Difference]: Without dead ends: 31565 [2019-09-08 06:59:17,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:59:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31565 states. [2019-09-08 06:59:19,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31565 to 31557. [2019-09-08 06:59:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31557 states. [2019-09-08 06:59:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31557 states to 31557 states and 39634 transitions. [2019-09-08 06:59:19,986 INFO L78 Accepts]: Start accepts. Automaton has 31557 states and 39634 transitions. Word has length 240 [2019-09-08 06:59:19,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:19,987 INFO L475 AbstractCegarLoop]: Abstraction has 31557 states and 39634 transitions. [2019-09-08 06:59:19,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:19,987 INFO L276 IsEmpty]: Start isEmpty. Operand 31557 states and 39634 transitions. [2019-09-08 06:59:19,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:19,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:19,989 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] [2019-09-08 06:59:19,989 INFO L418 AbstractCegarLoop]: === Iteration 55 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:19,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:19,989 INFO L82 PathProgramCache]: Analyzing trace with hash 820163292, now seen corresponding path program 1 times [2019-09-08 06:59:19,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:19,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:19,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:19,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:19,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:20,091 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:59:20,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:20,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:20,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:20,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:20,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:20,093 INFO L87 Difference]: Start difference. First operand 31557 states and 39634 transitions. Second operand 5 states. [2019-09-08 06:59:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:26,408 INFO L93 Difference]: Finished difference Result 87592 states and 112340 transitions. [2019-09-08 06:59:26,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:59:26,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:26,589 INFO L225 Difference]: With dead ends: 87592 [2019-09-08 06:59:26,590 INFO L226 Difference]: Without dead ends: 56067 [2019-09-08 06:59:26,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 06:59:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56067 states. [2019-09-08 06:59:30,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56067 to 45129. [2019-09-08 06:59:30,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45129 states. [2019-09-08 06:59:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45129 states to 45129 states and 55810 transitions. [2019-09-08 06:59:30,650 INFO L78 Accepts]: Start accepts. Automaton has 45129 states and 55810 transitions. Word has length 240 [2019-09-08 06:59:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:30,653 INFO L475 AbstractCegarLoop]: Abstraction has 45129 states and 55810 transitions. [2019-09-08 06:59:30,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:30,653 INFO L276 IsEmpty]: Start isEmpty. Operand 45129 states and 55810 transitions. [2019-09-08 06:59:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 06:59:30,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:30,656 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] [2019-09-08 06:59:30,656 INFO L418 AbstractCegarLoop]: === Iteration 56 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:30,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:30,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1488505905, now seen corresponding path program 1 times [2019-09-08 06:59:30,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:30,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:30,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:30,719 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:59:30,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:30,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:30,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:30,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:30,720 INFO L87 Difference]: Start difference. First operand 45129 states and 55810 transitions. Second operand 5 states. [2019-09-08 06:59:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:34,762 INFO L93 Difference]: Finished difference Result 80470 states and 100952 transitions. [2019-09-08 06:59:34,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:59:34,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 241 [2019-09-08 06:59:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:34,847 INFO L225 Difference]: With dead ends: 80470 [2019-09-08 06:59:34,848 INFO L226 Difference]: Without dead ends: 35373 [2019-09-08 06:59:34,900 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:59:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35373 states. [2019-09-08 06:59:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35373 to 33965. [2019-09-08 06:59:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33965 states. [2019-09-08 06:59:39,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33965 states to 33965 states and 42090 transitions. [2019-09-08 06:59:39,336 INFO L78 Accepts]: Start accepts. Automaton has 33965 states and 42090 transitions. Word has length 241 [2019-09-08 06:59:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:39,336 INFO L475 AbstractCegarLoop]: Abstraction has 33965 states and 42090 transitions. [2019-09-08 06:59:39,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 33965 states and 42090 transitions. [2019-09-08 06:59:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:39,338 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:39,338 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] [2019-09-08 06:59:39,338 INFO L418 AbstractCegarLoop]: === Iteration 57 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1713649630, now seen corresponding path program 1 times [2019-09-08 06:59:39,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:39,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:39,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:39,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:39,577 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:59:39,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:39,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:39,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:39,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:39,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:39,579 INFO L87 Difference]: Start difference. First operand 33965 states and 42090 transitions. Second operand 5 states. [2019-09-08 06:59:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:44,709 INFO L93 Difference]: Finished difference Result 80026 states and 103224 transitions. [2019-09-08 06:59:44,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:59:44,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:44,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:44,816 INFO L225 Difference]: With dead ends: 80026 [2019-09-08 06:59:44,816 INFO L226 Difference]: Without dead ends: 46093 [2019-09-08 06:59:44,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:59:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46093 states. [2019-09-08 06:59:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46093 to 38957. [2019-09-08 06:59:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38957 states. [2019-09-08 06:59:48,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38957 states to 38957 states and 47578 transitions. [2019-09-08 06:59:48,495 INFO L78 Accepts]: Start accepts. Automaton has 38957 states and 47578 transitions. Word has length 240 [2019-09-08 06:59:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:59:48,495 INFO L475 AbstractCegarLoop]: Abstraction has 38957 states and 47578 transitions. [2019-09-08 06:59:48,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:59:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38957 states and 47578 transitions. [2019-09-08 06:59:48,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 06:59:48,497 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:59:48,497 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] [2019-09-08 06:59:48,497 INFO L418 AbstractCegarLoop]: === Iteration 58 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:59:48,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:59:48,498 INFO L82 PathProgramCache]: Analyzing trace with hash -335738212, now seen corresponding path program 1 times [2019-09-08 06:59:48,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:59:48,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:59:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:48,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:59:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:59:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:59:48,588 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:59:48,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:59:48,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:59:48,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:59:48,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:59:48,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:59:48,589 INFO L87 Difference]: Start difference. First operand 38957 states and 47578 transitions. Second operand 5 states. [2019-09-08 06:59:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:59:54,560 INFO L93 Difference]: Finished difference Result 89210 states and 113336 transitions. [2019-09-08 06:59:54,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 06:59:54,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 06:59:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:59:54,675 INFO L225 Difference]: With dead ends: 89210 [2019-09-08 06:59:54,675 INFO L226 Difference]: Without dead ends: 50285 [2019-09-08 06:59:54,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:59:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50285 states. [2019-09-08 07:00:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50285 to 43629. [2019-09-08 07:00:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43629 states. [2019-09-08 07:00:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43629 states to 43629 states and 52618 transitions. [2019-09-08 07:00:00,380 INFO L78 Accepts]: Start accepts. Automaton has 43629 states and 52618 transitions. Word has length 240 [2019-09-08 07:00:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:00,381 INFO L475 AbstractCegarLoop]: Abstraction has 43629 states and 52618 transitions. [2019-09-08 07:00:00,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43629 states and 52618 transitions. [2019-09-08 07:00:00,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:00:00,382 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:00,382 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] [2019-09-08 07:00:00,383 INFO L418 AbstractCegarLoop]: === Iteration 59 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:00,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:00,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1233131490, now seen corresponding path program 1 times [2019-09-08 07:00:00,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:00,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:00,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:00,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:00,460 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 07:00:00,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:00:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:00:00,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:00,461 INFO L87 Difference]: Start difference. First operand 43629 states and 52618 transitions. Second operand 5 states. [2019-09-08 07:00:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:06,739 INFO L93 Difference]: Finished difference Result 97754 states and 122552 transitions. [2019-09-08 07:00:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:00:06,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:00:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:06,865 INFO L225 Difference]: With dead ends: 97754 [2019-09-08 07:00:06,865 INFO L226 Difference]: Without dead ends: 54157 [2019-09-08 07:00:06,938 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:00:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54157 states. [2019-09-08 07:00:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54157 to 47981. [2019-09-08 07:00:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47981 states. [2019-09-08 07:00:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47981 states to 47981 states and 57210 transitions. [2019-09-08 07:00:11,619 INFO L78 Accepts]: Start accepts. Automaton has 47981 states and 57210 transitions. Word has length 240 [2019-09-08 07:00:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:11,620 INFO L475 AbstractCegarLoop]: Abstraction has 47981 states and 57210 transitions. [2019-09-08 07:00:11,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 47981 states and 57210 transitions. [2019-09-08 07:00:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:00:11,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:11,622 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] [2019-09-08 07:00:11,622 INFO L418 AbstractCegarLoop]: === Iteration 60 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -984984996, now seen corresponding path program 1 times [2019-09-08 07:00:11,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:11,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:11,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:11,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:11,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:11,700 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 07:00:11,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:00:11,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:00:11,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:11,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:11,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:11,701 INFO L87 Difference]: Start difference. First operand 47981 states and 57210 transitions. Second operand 5 states. [2019-09-08 07:00:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:19,629 INFO L93 Difference]: Finished difference Result 105658 states and 130872 transitions. [2019-09-08 07:00:19,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:00:19,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:00:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:19,774 INFO L225 Difference]: With dead ends: 105658 [2019-09-08 07:00:19,775 INFO L226 Difference]: Without dead ends: 57709 [2019-09-08 07:00:19,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:00:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57709 states. [2019-09-08 07:00:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57709 to 52013. [2019-09-08 07:00:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52013 states. [2019-09-08 07:00:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52013 states to 52013 states and 61354 transitions. [2019-09-08 07:00:24,835 INFO L78 Accepts]: Start accepts. Automaton has 52013 states and 61354 transitions. Word has length 240 [2019-09-08 07:00:24,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:24,835 INFO L475 AbstractCegarLoop]: Abstraction has 52013 states and 61354 transitions. [2019-09-08 07:00:24,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 52013 states and 61354 transitions. [2019-09-08 07:00:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:00:24,837 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:24,837 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] [2019-09-08 07:00:24,837 INFO L418 AbstractCegarLoop]: === Iteration 61 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:24,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash -561338274, now seen corresponding path program 1 times [2019-09-08 07:00:24,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:24,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:24,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:24,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:24,914 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 07:00:24,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:00:24,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:00:24,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:24,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:24,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:24,915 INFO L87 Difference]: Start difference. First operand 52013 states and 61354 transitions. Second operand 5 states. [2019-09-08 07:00:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:33,346 INFO L93 Difference]: Finished difference Result 111208 states and 135215 transitions. [2019-09-08 07:00:33,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:00:33,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:00:33,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:33,506 INFO L225 Difference]: With dead ends: 111208 [2019-09-08 07:00:33,506 INFO L226 Difference]: Without dead ends: 59229 [2019-09-08 07:00:33,587 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:00:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59229 states. [2019-09-08 07:00:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59229 to 56269. [2019-09-08 07:00:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56269 states. [2019-09-08 07:00:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56269 states to 56269 states and 65802 transitions. [2019-09-08 07:00:39,036 INFO L78 Accepts]: Start accepts. Automaton has 56269 states and 65802 transitions. Word has length 240 [2019-09-08 07:00:39,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:39,036 INFO L475 AbstractCegarLoop]: Abstraction has 56269 states and 65802 transitions. [2019-09-08 07:00:39,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:39,036 INFO L276 IsEmpty]: Start isEmpty. Operand 56269 states and 65802 transitions. [2019-09-08 07:00:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:00:39,038 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:39,038 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] [2019-09-08 07:00:39,038 INFO L418 AbstractCegarLoop]: === Iteration 62 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:39,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:39,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1933145572, now seen corresponding path program 1 times [2019-09-08 07:00:39,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:39,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:39,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:39,118 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 07:00:39,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:00:39,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:00:39,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:39,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:39,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:39,119 INFO L87 Difference]: Start difference. First operand 56269 states and 65802 transitions. Second operand 5 states. [2019-09-08 07:00:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:00:46,101 INFO L93 Difference]: Finished difference Result 115794 states and 138997 transitions. [2019-09-08 07:00:46,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:00:46,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:00:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:00:46,247 INFO L225 Difference]: With dead ends: 115794 [2019-09-08 07:00:46,247 INFO L226 Difference]: Without dead ends: 59557 [2019-09-08 07:00:46,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:00:46,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59557 states. [2019-09-08 07:00:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59557 to 57397. [2019-09-08 07:00:54,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57397 states. [2019-09-08 07:00:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57397 states to 57397 states and 66530 transitions. [2019-09-08 07:00:54,366 INFO L78 Accepts]: Start accepts. Automaton has 57397 states and 66530 transitions. Word has length 240 [2019-09-08 07:00:54,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:00:54,366 INFO L475 AbstractCegarLoop]: Abstraction has 57397 states and 66530 transitions. [2019-09-08 07:00:54,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:00:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 57397 states and 66530 transitions. [2019-09-08 07:00:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:00:54,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:00:54,368 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] [2019-09-08 07:00:54,368 INFO L418 AbstractCegarLoop]: === Iteration 63 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:00:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:00:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1332462426, now seen corresponding path program 1 times [2019-09-08 07:00:54,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:00:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:00:54,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:54,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:00:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:00:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:00:54,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 07:00:54,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:00:54,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:00:54,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:00:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:00:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:00:54,454 INFO L87 Difference]: Start difference. First operand 57397 states and 66530 transitions. Second operand 5 states. [2019-09-08 07:01:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:02,685 INFO L93 Difference]: Finished difference Result 129664 states and 155842 transitions. [2019-09-08 07:01:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:01:02,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:01:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:02,856 INFO L225 Difference]: With dead ends: 129664 [2019-09-08 07:01:02,856 INFO L226 Difference]: Without dead ends: 72299 [2019-09-08 07:01:02,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:01:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72299 states. [2019-09-08 07:01:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72299 to 67401. [2019-09-08 07:01:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67401 states. [2019-09-08 07:01:12,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67401 states to 67401 states and 77458 transitions. [2019-09-08 07:01:12,631 INFO L78 Accepts]: Start accepts. Automaton has 67401 states and 77458 transitions. Word has length 240 [2019-09-08 07:01:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:12,632 INFO L475 AbstractCegarLoop]: Abstraction has 67401 states and 77458 transitions. [2019-09-08 07:01:12,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 67401 states and 77458 transitions. [2019-09-08 07:01:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:01:12,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:12,634 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] [2019-09-08 07:01:12,634 INFO L418 AbstractCegarLoop]: === Iteration 64 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1991993948, now seen corresponding path program 1 times [2019-09-08 07:01:12,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:12,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:12,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:12,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:12,709 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 07:01:12,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:12,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:12,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:12,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:12,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:12,710 INFO L87 Difference]: Start difference. First operand 67401 states and 77458 transitions. Second operand 5 states. [2019-09-08 07:01:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:21,776 INFO L93 Difference]: Finished difference Result 141420 states and 167685 transitions. [2019-09-08 07:01:21,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:01:21,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:01:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:21,940 INFO L225 Difference]: With dead ends: 141420 [2019-09-08 07:01:21,940 INFO L226 Difference]: Without dead ends: 74057 [2019-09-08 07:01:22,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74057 states. [2019-09-08 07:01:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74057 to 70969. [2019-09-08 07:01:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70969 states. [2019-09-08 07:01:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70969 states to 70969 states and 80874 transitions. [2019-09-08 07:01:29,522 INFO L78 Accepts]: Start accepts. Automaton has 70969 states and 80874 transitions. Word has length 240 [2019-09-08 07:01:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:29,522 INFO L475 AbstractCegarLoop]: Abstraction has 70969 states and 80874 transitions. [2019-09-08 07:01:29,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 70969 states and 80874 transitions. [2019-09-08 07:01:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:01:29,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:29,525 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] [2019-09-08 07:01:29,525 INFO L418 AbstractCegarLoop]: === Iteration 65 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1597627162, now seen corresponding path program 1 times [2019-09-08 07:01:29,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:29,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:29,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:29,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:29,619 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 07:01:29,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:29,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:29,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:29,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:29,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:29,621 INFO L87 Difference]: Start difference. First operand 70969 states and 80874 transitions. Second operand 5 states. [2019-09-08 07:01:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:40,300 INFO L93 Difference]: Finished difference Result 143776 states and 168375 transitions. [2019-09-08 07:01:40,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:01:40,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 240 [2019-09-08 07:01:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:40,459 INFO L225 Difference]: With dead ends: 143776 [2019-09-08 07:01:40,460 INFO L226 Difference]: Without dead ends: 72841 [2019-09-08 07:01:40,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:01:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72841 states. [2019-09-08 07:01:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72841 to 71289. [2019-09-08 07:01:47,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71289 states. [2019-09-08 07:01:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71289 states to 71289 states and 80402 transitions. [2019-09-08 07:01:47,512 INFO L78 Accepts]: Start accepts. Automaton has 71289 states and 80402 transitions. Word has length 240 [2019-09-08 07:01:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:01:47,513 INFO L475 AbstractCegarLoop]: Abstraction has 71289 states and 80402 transitions. [2019-09-08 07:01:47,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:01:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 71289 states and 80402 transitions. [2019-09-08 07:01:47,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 07:01:47,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:01:47,516 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] [2019-09-08 07:01:47,516 INFO L418 AbstractCegarLoop]: === Iteration 66 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:01:47,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:01:47,516 INFO L82 PathProgramCache]: Analyzing trace with hash -157488063, now seen corresponding path program 1 times [2019-09-08 07:01:47,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:01:47,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:01:47,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:47,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:01:47,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:01:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:01:47,579 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 07:01:47,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:01:47,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:01:47,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:01:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:01:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:01:47,580 INFO L87 Difference]: Start difference. First operand 71289 states and 80402 transitions. Second operand 5 states. [2019-09-08 07:01:56,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:01:56,032 INFO L93 Difference]: Finished difference Result 138958 states and 159597 transitions. [2019-09-08 07:01:56,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:01:56,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 241 [2019-09-08 07:01:56,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:01:56,611 INFO L225 Difference]: With dead ends: 138958 [2019-09-08 07:01:56,611 INFO L226 Difference]: Without dead ends: 67701 [2019-09-08 07:01:56,679 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 07:01:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67701 states. [2019-09-08 07:02:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67701 to 64757. [2019-09-08 07:02:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64757 states. [2019-09-08 07:02:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64757 states to 64757 states and 72898 transitions. [2019-09-08 07:02:06,537 INFO L78 Accepts]: Start accepts. Automaton has 64757 states and 72898 transitions. Word has length 241 [2019-09-08 07:02:06,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:06,537 INFO L475 AbstractCegarLoop]: Abstraction has 64757 states and 72898 transitions. [2019-09-08 07:02:06,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:02:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 64757 states and 72898 transitions. [2019-09-08 07:02:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 07:02:06,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:06,539 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] [2019-09-08 07:02:06,540 INFO L418 AbstractCegarLoop]: === Iteration 67 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 753621660, now seen corresponding path program 1 times [2019-09-08 07:02:06,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:06,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:06,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:06,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:06,603 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 07:02:06,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:06,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:02:06,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:02:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:02:06,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:02:06,605 INFO L87 Difference]: Start difference. First operand 64757 states and 72898 transitions. Second operand 3 states. [2019-09-08 07:02:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:02:19,379 INFO L93 Difference]: Finished difference Result 191326 states and 216275 transitions. [2019-09-08 07:02:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:02:19,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2019-09-08 07:02:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:02:19,645 INFO L225 Difference]: With dead ends: 191326 [2019-09-08 07:02:19,645 INFO L226 Difference]: Without dead ends: 126603 [2019-09-08 07:02:19,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:02:19,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126603 states. [2019-09-08 07:02:37,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126603 to 126600. [2019-09-08 07:02:37,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126600 states. [2019-09-08 07:02:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126600 states to 126600 states and 142718 transitions. [2019-09-08 07:02:37,358 INFO L78 Accepts]: Start accepts. Automaton has 126600 states and 142718 transitions. Word has length 240 [2019-09-08 07:02:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:02:37,358 INFO L475 AbstractCegarLoop]: Abstraction has 126600 states and 142718 transitions. [2019-09-08 07:02:37,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:02:37,358 INFO L276 IsEmpty]: Start isEmpty. Operand 126600 states and 142718 transitions. [2019-09-08 07:02:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-08 07:02:37,361 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:02:37,362 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] [2019-09-08 07:02:37,362 INFO L418 AbstractCegarLoop]: === Iteration 68 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:02:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:02:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 422453600, now seen corresponding path program 1 times [2019-09-08 07:02:37,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:02:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:02:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:37,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:02:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:02:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:02:37,432 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 07:02:37,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:02:37,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:02:37,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:02:37,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:02:37,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:02:37,433 INFO L87 Difference]: Start difference. First operand 126600 states and 142718 transitions. Second operand 3 states. [2019-09-08 07:03:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:03:04,895 INFO L93 Difference]: Finished difference Result 378335 states and 438128 transitions. [2019-09-08 07:03:04,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:03:04,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-09-08 07:03:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:03:05,562 INFO L225 Difference]: With dead ends: 378335 [2019-09-08 07:03:05,563 INFO L226 Difference]: Without dead ends: 251784 [2019-09-08 07:03:05,766 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:03:05,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251784 states. [2019-09-08 07:03:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251784 to 251784. [2019-09-08 07:03:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251784 states. [2019-09-08 07:03:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251784 states to 251784 states and 288823 transitions. [2019-09-08 07:03:39,482 INFO L78 Accepts]: Start accepts. Automaton has 251784 states and 288823 transitions. Word has length 241 [2019-09-08 07:03:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:03:39,483 INFO L475 AbstractCegarLoop]: Abstraction has 251784 states and 288823 transitions. [2019-09-08 07:03:39,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:03:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 251784 states and 288823 transitions. [2019-09-08 07:03:39,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 07:03:39,503 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:03:39,503 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:03:39,504 INFO L418 AbstractCegarLoop]: === Iteration 69 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:03:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:03:39,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1212400073, now seen corresponding path program 1 times [2019-09-08 07:03:39,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:03:39,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:03:39,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:39,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:03:39,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:03:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:03:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 07:03:39,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:03:39,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 07:03:39,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 07:03:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 07:03:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 07:03:39,591 INFO L87 Difference]: Start difference. First operand 251784 states and 288823 transitions. Second operand 4 states. [2019-09-08 07:04:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:04:07,437 INFO L93 Difference]: Finished difference Result 444875 states and 510045 transitions. [2019-09-08 07:04:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 07:04:07,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 271 [2019-09-08 07:04:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:04:08,107 INFO L225 Difference]: With dead ends: 444875 [2019-09-08 07:04:08,107 INFO L226 Difference]: Without dead ends: 193125 [2019-09-08 07:04:08,416 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 07:04:08,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193125 states. [2019-09-08 07:04:37,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193125 to 191293. [2019-09-08 07:04:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191293 states. [2019-09-08 07:04:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191293 states to 191293 states and 219282 transitions. [2019-09-08 07:04:37,669 INFO L78 Accepts]: Start accepts. Automaton has 191293 states and 219282 transitions. Word has length 271 [2019-09-08 07:04:37,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:04:37,669 INFO L475 AbstractCegarLoop]: Abstraction has 191293 states and 219282 transitions. [2019-09-08 07:04:37,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 07:04:37,670 INFO L276 IsEmpty]: Start isEmpty. Operand 191293 states and 219282 transitions. [2019-09-08 07:04:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-08 07:04:37,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:04:37,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:04:37,678 INFO L418 AbstractCegarLoop]: === Iteration 70 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:04:37,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:04:37,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1037277771, now seen corresponding path program 1 times [2019-09-08 07:04:37,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:04:37,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:04:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:37,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:04:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:04:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:04:37,768 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 07:04:37,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:04:37,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:04:37,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:04:37,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:04:37,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:04:37,770 INFO L87 Difference]: Start difference. First operand 191293 states and 219282 transitions. Second operand 3 states. [2019-09-08 07:05:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:05:24,216 INFO L93 Difference]: Finished difference Result 526997 states and 608212 transitions. [2019-09-08 07:05:24,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:05:24,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 271 [2019-09-08 07:05:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:05:25,334 INFO L225 Difference]: With dead ends: 526997 [2019-09-08 07:05:25,334 INFO L226 Difference]: Without dead ends: 240727 [2019-09-08 07:05:25,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:05:25,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240727 states. [2019-09-08 07:05:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240727 to 240727. [2019-09-08 07:05:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240727 states. [2019-09-08 07:05:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240727 states to 240727 states and 273637 transitions. [2019-09-08 07:05:53,176 INFO L78 Accepts]: Start accepts. Automaton has 240727 states and 273637 transitions. Word has length 271 [2019-09-08 07:05:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:05:53,177 INFO L475 AbstractCegarLoop]: Abstraction has 240727 states and 273637 transitions. [2019-09-08 07:05:53,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:05:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 240727 states and 273637 transitions. [2019-09-08 07:05:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2019-09-08 07:05:53,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:05:53,285 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, 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] [2019-09-08 07:05:53,285 INFO L418 AbstractCegarLoop]: === Iteration 71 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:05:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:05:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash -826505941, now seen corresponding path program 1 times [2019-09-08 07:05:53,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:05:53,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:05:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:53,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:53,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:05:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-09-08 07:05:53,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:05:53,446 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 07:05:53,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:05:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:05:53,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 2390 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 07:05:53,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:05:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 07:05:54,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:05:54,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2019-09-08 07:05:54,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:05:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:05:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:05:54,244 INFO L87 Difference]: Start difference. First operand 240727 states and 273637 transitions. Second operand 3 states. [2019-09-08 07:06:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:06:47,822 INFO L93 Difference]: Finished difference Result 527609 states and 610215 transitions. [2019-09-08 07:06:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:06:47,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2019-09-08 07:06:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:06:49,500 INFO L225 Difference]: With dead ends: 527609 [2019-09-08 07:06:49,500 INFO L226 Difference]: Without dead ends: 378840 [2019-09-08 07:06:49,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:06:50,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378840 states. [2019-09-08 07:07:43,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378840 to 378837. [2019-09-08 07:07:43,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378837 states. [2019-09-08 07:07:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378837 states to 378837 states and 435964 transitions. [2019-09-08 07:07:44,777 INFO L78 Accepts]: Start accepts. Automaton has 378837 states and 435964 transitions. Word has length 413 [2019-09-08 07:07:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:07:44,777 INFO L475 AbstractCegarLoop]: Abstraction has 378837 states and 435964 transitions. [2019-09-08 07:07:44,777 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:07:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 378837 states and 435964 transitions. [2019-09-08 07:07:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-09-08 07:07:45,336 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:07:45,336 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:07:45,337 INFO L418 AbstractCegarLoop]: === Iteration 72 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:07:45,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:07:45,337 INFO L82 PathProgramCache]: Analyzing trace with hash 924078106, now seen corresponding path program 1 times [2019-09-08 07:07:45,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:07:45,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:07:45,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:45,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:07:45,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:07:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2019-09-08 07:07:46,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:07:46,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:07:46,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:07:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:07:46,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 2824 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 07:07:46,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:07:47,000 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-08 07:07:47,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:07:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 07:07:47,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:07:47,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:07:47,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:07:47,014 INFO L87 Difference]: Start difference. First operand 378837 states and 435964 transitions. Second operand 5 states.