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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 04:10:43,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 04:10:43,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 04:10:43,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 04:10:43,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 04:10:43,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 04:10:43,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 04:10:43,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 04:10:43,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 04:10:43,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 04:10:43,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 04:10:43,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 04:10:43,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 04:10:43,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 04:10:43,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 04:10:43,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 04:10:43,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 04:10:43,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 04:10:43,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 04:10:43,977 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 04:10:43,979 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 04:10:43,981 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 04:10:43,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 04:10:43,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 04:10:43,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 04:10:43,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 04:10:43,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 04:10:43,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 04:10:43,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 04:10:43,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 04:10:43,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 04:10:43,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 04:10:43,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 04:10:43,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 04:10:44,005 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 04:10:44,005 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 04:10:44,006 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 04:10:44,006 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 04:10:44,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 04:10:44,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 04:10:44,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 04:10:44,009 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-03 04:10:44,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 04:10:44,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 04:10:44,035 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 04:10:44,036 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 04:10:44,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 04:10:44,037 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 04:10:44,037 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 04:10:44,037 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 04:10:44,037 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 04:10:44,037 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 04:10:44,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 04:10:44,040 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 04:10:44,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 04:10:44,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 04:10:44,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 04:10:44,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 04:10:44,041 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 04:10:44,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 04:10:44,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 04:10:44,042 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 04:10:44,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 04:10:44,043 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 04:10:44,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 04:10:44,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 04:10:44,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 04:10:44,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 04:10:44,044 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 04:10:44,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 04:10:44,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 04:10:44,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 04:10:44,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 04:10:44,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 04:10:44,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 04:10:44,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 04:10:44,112 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 04:10:44,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-03 04:10:44,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0830ea56/501a577093534185a1ad3849329afdb0/FLAG45b4c2280 [2019-10-03 04:10:44,690 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 04:10:44,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.06.cil-1.c [2019-10-03 04:10:44,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0830ea56/501a577093534185a1ad3849329afdb0/FLAG45b4c2280 [2019-10-03 04:10:45,010 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0830ea56/501a577093534185a1ad3849329afdb0 [2019-10-03 04:10:45,019 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 04:10:45,020 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 04:10:45,021 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:45,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 04:10:45,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 04:10:45,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1437ab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45, skipping insertion in model container [2019-10-03 04:10:45,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,036 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 04:10:45,093 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 04:10:45,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:45,500 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 04:10:45,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 04:10:45,601 INFO L192 MainTranslator]: Completed translation [2019-10-03 04:10:45,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45 WrapperNode [2019-10-03 04:10:45,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 04:10:45,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 04:10:45,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 04:10:45,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 04:10:45,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,668 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (1/1) ... [2019-10-03 04:10:45,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 04:10:45,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 04:10:45,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 04:10:45,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 04:10:45,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (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-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-10-03 04:10:45,748 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-10-03 04:10:45,752 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-10-03 04:10:45,752 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-10-03 04:10:45,753 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-10-03 04:10:45,753 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-10-03 04:10:45,753 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-10-03 04:10:45,754 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-10-03 04:10:45,754 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-10-03 04:10:45,755 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-10-03 04:10:45,755 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-10-03 04:10:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-10-03 04:10:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-10-03 04:10:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-03 04:10:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-03 04:10:45,756 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-03 04:10:45,757 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-03 04:10:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-03 04:10:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-03 04:10:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-03 04:10:45,758 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 04:10:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 04:10:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-03 04:10:45,758 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-10-03 04:10:45,759 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-03 04:10:45,760 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-03 04:10:45,761 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-03 04:10:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-03 04:10:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-03 04:10:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 04:10:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 04:10:45,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 04:10:46,617 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 04:10:46,618 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-03 04:10:46,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:46 BoogieIcfgContainer [2019-10-03 04:10:46,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 04:10:46,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 04:10:46,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 04:10:46,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 04:10:46,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 04:10:45" (1/3) ... [2019-10-03 04:10:46,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e70fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:46, skipping insertion in model container [2019-10-03 04:10:46,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 04:10:45" (2/3) ... [2019-10-03 04:10:46,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e70fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 04:10:46, skipping insertion in model container [2019-10-03 04:10:46,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 04:10:46" (3/3) ... [2019-10-03 04:10:46,631 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-1.c [2019-10-03 04:10:46,641 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 04:10:46,652 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 04:10:46,668 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 04:10:46,691 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 04:10:46,692 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 04:10:46,692 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 04:10:46,692 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 04:10:46,692 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 04:10:46,692 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 04:10:46,692 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 04:10:46,693 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 04:10:46,717 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states. [2019-10-03 04:10:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:46,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:46,737 INFO L411 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] [2019-10-03 04:10:46,739 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1698100173, now seen corresponding path program 1 times [2019-10-03 04:10:46,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:46,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:46,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:46,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:47,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:47,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:47,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:47,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:47,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:47,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:47,301 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 5 states. [2019-10-03 04:10:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:48,230 INFO L93 Difference]: Finished difference Result 350 states and 514 transitions. [2019-10-03 04:10:48,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:48,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:48,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:48,259 INFO L225 Difference]: With dead ends: 350 [2019-10-03 04:10:48,259 INFO L226 Difference]: Without dead ends: 338 [2019-10-03 04:10:48,261 INFO L640 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-10-03 04:10:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-03 04:10:48,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 292. [2019-10-03 04:10:48,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 418 transitions. [2019-10-03 04:10:48,328 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 418 transitions. Word has length 148 [2019-10-03 04:10:48,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:48,329 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 418 transitions. [2019-10-03 04:10:48,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:48,329 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 418 transitions. [2019-10-03 04:10:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:48,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:48,334 INFO L411 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] [2019-10-03 04:10:48,334 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash -352308725, now seen corresponding path program 1 times [2019-10-03 04:10:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:48,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:48,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:48,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:48,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:48,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:48,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:48,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:48,606 INFO L87 Difference]: Start difference. First operand 292 states and 418 transitions. Second operand 5 states. [2019-10-03 04:10:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:49,261 INFO L93 Difference]: Finished difference Result 338 states and 501 transitions. [2019-10-03 04:10:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:49,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:49,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:49,265 INFO L225 Difference]: With dead ends: 338 [2019-10-03 04:10:49,266 INFO L226 Difference]: Without dead ends: 338 [2019-10-03 04:10:49,266 INFO L640 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-10-03 04:10:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-03 04:10:49,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 292. [2019-10-03 04:10:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 417 transitions. [2019-10-03 04:10:49,292 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 417 transitions. Word has length 148 [2019-10-03 04:10:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:49,293 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 417 transitions. [2019-10-03 04:10:49,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 417 transitions. [2019-10-03 04:10:49,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:49,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:49,298 INFO L411 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] [2019-10-03 04:10:49,298 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:49,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:49,299 INFO L82 PathProgramCache]: Analyzing trace with hash 135738381, now seen corresponding path program 1 times [2019-10-03 04:10:49,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:49,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:49,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:49,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:49,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:49,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:49,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:49,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:49,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:49,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:49,447 INFO L87 Difference]: Start difference. First operand 292 states and 417 transitions. Second operand 5 states. [2019-10-03 04:10:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:50,082 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2019-10-03 04:10:50,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:50,083 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:50,086 INFO L225 Difference]: With dead ends: 334 [2019-10-03 04:10:50,086 INFO L226 Difference]: Without dead ends: 334 [2019-10-03 04:10:50,087 INFO L640 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-10-03 04:10:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-10-03 04:10:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 292. [2019-10-03 04:10:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 416 transitions. [2019-10-03 04:10:50,104 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 416 transitions. Word has length 148 [2019-10-03 04:10:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:50,105 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 416 transitions. [2019-10-03 04:10:50,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:50,105 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 416 transitions. [2019-10-03 04:10:50,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:50,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:50,113 INFO L411 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] [2019-10-03 04:10:50,113 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:50,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:50,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1146433905, now seen corresponding path program 1 times [2019-10-03 04:10:50,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:50,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:50,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:50,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:50,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:50,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:50,228 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:50,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:50,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:50,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:50,229 INFO L87 Difference]: Start difference. First operand 292 states and 416 transitions. Second operand 5 states. [2019-10-03 04:10:50,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:50,812 INFO L93 Difference]: Finished difference Result 332 states and 487 transitions. [2019-10-03 04:10:50,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:50,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:50,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:50,816 INFO L225 Difference]: With dead ends: 332 [2019-10-03 04:10:50,816 INFO L226 Difference]: Without dead ends: 332 [2019-10-03 04:10:50,816 INFO L640 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-10-03 04:10:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-10-03 04:10:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 292. [2019-10-03 04:10:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 415 transitions. [2019-10-03 04:10:50,832 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 415 transitions. Word has length 148 [2019-10-03 04:10:50,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:50,833 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 415 transitions. [2019-10-03 04:10:50,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:50,833 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 415 transitions. [2019-10-03 04:10:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:50,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:50,836 INFO L411 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] [2019-10-03 04:10:50,836 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1306057677, now seen corresponding path program 1 times [2019-10-03 04:10:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:50,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:50,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:50,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:50,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:50,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:50,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:50,941 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:50,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:50,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:50,942 INFO L87 Difference]: Start difference. First operand 292 states and 415 transitions. Second operand 5 states. [2019-10-03 04:10:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:51,528 INFO L93 Difference]: Finished difference Result 330 states and 482 transitions. [2019-10-03 04:10:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:51,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:51,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:51,531 INFO L225 Difference]: With dead ends: 330 [2019-10-03 04:10:51,531 INFO L226 Difference]: Without dead ends: 330 [2019-10-03 04:10:51,532 INFO L640 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-10-03 04:10:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-10-03 04:10:51,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 292. [2019-10-03 04:10:51,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 414 transitions. [2019-10-03 04:10:51,546 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 414 transitions. Word has length 148 [2019-10-03 04:10:51,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:51,546 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 414 transitions. [2019-10-03 04:10:51,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:51,547 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 414 transitions. [2019-10-03 04:10:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:51,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:51,549 INFO L411 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] [2019-10-03 04:10:51,550 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:51,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -415945009, now seen corresponding path program 1 times [2019-10-03 04:10:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:51,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:51,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:51,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:51,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:51,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:51,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:51,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:51,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:51,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:51,678 INFO L87 Difference]: Start difference. First operand 292 states and 414 transitions. Second operand 5 states. [2019-10-03 04:10:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:52,288 INFO L93 Difference]: Finished difference Result 328 states and 477 transitions. [2019-10-03 04:10:52,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:52,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:52,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:52,291 INFO L225 Difference]: With dead ends: 328 [2019-10-03 04:10:52,292 INFO L226 Difference]: Without dead ends: 328 [2019-10-03 04:10:52,292 INFO L640 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-10-03 04:10:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-10-03 04:10:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 292. [2019-10-03 04:10:52,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 413 transitions. [2019-10-03 04:10:52,305 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 413 transitions. Word has length 148 [2019-10-03 04:10:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:52,305 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 413 transitions. [2019-10-03 04:10:52,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 413 transitions. [2019-10-03 04:10:52,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:52,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:52,309 INFO L411 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] [2019-10-03 04:10:52,309 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:52,309 INFO L82 PathProgramCache]: Analyzing trace with hash -748588147, now seen corresponding path program 1 times [2019-10-03 04:10:52,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:52,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:52,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:52,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:52,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:52,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:52,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:52,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:52,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:52,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:52,414 INFO L87 Difference]: Start difference. First operand 292 states and 413 transitions. Second operand 5 states. [2019-10-03 04:10:53,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:53,018 INFO L93 Difference]: Finished difference Result 357 states and 528 transitions. [2019-10-03 04:10:53,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:53,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:53,023 INFO L225 Difference]: With dead ends: 357 [2019-10-03 04:10:53,023 INFO L226 Difference]: Without dead ends: 357 [2019-10-03 04:10:53,023 INFO L640 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-10-03 04:10:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-10-03 04:10:53,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 292. [2019-10-03 04:10:53,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 412 transitions. [2019-10-03 04:10:53,036 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 412 transitions. Word has length 148 [2019-10-03 04:10:53,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:53,036 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 412 transitions. [2019-10-03 04:10:53,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:53,036 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 412 transitions. [2019-10-03 04:10:53,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:53,038 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:53,039 INFO L411 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] [2019-10-03 04:10:53,039 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:53,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1180344079, now seen corresponding path program 1 times [2019-10-03 04:10:53,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:53,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:53,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:53,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:53,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:53,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:53,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:53,114 INFO L87 Difference]: Start difference. First operand 292 states and 412 transitions. Second operand 5 states. [2019-10-03 04:10:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:53,773 INFO L93 Difference]: Finished difference Result 351 states and 518 transitions. [2019-10-03 04:10:53,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:53,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:53,777 INFO L225 Difference]: With dead ends: 351 [2019-10-03 04:10:53,777 INFO L226 Difference]: Without dead ends: 351 [2019-10-03 04:10:53,777 INFO L640 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-10-03 04:10:53,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-10-03 04:10:53,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 292. [2019-10-03 04:10:53,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2019-10-03 04:10:53,797 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 148 [2019-10-03 04:10:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:53,797 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2019-10-03 04:10:53,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:53,798 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2019-10-03 04:10:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:53,800 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:53,800 INFO L411 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] [2019-10-03 04:10:53,800 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:53,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:53,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1112736947, now seen corresponding path program 1 times [2019-10-03 04:10:53,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:53,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:53,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:53,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:53,893 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:53,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:53,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:53,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:53,894 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand 5 states. [2019-10-03 04:10:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:54,468 INFO L93 Difference]: Finished difference Result 353 states and 518 transitions. [2019-10-03 04:10:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:54,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:54,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:54,471 INFO L225 Difference]: With dead ends: 353 [2019-10-03 04:10:54,471 INFO L226 Difference]: Without dead ends: 353 [2019-10-03 04:10:54,472 INFO L640 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-10-03 04:10:54,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-10-03 04:10:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 292. [2019-10-03 04:10:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:54,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 410 transitions. [2019-10-03 04:10:54,485 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 410 transitions. Word has length 148 [2019-10-03 04:10:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:54,485 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 410 transitions. [2019-10-03 04:10:54,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 410 transitions. [2019-10-03 04:10:54,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:54,488 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:54,488 INFO L411 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] [2019-10-03 04:10:54,488 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:54,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:54,489 INFO L82 PathProgramCache]: Analyzing trace with hash 614408015, now seen corresponding path program 1 times [2019-10-03 04:10:54,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:54,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:54,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:54,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:54,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:54,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:54,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:54,595 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:54,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:54,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:54,596 INFO L87 Difference]: Start difference. First operand 292 states and 410 transitions. Second operand 5 states. [2019-10-03 04:10:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,144 INFO L93 Difference]: Finished difference Result 349 states and 509 transitions. [2019-10-03 04:10:55,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:55,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:55,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,148 INFO L225 Difference]: With dead ends: 349 [2019-10-03 04:10:55,148 INFO L226 Difference]: Without dead ends: 349 [2019-10-03 04:10:55,148 INFO L640 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-10-03 04:10:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-10-03 04:10:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 292. [2019-10-03 04:10:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:55,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 409 transitions. [2019-10-03 04:10:55,162 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 409 transitions. Word has length 148 [2019-10-03 04:10:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,163 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 409 transitions. [2019-10-03 04:10:55,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 409 transitions. [2019-10-03 04:10:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:55,165 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,165 INFO L411 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] [2019-10-03 04:10:55,165 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1032954927, now seen corresponding path program 1 times [2019-10-03 04:10:55,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:55,249 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:55,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:55,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:55,251 INFO L87 Difference]: Start difference. First operand 292 states and 409 transitions. Second operand 5 states. [2019-10-03 04:10:55,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:55,798 INFO L93 Difference]: Finished difference Result 347 states and 504 transitions. [2019-10-03 04:10:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:55,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:55,801 INFO L225 Difference]: With dead ends: 347 [2019-10-03 04:10:55,801 INFO L226 Difference]: Without dead ends: 347 [2019-10-03 04:10:55,802 INFO L640 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-10-03 04:10:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-10-03 04:10:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 292. [2019-10-03 04:10:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 408 transitions. [2019-10-03 04:10:55,819 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 408 transitions. Word has length 148 [2019-10-03 04:10:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:55,819 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 408 transitions. [2019-10-03 04:10:55,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:55,819 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 408 transitions. [2019-10-03 04:10:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:55,822 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:55,823 INFO L411 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] [2019-10-03 04:10:55,823 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:55,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1130661647, now seen corresponding path program 1 times [2019-10-03 04:10:55,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:55,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:55,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:55,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:55,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:55,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:55,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:55,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:55,916 INFO L87 Difference]: Start difference. First operand 292 states and 408 transitions. Second operand 5 states. [2019-10-03 04:10:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,552 INFO L93 Difference]: Finished difference Result 345 states and 499 transitions. [2019-10-03 04:10:56,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:10:56,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:10:56,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,556 INFO L225 Difference]: With dead ends: 345 [2019-10-03 04:10:56,557 INFO L226 Difference]: Without dead ends: 345 [2019-10-03 04:10:56,557 INFO L640 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-10-03 04:10:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-03 04:10:56,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 292. [2019-10-03 04:10:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-10-03 04:10:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 407 transitions. [2019-10-03 04:10:56,571 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 407 transitions. Word has length 148 [2019-10-03 04:10:56,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:56,573 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 407 transitions. [2019-10-03 04:10:56,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:10:56,573 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 407 transitions. [2019-10-03 04:10:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:56,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:56,578 INFO L411 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] [2019-10-03 04:10:56,578 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:56,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:56,578 INFO L82 PathProgramCache]: Analyzing trace with hash 92077073, now seen corresponding path program 1 times [2019-10-03 04:10:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:56,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:56,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:56,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:56,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:56,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:56,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:56,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:56,666 INFO L87 Difference]: Start difference. First operand 292 states and 407 transitions. Second operand 6 states. [2019-10-03 04:10:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:56,704 INFO L93 Difference]: Finished difference Result 317 states and 447 transitions. [2019-10-03 04:10:56,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:56,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:56,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:56,707 INFO L225 Difference]: With dead ends: 317 [2019-10-03 04:10:56,707 INFO L226 Difference]: Without dead ends: 317 [2019-10-03 04:10:56,707 INFO L640 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-10-03 04:10:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-03 04:10:56,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 297. [2019-10-03 04:10:56,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-10-03 04:10:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 412 transitions. [2019-10-03 04:10:56,718 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 412 transitions. Word has length 148 [2019-10-03 04:10:56,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:56,719 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 412 transitions. [2019-10-03 04:10:56,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 412 transitions. [2019-10-03 04:10:56,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:56,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:56,721 INFO L411 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] [2019-10-03 04:10:56,722 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:56,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:56,722 INFO L82 PathProgramCache]: Analyzing trace with hash -964654129, now seen corresponding path program 1 times [2019-10-03 04:10:56,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:56,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:56,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:56,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:56,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:56,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:56,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:56,829 INFO L87 Difference]: Start difference. First operand 297 states and 412 transitions. Second operand 4 states. [2019-10-03 04:10:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:57,154 INFO L93 Difference]: Finished difference Result 562 states and 776 transitions. [2019-10-03 04:10:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:57,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-03 04:10:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:57,160 INFO L225 Difference]: With dead ends: 562 [2019-10-03 04:10:57,160 INFO L226 Difference]: Without dead ends: 562 [2019-10-03 04:10:57,160 INFO L640 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-10-03 04:10:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-10-03 04:10:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 556. [2019-10-03 04:10:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-10-03 04:10:57,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 771 transitions. [2019-10-03 04:10:57,183 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 771 transitions. Word has length 148 [2019-10-03 04:10:57,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:57,183 INFO L475 AbstractCegarLoop]: Abstraction has 556 states and 771 transitions. [2019-10-03 04:10:57,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:57,184 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 771 transitions. [2019-10-03 04:10:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:57,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:57,188 INFO L411 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] [2019-10-03 04:10:57,188 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:57,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash 152530832, now seen corresponding path program 1 times [2019-10-03 04:10:57,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:57,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:57,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:57,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:57,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:57,259 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:57,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:57,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:57,260 INFO L87 Difference]: Start difference. First operand 556 states and 771 transitions. Second operand 6 states. [2019-10-03 04:10:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:57,292 INFO L93 Difference]: Finished difference Result 578 states and 804 transitions. [2019-10-03 04:10:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:57,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:57,295 INFO L225 Difference]: With dead ends: 578 [2019-10-03 04:10:57,295 INFO L226 Difference]: Without dead ends: 578 [2019-10-03 04:10:57,296 INFO L640 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-10-03 04:10:57,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-10-03 04:10:57,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 561. [2019-10-03 04:10:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-03 04:10:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 775 transitions. [2019-10-03 04:10:57,312 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 775 transitions. Word has length 148 [2019-10-03 04:10:57,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:57,313 INFO L475 AbstractCegarLoop]: Abstraction has 561 states and 775 transitions. [2019-10-03 04:10:57,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:57,313 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 775 transitions. [2019-10-03 04:10:57,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:57,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:57,315 INFO L411 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] [2019-10-03 04:10:57,315 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:57,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:57,316 INFO L82 PathProgramCache]: Analyzing trace with hash -433745390, now seen corresponding path program 1 times [2019-10-03 04:10:57,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:57,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:57,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:57,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:57,400 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:57,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:57,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:57,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:57,401 INFO L87 Difference]: Start difference. First operand 561 states and 775 transitions. Second operand 4 states. [2019-10-03 04:10:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:57,842 INFO L93 Difference]: Finished difference Result 1084 states and 1492 transitions. [2019-10-03 04:10:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:57,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-03 04:10:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:57,851 INFO L225 Difference]: With dead ends: 1084 [2019-10-03 04:10:57,852 INFO L226 Difference]: Without dead ends: 1084 [2019-10-03 04:10:57,852 INFO L640 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-10-03 04:10:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-10-03 04:10:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1076. [2019-10-03 04:10:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-10-03 04:10:57,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1485 transitions. [2019-10-03 04:10:57,895 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1485 transitions. Word has length 148 [2019-10-03 04:10:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:57,895 INFO L475 AbstractCegarLoop]: Abstraction has 1076 states and 1485 transitions. [2019-10-03 04:10:57,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1485 transitions. [2019-10-03 04:10:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:57,898 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:57,899 INFO L411 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] [2019-10-03 04:10:57,899 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:57,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash -888651471, now seen corresponding path program 1 times [2019-10-03 04:10:57,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:57,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:57,986 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:57,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:57,987 INFO L87 Difference]: Start difference. First operand 1076 states and 1485 transitions. Second operand 6 states. [2019-10-03 04:10:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:58,022 INFO L93 Difference]: Finished difference Result 1114 states and 1541 transitions. [2019-10-03 04:10:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:58,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:58,029 INFO L225 Difference]: With dead ends: 1114 [2019-10-03 04:10:58,029 INFO L226 Difference]: Without dead ends: 1114 [2019-10-03 04:10:58,030 INFO L640 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-10-03 04:10:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2019-10-03 04:10:58,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1086. [2019-10-03 04:10:58,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2019-10-03 04:10:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1493 transitions. [2019-10-03 04:10:58,061 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1493 transitions. Word has length 148 [2019-10-03 04:10:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:58,062 INFO L475 AbstractCegarLoop]: Abstraction has 1086 states and 1493 transitions. [2019-10-03 04:10:58,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1493 transitions. [2019-10-03 04:10:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:58,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:58,065 INFO L411 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] [2019-10-03 04:10:58,065 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash -49617809, now seen corresponding path program 1 times [2019-10-03 04:10:58,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:58,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:58,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:58,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:58,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:58,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:58,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:58,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:58,135 INFO L87 Difference]: Start difference. First operand 1086 states and 1493 transitions. Second operand 4 states. [2019-10-03 04:10:58,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:58,407 INFO L93 Difference]: Finished difference Result 2122 states and 2910 transitions. [2019-10-03 04:10:58,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:58,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-03 04:10:58,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:58,421 INFO L225 Difference]: With dead ends: 2122 [2019-10-03 04:10:58,421 INFO L226 Difference]: Without dead ends: 2122 [2019-10-03 04:10:58,422 INFO L640 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-10-03 04:10:58,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2019-10-03 04:10:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2110. [2019-10-03 04:10:58,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-10-03 04:10:58,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2899 transitions. [2019-10-03 04:10:58,491 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2899 transitions. Word has length 148 [2019-10-03 04:10:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:58,492 INFO L475 AbstractCegarLoop]: Abstraction has 2110 states and 2899 transitions. [2019-10-03 04:10:58,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:58,492 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2899 transitions. [2019-10-03 04:10:58,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:58,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:58,494 INFO L411 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] [2019-10-03 04:10:58,494 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:58,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,495 INFO L82 PathProgramCache]: Analyzing trace with hash 91481712, now seen corresponding path program 1 times [2019-10-03 04:10:58,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:58,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:58,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:58,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:58,572 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:58,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:58,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:58,575 INFO L87 Difference]: Start difference. First operand 2110 states and 2899 transitions. Second operand 6 states. [2019-10-03 04:10:58,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:58,618 INFO L93 Difference]: Finished difference Result 2174 states and 2991 transitions. [2019-10-03 04:10:58,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:58,619 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:58,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:58,632 INFO L225 Difference]: With dead ends: 2174 [2019-10-03 04:10:58,632 INFO L226 Difference]: Without dead ends: 2174 [2019-10-03 04:10:58,634 INFO L640 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-10-03 04:10:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2019-10-03 04:10:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2130. [2019-10-03 04:10:58,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-10-03 04:10:58,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2915 transitions. [2019-10-03 04:10:58,702 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2915 transitions. Word has length 148 [2019-10-03 04:10:58,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:58,703 INFO L475 AbstractCegarLoop]: Abstraction has 2130 states and 2915 transitions. [2019-10-03 04:10:58,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:58,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2915 transitions. [2019-10-03 04:10:58,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:58,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:58,705 INFO L411 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] [2019-10-03 04:10:58,705 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,705 INFO L82 PathProgramCache]: Analyzing trace with hash -401144462, now seen corresponding path program 1 times [2019-10-03 04:10:58,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:58,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:58,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:58,796 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:58,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:58,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:58,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:58,797 INFO L87 Difference]: Start difference. First operand 2130 states and 2915 transitions. Second operand 6 states. [2019-10-03 04:10:58,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:58,831 INFO L93 Difference]: Finished difference Result 2234 states and 3068 transitions. [2019-10-03 04:10:58,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:58,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:58,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:58,844 INFO L225 Difference]: With dead ends: 2234 [2019-10-03 04:10:58,844 INFO L226 Difference]: Without dead ends: 2234 [2019-10-03 04:10:58,844 INFO L640 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-10-03 04:10:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2019-10-03 04:10:58,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 2170. [2019-10-03 04:10:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2170 states. [2019-10-03 04:10:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2170 states to 2170 states and 2955 transitions. [2019-10-03 04:10:58,901 INFO L78 Accepts]: Start accepts. Automaton has 2170 states and 2955 transitions. Word has length 148 [2019-10-03 04:10:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:58,901 INFO L475 AbstractCegarLoop]: Abstraction has 2170 states and 2955 transitions. [2019-10-03 04:10:58,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 2170 states and 2955 transitions. [2019-10-03 04:10:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:58,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:58,904 INFO L411 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] [2019-10-03 04:10:58,904 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash -199320528, now seen corresponding path program 1 times [2019-10-03 04:10:58,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:58,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:58,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:58,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:58,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:58,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:58,972 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:58,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:58,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:58,973 INFO L87 Difference]: Start difference. First operand 2170 states and 2955 transitions. Second operand 6 states. [2019-10-03 04:10:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:59,007 INFO L93 Difference]: Finished difference Result 2250 states and 3068 transitions. [2019-10-03 04:10:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:59,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:59,038 INFO L225 Difference]: With dead ends: 2250 [2019-10-03 04:10:59,038 INFO L226 Difference]: Without dead ends: 2250 [2019-10-03 04:10:59,039 INFO L640 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-10-03 04:10:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2250 states. [2019-10-03 04:10:59,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2250 to 2210. [2019-10-03 04:10:59,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2210 states. [2019-10-03 04:10:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2210 states to 2210 states and 2995 transitions. [2019-10-03 04:10:59,099 INFO L78 Accepts]: Start accepts. Automaton has 2210 states and 2995 transitions. Word has length 148 [2019-10-03 04:10:59,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:59,100 INFO L475 AbstractCegarLoop]: Abstraction has 2210 states and 2995 transitions. [2019-10-03 04:10:59,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:59,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2210 states and 2995 transitions. [2019-10-03 04:10:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:59,102 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:59,102 INFO L411 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] [2019-10-03 04:10:59,103 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:59,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:59,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2067060658, now seen corresponding path program 1 times [2019-10-03 04:10:59,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:59,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:59,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:10:59,176 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:59,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:10:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:10:59,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:10:59,177 INFO L87 Difference]: Start difference. First operand 2210 states and 2995 transitions. Second operand 4 states. [2019-10-03 04:10:59,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:59,456 INFO L93 Difference]: Finished difference Result 4346 states and 5884 transitions. [2019-10-03 04:10:59,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:10:59,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-03 04:10:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:59,479 INFO L225 Difference]: With dead ends: 4346 [2019-10-03 04:10:59,480 INFO L226 Difference]: Without dead ends: 4346 [2019-10-03 04:10:59,480 INFO L640 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-10-03 04:10:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4346 states. [2019-10-03 04:10:59,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4346 to 4326. [2019-10-03 04:10:59,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4326 states. [2019-10-03 04:10:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4326 states to 4326 states and 5865 transitions. [2019-10-03 04:10:59,588 INFO L78 Accepts]: Start accepts. Automaton has 4326 states and 5865 transitions. Word has length 148 [2019-10-03 04:10:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:59,589 INFO L475 AbstractCegarLoop]: Abstraction has 4326 states and 5865 transitions. [2019-10-03 04:10:59,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:10:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4326 states and 5865 transitions. [2019-10-03 04:10:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:59,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:59,591 INFO L411 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] [2019-10-03 04:10:59,591 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash -795071919, now seen corresponding path program 1 times [2019-10-03 04:10:59,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:59,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:59,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 04:10:59,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:59,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 04:10:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 04:10:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:10:59,654 INFO L87 Difference]: Start difference. First operand 4326 states and 5865 transitions. Second operand 6 states. [2019-10-03 04:10:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:10:59,694 INFO L93 Difference]: Finished difference Result 4382 states and 5929 transitions. [2019-10-03 04:10:59,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:10:59,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 148 [2019-10-03 04:10:59,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:10:59,715 INFO L225 Difference]: With dead ends: 4382 [2019-10-03 04:10:59,715 INFO L226 Difference]: Without dead ends: 4382 [2019-10-03 04:10:59,716 INFO L640 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-10-03 04:10:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2019-10-03 04:10:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4366. [2019-10-03 04:10:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4366 states. [2019-10-03 04:10:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4366 states to 4366 states and 5897 transitions. [2019-10-03 04:10:59,826 INFO L78 Accepts]: Start accepts. Automaton has 4366 states and 5897 transitions. Word has length 148 [2019-10-03 04:10:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:10:59,826 INFO L475 AbstractCegarLoop]: Abstraction has 4366 states and 5897 transitions. [2019-10-03 04:10:59,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 04:10:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4366 states and 5897 transitions. [2019-10-03 04:10:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:10:59,828 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:10:59,828 INFO L411 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] [2019-10-03 04:10:59,829 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:10:59,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:10:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash -546925425, now seen corresponding path program 1 times [2019-10-03 04:10:59,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:10:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:10:59,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:10:59,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:10:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:10:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:10:59,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:10:59,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:10:59,922 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:10:59,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:10:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:10:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:10:59,924 INFO L87 Difference]: Start difference. First operand 4366 states and 5897 transitions. Second operand 5 states. [2019-10-03 04:11:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:00,682 INFO L93 Difference]: Finished difference Result 6398 states and 8522 transitions. [2019-10-03 04:11:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:00,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:00,722 INFO L225 Difference]: With dead ends: 6398 [2019-10-03 04:11:00,723 INFO L226 Difference]: Without dead ends: 6398 [2019-10-03 04:11:00,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-10-03 04:11:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6398 states. [2019-10-03 04:11:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6398 to 5902. [2019-10-03 04:11:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2019-10-03 04:11:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7609 transitions. [2019-10-03 04:11:00,936 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7609 transitions. Word has length 148 [2019-10-03 04:11:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:00,937 INFO L475 AbstractCegarLoop]: Abstraction has 5902 states and 7609 transitions. [2019-10-03 04:11:00,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:00,937 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7609 transitions. [2019-10-03 04:11:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:00,939 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:00,939 INFO L411 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] [2019-10-03 04:11:00,939 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:00,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1576284723, now seen corresponding path program 1 times [2019-10-03 04:11:00,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:00,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:00,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:01,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:01,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:01,025 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:01,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:01,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:01,027 INFO L87 Difference]: Start difference. First operand 5902 states and 7609 transitions. Second operand 5 states. [2019-10-03 04:11:01,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:01,702 INFO L93 Difference]: Finished difference Result 5902 states and 7577 transitions. [2019-10-03 04:11:01,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:11:01,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:01,724 INFO L225 Difference]: With dead ends: 5902 [2019-10-03 04:11:01,724 INFO L226 Difference]: Without dead ends: 5902 [2019-10-03 04:11:01,724 INFO L640 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-10-03 04:11:01,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2019-10-03 04:11:01,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5902. [2019-10-03 04:11:01,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5902 states. [2019-10-03 04:11:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5902 states to 5902 states and 7577 transitions. [2019-10-03 04:11:01,855 INFO L78 Accepts]: Start accepts. Automaton has 5902 states and 7577 transitions. Word has length 148 [2019-10-03 04:11:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:01,855 INFO L475 AbstractCegarLoop]: Abstraction has 5902 states and 7577 transitions. [2019-10-03 04:11:01,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 5902 states and 7577 transitions. [2019-10-03 04:11:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:01,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:01,858 INFO L411 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] [2019-10-03 04:11:01,858 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash -916753201, now seen corresponding path program 1 times [2019-10-03 04:11:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:01,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:01,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:01,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:01,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-10-03 04:11:01,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:01,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:01,965 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:01,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:01,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:01,966 INFO L87 Difference]: Start difference. First operand 5902 states and 7577 transitions. Second operand 5 states. [2019-10-03 04:11:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:02,760 INFO L93 Difference]: Finished difference Result 8224 states and 10560 transitions. [2019-10-03 04:11:02,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:02,760 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:02,804 INFO L225 Difference]: With dead ends: 8224 [2019-10-03 04:11:02,804 INFO L226 Difference]: Without dead ends: 8224 [2019-10-03 04:11:02,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-10-03 04:11:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8224 states. [2019-10-03 04:11:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8224 to 7936. [2019-10-03 04:11:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-03 04:11:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 10015 transitions. [2019-10-03 04:11:03,003 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 10015 transitions. Word has length 148 [2019-10-03 04:11:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:03,006 INFO L475 AbstractCegarLoop]: Abstraction has 7936 states and 10015 transitions. [2019-10-03 04:11:03,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 10015 transitions. [2019-10-03 04:11:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:03,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:03,008 INFO L411 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] [2019-10-03 04:11:03,008 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:03,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1311119987, now seen corresponding path program 1 times [2019-10-03 04:11:03,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:03,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:03,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:03,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:03,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:03,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:03,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:03,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:03,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:03,096 INFO L87 Difference]: Start difference. First operand 7936 states and 10015 transitions. Second operand 5 states. [2019-10-03 04:11:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:03,657 INFO L93 Difference]: Finished difference Result 7936 states and 9967 transitions. [2019-10-03 04:11:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:11:03,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:03,683 INFO L225 Difference]: With dead ends: 7936 [2019-10-03 04:11:03,683 INFO L226 Difference]: Without dead ends: 7936 [2019-10-03 04:11:03,683 INFO L640 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-10-03 04:11:03,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-10-03 04:11:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7936. [2019-10-03 04:11:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-03 04:11:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 9967 transitions. [2019-10-03 04:11:03,817 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 9967 transitions. Word has length 148 [2019-10-03 04:11:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:03,818 INFO L475 AbstractCegarLoop]: Abstraction has 7936 states and 9967 transitions. [2019-10-03 04:11:03,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 9967 transitions. [2019-10-03 04:11:03,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:03,820 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:03,820 INFO L411 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] [2019-10-03 04:11:03,821 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:03,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:03,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2139841807, now seen corresponding path program 1 times [2019-10-03 04:11:03,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:03,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:03,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-10-03 04:11:03,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:03,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:03,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:03,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:03,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:03,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:03,904 INFO L87 Difference]: Start difference. First operand 7936 states and 9967 transitions. Second operand 5 states. [2019-10-03 04:11:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:04,441 INFO L93 Difference]: Finished difference Result 7936 states and 9919 transitions. [2019-10-03 04:11:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:11:04,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:04,462 INFO L225 Difference]: With dead ends: 7936 [2019-10-03 04:11:04,462 INFO L226 Difference]: Without dead ends: 7936 [2019-10-03 04:11:04,463 INFO L640 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-10-03 04:11:04,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-10-03 04:11:04,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7936. [2019-10-03 04:11:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-03 04:11:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 9919 transitions. [2019-10-03 04:11:04,585 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 9919 transitions. Word has length 148 [2019-10-03 04:11:04,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:04,586 INFO L475 AbstractCegarLoop]: Abstraction has 7936 states and 9919 transitions. [2019-10-03 04:11:04,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 9919 transitions. [2019-10-03 04:11:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:04,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:04,588 INFO L411 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] [2019-10-03 04:11:04,589 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash -104141491, now seen corresponding path program 1 times [2019-10-03 04:11:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:04,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:04,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:04,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:04,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:04,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:04,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:04,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:04,702 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:04,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:04,703 INFO L87 Difference]: Start difference. First operand 7936 states and 9919 transitions. Second operand 5 states. [2019-10-03 04:11:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:05,524 INFO L93 Difference]: Finished difference Result 7936 states and 9871 transitions. [2019-10-03 04:11:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 04:11:05,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:05,544 INFO L225 Difference]: With dead ends: 7936 [2019-10-03 04:11:05,544 INFO L226 Difference]: Without dead ends: 7936 [2019-10-03 04:11:05,545 INFO L640 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-10-03 04:11:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2019-10-03 04:11:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7936. [2019-10-03 04:11:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7936 states. [2019-10-03 04:11:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7936 states to 7936 states and 9871 transitions. [2019-10-03 04:11:05,662 INFO L78 Accepts]: Start accepts. Automaton has 7936 states and 9871 transitions. Word has length 148 [2019-10-03 04:11:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:05,662 INFO L475 AbstractCegarLoop]: Abstraction has 7936 states and 9871 transitions. [2019-10-03 04:11:05,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7936 states and 9871 transitions. [2019-10-03 04:11:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:05,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:05,665 INFO L411 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] [2019-10-03 04:11:05,665 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash 170618123, now seen corresponding path program 1 times [2019-10-03 04:11:05,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:05,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:05,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:05,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:05,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:05,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:05,759 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:05,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:05,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:05,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:05,760 INFO L87 Difference]: Start difference. First operand 7936 states and 9871 transitions. Second operand 5 states. [2019-10-03 04:11:06,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:06,646 INFO L93 Difference]: Finished difference Result 9608 states and 12003 transitions. [2019-10-03 04:11:06,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:06,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:06,674 INFO L225 Difference]: With dead ends: 9608 [2019-10-03 04:11:06,674 INFO L226 Difference]: Without dead ends: 9608 [2019-10-03 04:11:06,675 INFO L640 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-10-03 04:11:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9608 states. [2019-10-03 04:11:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9608 to 8544. [2019-10-03 04:11:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8544 states. [2019-10-03 04:11:06,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8544 states to 8544 states and 10455 transitions. [2019-10-03 04:11:06,817 INFO L78 Accepts]: Start accepts. Automaton has 8544 states and 10455 transitions. Word has length 148 [2019-10-03 04:11:06,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:06,817 INFO L475 AbstractCegarLoop]: Abstraction has 8544 states and 10455 transitions. [2019-10-03 04:11:06,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 8544 states and 10455 transitions. [2019-10-03 04:11:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:06,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:06,819 INFO L411 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] [2019-10-03 04:11:06,820 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:06,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash 872217997, now seen corresponding path program 1 times [2019-10-03 04:11:06,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:06,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:06,822 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:06,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:06,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:06,892 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:06,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:06,893 INFO L87 Difference]: Start difference. First operand 8544 states and 10455 transitions. Second operand 5 states. [2019-10-03 04:11:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:07,825 INFO L93 Difference]: Finished difference Result 10620 states and 13430 transitions. [2019-10-03 04:11:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:07,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:07,866 INFO L225 Difference]: With dead ends: 10620 [2019-10-03 04:11:07,867 INFO L226 Difference]: Without dead ends: 10620 [2019-10-03 04:11:07,867 INFO L640 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-10-03 04:11:07,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10620 states. [2019-10-03 04:11:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10620 to 9860. [2019-10-03 04:11:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9860 states. [2019-10-03 04:11:08,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9860 states to 9860 states and 11851 transitions. [2019-10-03 04:11:08,105 INFO L78 Accepts]: Start accepts. Automaton has 9860 states and 11851 transitions. Word has length 148 [2019-10-03 04:11:08,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:08,105 INFO L475 AbstractCegarLoop]: Abstraction has 9860 states and 11851 transitions. [2019-10-03 04:11:08,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:08,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9860 states and 11851 transitions. [2019-10-03 04:11:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:08,108 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:08,109 INFO L411 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] [2019-10-03 04:11:08,109 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:08,110 INFO L82 PathProgramCache]: Analyzing trace with hash 894850251, now seen corresponding path program 1 times [2019-10-03 04:11:08,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:08,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:08,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:08,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:08,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:08,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:08,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:08,248 INFO L87 Difference]: Start difference. First operand 9860 states and 11851 transitions. Second operand 5 states. [2019-10-03 04:11:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:09,421 INFO L93 Difference]: Finished difference Result 10804 states and 13147 transitions. [2019-10-03 04:11:09,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:09,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:09,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:09,455 INFO L225 Difference]: With dead ends: 10804 [2019-10-03 04:11:09,456 INFO L226 Difference]: Without dead ends: 10804 [2019-10-03 04:11:09,457 INFO L640 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-10-03 04:11:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10804 states. [2019-10-03 04:11:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10804 to 10424. [2019-10-03 04:11:09,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10424 states. [2019-10-03 04:11:09,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10424 states to 10424 states and 12371 transitions. [2019-10-03 04:11:09,683 INFO L78 Accepts]: Start accepts. Automaton has 10424 states and 12371 transitions. Word has length 148 [2019-10-03 04:11:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:09,683 INFO L475 AbstractCegarLoop]: Abstraction has 10424 states and 12371 transitions. [2019-10-03 04:11:09,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:09,684 INFO L276 IsEmpty]: Start isEmpty. Operand 10424 states and 12371 transitions. [2019-10-03 04:11:09,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:09,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:09,686 INFO L411 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] [2019-10-03 04:11:09,686 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:09,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:09,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2013913651, now seen corresponding path program 1 times [2019-10-03 04:11:09,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:09,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:09,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:09,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:09,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:09,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:09,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:09,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:09,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:09,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:09,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:09,812 INFO L87 Difference]: Start difference. First operand 10424 states and 12371 transitions. Second operand 5 states. [2019-10-03 04:11:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:11,058 INFO L93 Difference]: Finished difference Result 14216 states and 17226 transitions. [2019-10-03 04:11:11,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 04:11:11,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:11,102 INFO L225 Difference]: With dead ends: 14216 [2019-10-03 04:11:11,102 INFO L226 Difference]: Without dead ends: 14216 [2019-10-03 04:11:11,104 INFO L640 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-10-03 04:11:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14216 states. [2019-10-03 04:11:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14216 to 13676. [2019-10-03 04:11:11,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13676 states. [2019-10-03 04:11:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13676 states to 13676 states and 16065 transitions. [2019-10-03 04:11:11,399 INFO L78 Accepts]: Start accepts. Automaton has 13676 states and 16065 transitions. Word has length 148 [2019-10-03 04:11:11,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:11,399 INFO L475 AbstractCegarLoop]: Abstraction has 13676 states and 16065 transitions. [2019-10-03 04:11:11,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 13676 states and 16065 transitions. [2019-10-03 04:11:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:11,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:11,402 INFO L411 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] [2019-10-03 04:11:11,402 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:11,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1771580555, now seen corresponding path program 1 times [2019-10-03 04:11:11,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:11,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:11,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:11,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:11,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:11,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:11,482 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:11,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:11,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:11,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:11,484 INFO L87 Difference]: Start difference. First operand 13676 states and 16065 transitions. Second operand 5 states. [2019-10-03 04:11:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:12,246 INFO L93 Difference]: Finished difference Result 14508 states and 17189 transitions. [2019-10-03 04:11:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:12,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:12,280 INFO L225 Difference]: With dead ends: 14508 [2019-10-03 04:11:12,280 INFO L226 Difference]: Without dead ends: 14508 [2019-10-03 04:11:12,281 INFO L640 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-10-03 04:11:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14508 states. [2019-10-03 04:11:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14508 to 13844. [2019-10-03 04:11:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13844 states. [2019-10-03 04:11:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13844 states to 13844 states and 16001 transitions. [2019-10-03 04:11:12,506 INFO L78 Accepts]: Start accepts. Automaton has 13844 states and 16001 transitions. Word has length 148 [2019-10-03 04:11:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:12,507 INFO L475 AbstractCegarLoop]: Abstraction has 13844 states and 16001 transitions. [2019-10-03 04:11:12,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 13844 states and 16001 transitions. [2019-10-03 04:11:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:12,509 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:12,509 INFO L411 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] [2019-10-03 04:11:12,509 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:12,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash -600158707, now seen corresponding path program 1 times [2019-10-03 04:11:12,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:12,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:12,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:12,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:12,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 04:11:12,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:12,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 04:11:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 04:11:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 04:11:12,591 INFO L87 Difference]: Start difference. First operand 13844 states and 16001 transitions. Second operand 5 states. [2019-10-03 04:11:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:13,393 INFO L93 Difference]: Finished difference Result 15700 states and 18692 transitions. [2019-10-03 04:11:13,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 04:11:13,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-03 04:11:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:13,428 INFO L225 Difference]: With dead ends: 15700 [2019-10-03 04:11:13,428 INFO L226 Difference]: Without dead ends: 15700 [2019-10-03 04:11:13,429 INFO L640 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-10-03 04:11:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15700 states. [2019-10-03 04:11:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15700 to 14548. [2019-10-03 04:11:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14548 states. [2019-10-03 04:11:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14548 states to 14548 states and 16513 transitions. [2019-10-03 04:11:13,683 INFO L78 Accepts]: Start accepts. Automaton has 14548 states and 16513 transitions. Word has length 148 [2019-10-03 04:11:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:13,684 INFO L475 AbstractCegarLoop]: Abstraction has 14548 states and 16513 transitions. [2019-10-03 04:11:13,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 04:11:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14548 states and 16513 transitions. [2019-10-03 04:11:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-03 04:11:13,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:13,686 INFO L411 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] [2019-10-03 04:11:13,687 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash -538119093, now seen corresponding path program 1 times [2019-10-03 04:11:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:13,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:13,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 04:11:13,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:13,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 04:11:13,757 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:13,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:11:13,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:11:13,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 04:11:13,758 INFO L87 Difference]: Start difference. First operand 14548 states and 16513 transitions. Second operand 3 states. [2019-10-03 04:11:13,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:13,863 INFO L93 Difference]: Finished difference Result 28708 states and 33040 transitions. [2019-10-03 04:11:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:11:13,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-03 04:11:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:13,927 INFO L225 Difference]: With dead ends: 28708 [2019-10-03 04:11:13,927 INFO L226 Difference]: Without dead ends: 28708 [2019-10-03 04:11:13,928 INFO L640 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-10-03 04:11:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28708 states. [2019-10-03 04:11:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28708 to 28692. [2019-10-03 04:11:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28692 states. [2019-10-03 04:11:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28692 states to 28692 states and 33024 transitions. [2019-10-03 04:11:14,372 INFO L78 Accepts]: Start accepts. Automaton has 28692 states and 33024 transitions. Word has length 148 [2019-10-03 04:11:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:14,373 INFO L475 AbstractCegarLoop]: Abstraction has 28692 states and 33024 transitions. [2019-10-03 04:11:14,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:11:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28692 states and 33024 transitions. [2019-10-03 04:11:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-03 04:11:14,404 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:14,405 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:14,405 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:14,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:14,405 INFO L82 PathProgramCache]: Analyzing trace with hash -645143150, now seen corresponding path program 1 times [2019-10-03 04:11:14,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:14,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:14,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:14,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:14,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-03 04:11:14,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 04:11:14,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 04:11:14,496 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:14,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 04:11:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 04:11:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 04:11:14,497 INFO L87 Difference]: Start difference. First operand 28692 states and 33024 transitions. Second operand 4 states. [2019-10-03 04:11:15,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:11:15,066 INFO L93 Difference]: Finished difference Result 48603 states and 55800 transitions. [2019-10-03 04:11:15,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 04:11:15,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2019-10-03 04:11:15,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:11:15,170 INFO L225 Difference]: With dead ends: 48603 [2019-10-03 04:11:15,170 INFO L226 Difference]: Without dead ends: 35722 [2019-10-03 04:11:15,170 INFO L640 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-10-03 04:11:15,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35722 states. [2019-10-03 04:11:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35722 to 35050. [2019-10-03 04:11:15,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35050 states. [2019-10-03 04:11:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35050 states to 35050 states and 39893 transitions. [2019-10-03 04:11:15,677 INFO L78 Accepts]: Start accepts. Automaton has 35050 states and 39893 transitions. Word has length 243 [2019-10-03 04:11:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:11:15,677 INFO L475 AbstractCegarLoop]: Abstraction has 35050 states and 39893 transitions. [2019-10-03 04:11:15,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 04:11:15,678 INFO L276 IsEmpty]: Start isEmpty. Operand 35050 states and 39893 transitions. [2019-10-03 04:11:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2019-10-03 04:11:15,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:11:15,760 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:11:15,761 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:11:15,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:15,761 INFO L82 PathProgramCache]: Analyzing trace with hash 502085592, now seen corresponding path program 1 times [2019-10-03 04:11:15,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:11:15,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:15,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:11:15,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:11:15,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:11:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:11:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-10-03 04:11:15,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:11:15,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:11:15,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 491 with the following transitions: [2019-10-03 04:11:15,938 INFO L207 CegarAbsIntRunner]: [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [182], [184], [187], [191], [192], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [773], [777], [780], [786], [799], [812], [825], [838], [851], [855], [858], [869], [870], [880], [882], [884], [885], [886], [887], [901], [903], [905], [907], [912], [920], [923], [928], [936], [937], [948], [949], [950], [951], [952], [954], [955], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1005], [1006], [1007], [1008], [1009], [1010], [1011], [1012], [1013], [1014], [1015], [1022], [1023], [1024], [1025], [1026] [2019-10-03 04:11:15,984 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:11:15,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:11:16,313 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:11:16,316 INFO L272 AbstractInterpreter]: Visited 162 different actions 231 times. Never merged. Never widened. Performed 1283 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1283 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 88 variables. [2019-10-03 04:11:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:11:16,320 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:11:17,659 INFO L227 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 70.7% of their original sizes. [2019-10-03 04:11:17,660 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:11:22,919 INFO L420 sIntCurrentIteration]: We unified 489 AI predicates to 489 [2019-10-03 04:11:22,919 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:11:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:11:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [95] imperfect sequences [3] total 96 [2019-10-03 04:11:22,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:11:22,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-10-03 04:11:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-10-03 04:11:22,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=8485, Unknown=0, NotChecked=0, Total=8930 [2019-10-03 04:11:22,925 INFO L87 Difference]: Start difference. First operand 35050 states and 39893 transitions. Second operand 95 states. [2019-10-03 04:12:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:17,632 INFO L93 Difference]: Finished difference Result 36854 states and 42174 transitions. [2019-10-03 04:12:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-10-03 04:12:17,632 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 490 [2019-10-03 04:12:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:17,732 INFO L225 Difference]: With dead ends: 36854 [2019-10-03 04:12:17,733 INFO L226 Difference]: Without dead ends: 36854 [2019-10-03 04:12:17,750 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13497 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2644, Invalid=39176, Unknown=0, NotChecked=0, Total=41820 [2019-10-03 04:12:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36854 states. [2019-10-03 04:12:18,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36854 to 36643. [2019-10-03 04:12:18,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36643 states. [2019-10-03 04:12:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36643 states to 36643 states and 41930 transitions. [2019-10-03 04:12:18,368 INFO L78 Accepts]: Start accepts. Automaton has 36643 states and 41930 transitions. Word has length 490 [2019-10-03 04:12:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:18,369 INFO L475 AbstractCegarLoop]: Abstraction has 36643 states and 41930 transitions. [2019-10-03 04:12:18,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-10-03 04:12:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 36643 states and 41930 transitions. [2019-10-03 04:12:18,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-03 04:12:18,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:18,419 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:12:18,420 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:18,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:18,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1198793098, now seen corresponding path program 1 times [2019-10-03 04:12:18,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:18,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:18,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:18,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:18,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-10-03 04:12:18,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:18,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:18,554 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2019-10-03 04:12:18,557 INFO L207 CegarAbsIntRunner]: [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [476], [479], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [786], [790], [796], [799], [803], [809], [812], [816], [822], [825], [829], [835], [838], [842], [848], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:12:18,574 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:18,574 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:18,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 04:12:18,909 INFO L272 AbstractInterpreter]: Visited 195 different actions 560 times. Merged at 45 different actions 63 times. Never widened. Performed 3793 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3793 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 90 variables. [2019-10-03 04:12:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:18,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 04:12:18,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:18,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-10-03 04:12:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:18,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 04:12:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:19,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1768 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-03 04:12:19,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 04:12:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-03 04:12:19,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 04:12:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2019-10-03 04:12:19,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-03 04:12:19,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 6 [2019-10-03 04:12:19,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:19,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 04:12:19,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 04:12:19,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:19,931 INFO L87 Difference]: Start difference. First operand 36643 states and 41930 transitions. Second operand 3 states. [2019-10-03 04:12:20,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:12:20,241 INFO L93 Difference]: Finished difference Result 56885 states and 66520 transitions. [2019-10-03 04:12:20,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 04:12:20,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-03 04:12:20,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:12:20,537 INFO L225 Difference]: With dead ends: 56885 [2019-10-03 04:12:20,537 INFO L226 Difference]: Without dead ends: 56885 [2019-10-03 04:12:20,537 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 709 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-03 04:12:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56885 states. [2019-10-03 04:12:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56885 to 56881. [2019-10-03 04:12:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56881 states. [2019-10-03 04:12:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56881 states to 56881 states and 66517 transitions. [2019-10-03 04:12:22,590 INFO L78 Accepts]: Start accepts. Automaton has 56881 states and 66517 transitions. Word has length 352 [2019-10-03 04:12:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:12:22,591 INFO L475 AbstractCegarLoop]: Abstraction has 56881 states and 66517 transitions. [2019-10-03 04:12:22,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 04:12:22,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56881 states and 66517 transitions. [2019-10-03 04:12:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-03 04:12:22,694 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:12:22,695 INFO L411 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, 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] [2019-10-03 04:12:22,695 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:12:22,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash -704235620, now seen corresponding path program 1 times [2019-10-03 04:12:22,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:12:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:22,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:12:22,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:12:22,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:12:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:12:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-10-03 04:12:22,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:12:22,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:12:22,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 353 with the following transitions: [2019-10-03 04:12:22,894 INFO L207 CegarAbsIntRunner]: [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [783], [790], [796], [799], [803], [809], [812], [816], [822], [825], [829], [835], [838], [842], [848], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:12:22,898 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:12:22,898 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:12:23,118 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:12:23,118 INFO L272 AbstractInterpreter]: Visited 188 different actions 552 times. Merged at 21 different actions 46 times. Never widened. Performed 3280 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3280 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 90 variables. [2019-10-03 04:12:23,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:12:23,118 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:12:23,460 INFO L227 lantSequenceWeakener]: Weakened 335 states. On average, predicates are now at 76.44% of their original sizes. [2019-10-03 04:12:23,460 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:12:37,627 INFO L420 sIntCurrentIteration]: We unified 351 AI predicates to 351 [2019-10-03 04:12:37,627 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:12:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:12:37,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [159] imperfect sequences [4] total 161 [2019-10-03 04:12:37,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:12:37,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 159 states [2019-10-03 04:12:37,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2019-10-03 04:12:37,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1459, Invalid=23663, Unknown=0, NotChecked=0, Total=25122 [2019-10-03 04:12:37,633 INFO L87 Difference]: Start difference. First operand 56881 states and 66517 transitions. Second operand 159 states. [2019-10-03 04:17:22,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:17:22,082 INFO L93 Difference]: Finished difference Result 72535 states and 84942 transitions. [2019-10-03 04:17:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2019-10-03 04:17:22,082 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 352 [2019-10-03 04:17:22,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:17:22,347 INFO L225 Difference]: With dead ends: 72535 [2019-10-03 04:17:22,347 INFO L226 Difference]: Without dead ends: 72535 [2019-10-03 04:17:22,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 393 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55658 ImplicationChecksByTransitivity, 38.5s TimeCoverageRelationStatistics Valid=8053, Invalid=147577, Unknown=0, NotChecked=0, Total=155630 [2019-10-03 04:17:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72535 states. [2019-10-03 04:17:23,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72535 to 72072. [2019-10-03 04:17:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72072 states. [2019-10-03 04:17:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72072 states to 72072 states and 84352 transitions. [2019-10-03 04:17:23,442 INFO L78 Accepts]: Start accepts. Automaton has 72072 states and 84352 transitions. Word has length 352 [2019-10-03 04:17:23,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:17:23,442 INFO L475 AbstractCegarLoop]: Abstraction has 72072 states and 84352 transitions. [2019-10-03 04:17:23,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 159 states. [2019-10-03 04:17:23,443 INFO L276 IsEmpty]: Start isEmpty. Operand 72072 states and 84352 transitions. [2019-10-03 04:17:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-10-03 04:17:23,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:17:23,523 INFO L411 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, 2, 2, 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] [2019-10-03 04:17:23,523 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:17:23,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:23,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1716434790, now seen corresponding path program 1 times [2019-10-03 04:17:23,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:17:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:23,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:17:23,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:17:23,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:17:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:17:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-03 04:17:23,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:17:23,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:17:23,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 356 with the following transitions: [2019-10-03 04:17:23,665 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [426], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [513], [516], [518], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [783], [790], [793], [799], [812], [825], [838], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [982], [983], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:17:23,667 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:17:23,667 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:17:23,728 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:17:23,728 INFO L272 AbstractInterpreter]: Visited 172 different actions 253 times. Merged at 4 different actions 4 times. Never widened. Performed 1465 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1465 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 88 variables. [2019-10-03 04:17:23,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:17:23,728 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:17:23,935 INFO L227 lantSequenceWeakener]: Weakened 251 states. On average, predicates are now at 72.94% of their original sizes. [2019-10-03 04:17:23,936 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:17:31,481 INFO L420 sIntCurrentIteration]: We unified 354 AI predicates to 354 [2019-10-03 04:17:31,481 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:17:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:17:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [111] imperfect sequences [4] total 113 [2019-10-03 04:17:31,481 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:17:31,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-03 04:17:31,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-03 04:17:31,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1043, Invalid=11167, Unknown=0, NotChecked=0, Total=12210 [2019-10-03 04:17:31,485 INFO L87 Difference]: Start difference. First operand 72072 states and 84352 transitions. Second operand 111 states. [2019-10-03 04:19:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:19:24,079 INFO L93 Difference]: Finished difference Result 74702 states and 87302 transitions. [2019-10-03 04:19:24,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-10-03 04:19:24,079 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 355 [2019-10-03 04:19:24,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:19:24,248 INFO L225 Difference]: With dead ends: 74702 [2019-10-03 04:19:24,249 INFO L226 Difference]: Without dead ends: 74702 [2019-10-03 04:19:24,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16724 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=4013, Invalid=48199, Unknown=0, NotChecked=0, Total=52212 [2019-10-03 04:19:24,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74702 states. [2019-10-03 04:19:24,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74702 to 73914. [2019-10-03 04:19:24,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73914 states. [2019-10-03 04:19:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73914 states to 73914 states and 86403 transitions. [2019-10-03 04:19:25,077 INFO L78 Accepts]: Start accepts. Automaton has 73914 states and 86403 transitions. Word has length 355 [2019-10-03 04:19:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:19:25,078 INFO L475 AbstractCegarLoop]: Abstraction has 73914 states and 86403 transitions. [2019-10-03 04:19:25,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-03 04:19:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 73914 states and 86403 transitions. [2019-10-03 04:19:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-03 04:19:25,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:19:25,136 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:19:25,136 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:19:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:19:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1162560798, now seen corresponding path program 1 times [2019-10-03 04:19:25,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:19:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:19:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:19:25,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:19:25,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:19:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:19:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-03 04:19:25,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:19:25,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:19:25,518 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 358 with the following transitions: [2019-10-03 04:19:25,518 INFO L207 CegarAbsIntRunner]: [60], [76], [78], [86], [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [196], [201], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [783], [790], [796], [799], [803], [806], [812], [825], [838], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [984], [985], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:19:25,521 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:19:25,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:19:25,586 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:19:25,587 INFO L272 AbstractInterpreter]: Visited 174 different actions 257 times. Merged at 6 different actions 6 times. Never widened. Performed 1478 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1478 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 88 variables. [2019-10-03 04:19:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:19:25,589 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:19:25,746 INFO L227 lantSequenceWeakener]: Weakened 255 states. On average, predicates are now at 72.32% of their original sizes. [2019-10-03 04:19:25,747 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:19:31,582 INFO L420 sIntCurrentIteration]: We unified 356 AI predicates to 356 [2019-10-03 04:19:31,582 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:19:31,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:19:31,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [111] imperfect sequences [4] total 113 [2019-10-03 04:19:31,582 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:19:31,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-10-03 04:19:31,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-10-03 04:19:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1006, Invalid=11204, Unknown=0, NotChecked=0, Total=12210 [2019-10-03 04:19:31,585 INFO L87 Difference]: Start difference. First operand 73914 states and 86403 transitions. Second operand 111 states. [2019-10-03 04:21:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:21:05,938 INFO L93 Difference]: Finished difference Result 75257 states and 87917 transitions. [2019-10-03 04:21:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-10-03 04:21:05,938 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 357 [2019-10-03 04:21:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:21:06,100 INFO L225 Difference]: With dead ends: 75257 [2019-10-03 04:21:06,100 INFO L226 Difference]: Without dead ends: 75257 [2019-10-03 04:21:06,103 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17977 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=4369, Invalid=51563, Unknown=0, NotChecked=0, Total=55932 [2019-10-03 04:21:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75257 states. [2019-10-03 04:21:06,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75257 to 75067. [2019-10-03 04:21:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75067 states. [2019-10-03 04:21:06,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75067 states to 75067 states and 87685 transitions. [2019-10-03 04:21:06,971 INFO L78 Accepts]: Start accepts. Automaton has 75067 states and 87685 transitions. Word has length 357 [2019-10-03 04:21:06,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:21:06,972 INFO L475 AbstractCegarLoop]: Abstraction has 75067 states and 87685 transitions. [2019-10-03 04:21:06,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-10-03 04:21:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 75067 states and 87685 transitions. [2019-10-03 04:21:07,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-03 04:21:07,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:21:07,021 INFO L411 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:21:07,021 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:21:07,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:21:07,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1322154359, now seen corresponding path program 1 times [2019-10-03 04:21:07,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:21:07,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:21:07,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:21:07,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:21:07,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:21:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:21:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 43 proven. 16 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-03 04:21:07,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:21:07,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:21:07,521 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 358 with the following transitions: [2019-10-03 04:21:07,521 INFO L207 CegarAbsIntRunner]: [118], [134], [136], [144], [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [783], [790], [796], [799], [803], [809], [812], [816], [822], [825], [829], [832], [838], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [988], [989], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:21:07,523 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:21:07,523 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:21:07,595 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:21:07,596 INFO L272 AbstractInterpreter]: Visited 179 different actions 267 times. Merged at 10 different actions 10 times. Never widened. Performed 1584 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1584 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 88 variables. [2019-10-03 04:21:07,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:21:07,597 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:21:07,744 INFO L227 lantSequenceWeakener]: Weakened 261 states. On average, predicates are now at 73.16% of their original sizes. [2019-10-03 04:21:07,744 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:21:14,316 INFO L420 sIntCurrentIteration]: We unified 356 AI predicates to 356 [2019-10-03 04:21:14,316 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:21:14,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:21:14,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [116] imperfect sequences [4] total 118 [2019-10-03 04:21:14,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:21:14,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-10-03 04:21:14,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-10-03 04:21:14,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1075, Invalid=12265, Unknown=0, NotChecked=0, Total=13340 [2019-10-03 04:21:14,319 INFO L87 Difference]: Start difference. First operand 75067 states and 87685 transitions. Second operand 116 states. [2019-10-03 04:22:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 04:22:55,702 INFO L93 Difference]: Finished difference Result 75827 states and 88600 transitions. [2019-10-03 04:22:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-10-03 04:22:55,702 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 357 [2019-10-03 04:22:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 04:22:55,864 INFO L225 Difference]: With dead ends: 75827 [2019-10-03 04:22:55,864 INFO L226 Difference]: Without dead ends: 75827 [2019-10-03 04:22:55,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18939 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=4606, Invalid=54686, Unknown=0, NotChecked=0, Total=59292 [2019-10-03 04:22:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75827 states. [2019-10-03 04:22:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75827 to 75621. [2019-10-03 04:22:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75621 states. [2019-10-03 04:22:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75621 states to 75621 states and 88347 transitions. [2019-10-03 04:22:56,856 INFO L78 Accepts]: Start accepts. Automaton has 75621 states and 88347 transitions. Word has length 357 [2019-10-03 04:22:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 04:22:56,857 INFO L475 AbstractCegarLoop]: Abstraction has 75621 states and 88347 transitions. [2019-10-03 04:22:56,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-10-03 04:22:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 75621 states and 88347 transitions. [2019-10-03 04:22:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-03 04:22:56,906 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 04:22:56,906 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 04:22:56,906 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 04:22:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:22:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1206207551, now seen corresponding path program 1 times [2019-10-03 04:22:56,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 04:22:56,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:22:56,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 04:22:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 04:22:56,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 04:22:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 04:22:57,052 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2019-10-03 04:22:57,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 04:22:57,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 04:22:57,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 359 with the following transitions: [2019-10-03 04:22:57,054 INFO L207 CegarAbsIntRunner]: [31], [47], [49], [57], [147], [149], [152], [163], [165], [167], [169], [173], [174], [179], [193], [203], [205], [207], [208], [213], [219], [225], [231], [237], [243], [249], [255], [261], [267], [273], [279], [285], [291], [293], [294], [297], [300], [304], [306], [308], [309], [395], [405], [407], [409], [410], [412], [413], [415], [418], [420], [423], [428], [431], [436], [439], [444], [447], [452], [455], [460], [463], [466], [468], [470], [471], [474], [508], [509], [510], [520], [522], [524], [525], [530], [536], [542], [548], [554], [560], [566], [572], [578], [584], [590], [596], [602], [608], [610], [613], [619], [625], [631], [637], [643], [649], [653], [654], [657], [660], [664], [666], [668], [669], [670], [673], [675], [678], [689], [691], [693], [697], [735], [738], [739], [740], [743], [748], [750], [752], [754], [755], [756], [765], [768], [771], [777], [780], [783], [790], [796], [799], [803], [809], [812], [816], [819], [825], [838], [851], [855], [858], [870], [880], [882], [884], [885], [886], [887], [901], [903], [936], [937], [948], [949], [950], [951], [952], [956], [957], [958], [959], [960], [961], [962], [963], [964], [965], [966], [967], [968], [969], [970], [971], [972], [973], [974], [978], [979], [980], [981], [986], [987], [992], [993], [994], [995], [996], [997], [998], [999], [1000], [1001], [1002], [1003], [1004], [1024], [1025], [1026] [2019-10-03 04:22:57,056 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 04:22:57,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 04:22:57,131 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 04:22:57,131 INFO L272 AbstractInterpreter]: Visited 177 different actions 263 times. Merged at 8 different actions 8 times. Never widened. Performed 1571 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1571 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 88 variables. [2019-10-03 04:22:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 04:22:57,131 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 04:22:57,353 INFO L227 lantSequenceWeakener]: Weakened 258 states. On average, predicates are now at 72.42% of their original sizes. [2019-10-03 04:22:57,353 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 04:23:03,631 INFO L420 sIntCurrentIteration]: We unified 357 AI predicates to 357 [2019-10-03 04:23:03,632 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 04:23:03,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 04:23:03,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [113] imperfect sequences [4] total 115 [2019-10-03 04:23:03,632 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 04:23:03,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-10-03 04:23:03,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-10-03 04:23:03,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=11640, Unknown=0, NotChecked=0, Total=12656 [2019-10-03 04:23:03,635 INFO L87 Difference]: Start difference. First operand 75621 states and 88347 transitions. Second operand 113 states.