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.05.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:23:24,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:23:24,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:23:24,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:23:24,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:23:24,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:23:24,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:23:24,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:23:24,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:23:24,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:23:24,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:23:24,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:23:24,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:23:24,377 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:23:24,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:23:24,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:23:24,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:23:24,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:23:24,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:23:24,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:23:24,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:23:24,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:23:24,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:23:24,390 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:23:24,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:23:24,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:23:24,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:23:24,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:23:24,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:23:24,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:23:24,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:23:24,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:23:24,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:23:24,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:23:24,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:23:24,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:23:24,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:23:24,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:23:24,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:23:24,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:23:24,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:23:24,406 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-09-10 03:23:24,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:23:24,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:23:24,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:23:24,423 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:23:24,424 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:23:24,424 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:23:24,424 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:23:24,424 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:23:24,425 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:23:24,425 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:23:24,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:23:24,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:23:24,426 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:23:24,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:23:24,427 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:23:24,427 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:23:24,427 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:23:24,428 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:23:24,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:23:24,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:23:24,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:23:24,429 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:23:24,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:23:24,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:23:24,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:23:24,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:23:24,430 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:23:24,430 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:23:24,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:23:24,431 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:23:24,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:23:24,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:23:24,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:23:24,481 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:23:24,482 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:23:24,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.05.cil-1.c [2019-09-10 03:23:24,557 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15032/6017df0f68cb49108708121e0c7ee4cb/FLAGdb090f2a5 [2019-09-10 03:23:25,056 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:23:25,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.05.cil-1.c [2019-09-10 03:23:25,069 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15032/6017df0f68cb49108708121e0c7ee4cb/FLAGdb090f2a5 [2019-09-10 03:23:25,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81c15032/6017df0f68cb49108708121e0c7ee4cb [2019-09-10 03:23:25,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:23:25,389 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:23:25,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:23:25,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:23:25,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:23:25,396 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebc784a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25, skipping insertion in model container [2019-09-10 03:23:25,399 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,406 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:23:25,476 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:23:25,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:23:25,765 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:23:25,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:23:25,942 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:23:25,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25 WrapperNode [2019-09-10 03:23:25,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:23:25,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:23:25,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:23:25,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:23:25,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:25,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:26,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:26,007 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... [2019-09-10 03:23:26,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:23:26,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:23:26,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:23:26,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:23:26,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:23:26,074 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:23:26,075 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:23:26,079 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:23:26,079 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:23:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:23:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:23:26,080 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:23:26,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:23:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:23:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:23:26,082 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:23:26,083 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:23:26,083 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:23:26,083 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:23:26,084 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:23:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:23:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:23:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:23:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:23:26,085 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:23:26,086 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:23:26,087 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:23:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:23:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:23:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:23:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:23:26,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:23:26,859 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:23:26,860 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-09-10 03:23:26,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:23:26 BoogieIcfgContainer [2019-09-10 03:23:26,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:23:26,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:23:26,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:23:26,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:23:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:23:25" (1/3) ... [2019-09-10 03:23:26,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:23:26, skipping insertion in model container [2019-09-10 03:23:26,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:23:25" (2/3) ... [2019-09-10 03:23:26,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@207a724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:23:26, skipping insertion in model container [2019-09-10 03:23:26,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:23:26" (3/3) ... [2019-09-10 03:23:26,870 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2019-09-10 03:23:26,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:23:26,890 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:23:26,910 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:23:26,939 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:23:26,940 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:23:26,940 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:23:26,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:23:26,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:23:26,941 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:23:26,941 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:23:26,941 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:23:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-10 03:23:26,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:26,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:26,996 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:26,999 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1265062230, now seen corresponding path program 1 times [2019-09-10 03:23:27,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:27,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:27,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:27,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:27,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:27,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:23:27,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:27,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:23:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:23:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:23:27,498 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 4 states. [2019-09-10 03:23:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:27,781 INFO L93 Difference]: Finished difference Result 262 states and 367 transitions. [2019-09-10 03:23:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:23:27,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 03:23:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:27,801 INFO L225 Difference]: With dead ends: 262 [2019-09-10 03:23:27,802 INFO L226 Difference]: Without dead ends: 255 [2019-09-10 03:23:27,804 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:23:27,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-10 03:23:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-09-10 03:23:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 360 transitions. [2019-09-10 03:23:27,897 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 360 transitions. Word has length 133 [2019-09-10 03:23:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:27,901 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 360 transitions. [2019-09-10 03:23:27,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:23:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 360 transitions. [2019-09-10 03:23:27,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:27,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:27,911 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:27,911 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:27,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:27,912 INFO L82 PathProgramCache]: Analyzing trace with hash -462082732, now seen corresponding path program 1 times [2019-09-10 03:23:27,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:27,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:27,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:28,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:28,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:28,173 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:28,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:28,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:28,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:28,182 INFO L87 Difference]: Start difference. First operand 255 states and 360 transitions. Second operand 5 states. [2019-09-10 03:23:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:28,885 INFO L93 Difference]: Finished difference Result 297 states and 434 transitions. [2019-09-10 03:23:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:28,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:28,896 INFO L225 Difference]: With dead ends: 297 [2019-09-10 03:23:28,897 INFO L226 Difference]: Without dead ends: 297 [2019-09-10 03:23:28,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-10 03:23:28,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 255. [2019-09-10 03:23:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 359 transitions. [2019-09-10 03:23:28,921 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 359 transitions. Word has length 133 [2019-09-10 03:23:28,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:28,921 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 359 transitions. [2019-09-10 03:23:28,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 359 transitions. [2019-09-10 03:23:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:28,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:28,924 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:28,924 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1859719186, now seen corresponding path program 1 times [2019-09-10 03:23:28,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:28,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:28,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:28,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:28,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:29,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:29,045 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:29,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:29,046 INFO L87 Difference]: Start difference. First operand 255 states and 359 transitions. Second operand 5 states. [2019-09-10 03:23:29,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:29,643 INFO L93 Difference]: Finished difference Result 297 states and 434 transitions. [2019-09-10 03:23:29,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:29,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:29,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:29,647 INFO L225 Difference]: With dead ends: 297 [2019-09-10 03:23:29,647 INFO L226 Difference]: Without dead ends: 297 [2019-09-10 03:23:29,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-09-10 03:23:29,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 255. [2019-09-10 03:23:29,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 358 transitions. [2019-09-10 03:23:29,667 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 358 transitions. Word has length 133 [2019-09-10 03:23:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:29,667 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 358 transitions. [2019-09-10 03:23:29,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 358 transitions. [2019-09-10 03:23:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:29,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:29,670 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:29,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash -282141292, now seen corresponding path program 1 times [2019-09-10 03:23:29,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:29,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:29,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:29,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:29,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:29,769 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:29,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:29,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:29,772 INFO L87 Difference]: Start difference. First operand 255 states and 358 transitions. Second operand 5 states. [2019-09-10 03:23:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:30,325 INFO L93 Difference]: Finished difference Result 295 states and 429 transitions. [2019-09-10 03:23:30,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:30,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:30,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:30,328 INFO L225 Difference]: With dead ends: 295 [2019-09-10 03:23:30,328 INFO L226 Difference]: Without dead ends: 295 [2019-09-10 03:23:30,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-10 03:23:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 255. [2019-09-10 03:23:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:30,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 357 transitions. [2019-09-10 03:23:30,344 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 357 transitions. Word has length 133 [2019-09-10 03:23:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:30,344 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 357 transitions. [2019-09-10 03:23:30,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 357 transitions. [2019-09-10 03:23:30,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:30,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:30,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:30,347 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:30,348 INFO L82 PathProgramCache]: Analyzing trace with hash -905422894, now seen corresponding path program 1 times [2019-09-10 03:23:30,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:30,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:30,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:30,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:30,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:30,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:30,438 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:30,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:30,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:30,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:30,440 INFO L87 Difference]: Start difference. First operand 255 states and 357 transitions. Second operand 5 states. [2019-09-10 03:23:31,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:31,016 INFO L93 Difference]: Finished difference Result 293 states and 424 transitions. [2019-09-10 03:23:31,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:31,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:31,019 INFO L225 Difference]: With dead ends: 293 [2019-09-10 03:23:31,019 INFO L226 Difference]: Without dead ends: 293 [2019-09-10 03:23:31,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-10 03:23:31,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 255. [2019-09-10 03:23:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 356 transitions. [2019-09-10 03:23:31,033 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 356 transitions. Word has length 133 [2019-09-10 03:23:31,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:31,033 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 356 transitions. [2019-09-10 03:23:31,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 356 transitions. [2019-09-10 03:23:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:31,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:31,036 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:31,036 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:31,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash -786981420, now seen corresponding path program 1 times [2019-09-10 03:23:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:31,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:31,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:31,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:31,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:31,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:31,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:31,110 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:31,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:31,112 INFO L87 Difference]: Start difference. First operand 255 states and 356 transitions. Second operand 5 states. [2019-09-10 03:23:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:31,739 INFO L93 Difference]: Finished difference Result 289 states and 415 transitions. [2019-09-10 03:23:31,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:31,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:31,744 INFO L225 Difference]: With dead ends: 289 [2019-09-10 03:23:31,744 INFO L226 Difference]: Without dead ends: 289 [2019-09-10 03:23:31,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-10 03:23:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 255. [2019-09-10 03:23:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 355 transitions. [2019-09-10 03:23:31,762 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 355 transitions. Word has length 133 [2019-09-10 03:23:31,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:31,763 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 355 transitions. [2019-09-10 03:23:31,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:31,764 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 355 transitions. [2019-09-10 03:23:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:31,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:31,766 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:31,766 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:31,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1474591830, now seen corresponding path program 1 times [2019-09-10 03:23:31,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:31,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:31,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:31,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:31,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:31,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:31,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:31,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:31,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:31,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:31,850 INFO L87 Difference]: Start difference. First operand 255 states and 355 transitions. Second operand 5 states. [2019-09-10 03:23:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:32,410 INFO L93 Difference]: Finished difference Result 315 states and 460 transitions. [2019-09-10 03:23:32,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:32,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:32,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:32,413 INFO L225 Difference]: With dead ends: 315 [2019-09-10 03:23:32,413 INFO L226 Difference]: Without dead ends: 315 [2019-09-10 03:23:32,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-10 03:23:32,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 255. [2019-09-10 03:23:32,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 354 transitions. [2019-09-10 03:23:32,425 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 354 transitions. Word has length 133 [2019-09-10 03:23:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:32,425 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 354 transitions. [2019-09-10 03:23:32,425 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 354 transitions. [2019-09-10 03:23:32,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:32,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:32,427 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:32,428 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:32,428 INFO L82 PathProgramCache]: Analyzing trace with hash -392116844, now seen corresponding path program 1 times [2019-09-10 03:23:32,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:32,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:32,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:32,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:32,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:32,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:32,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:32,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:32,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:32,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:32,532 INFO L87 Difference]: Start difference. First operand 255 states and 354 transitions. Second operand 5 states. [2019-09-10 03:23:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:33,151 INFO L93 Difference]: Finished difference Result 309 states and 450 transitions. [2019-09-10 03:23:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:33,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:33,154 INFO L225 Difference]: With dead ends: 309 [2019-09-10 03:23:33,154 INFO L226 Difference]: Without dead ends: 309 [2019-09-10 03:23:33,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-10 03:23:33,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-09-10 03:23:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 353 transitions. [2019-09-10 03:23:33,167 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 353 transitions. Word has length 133 [2019-09-10 03:23:33,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:33,168 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 353 transitions. [2019-09-10 03:23:33,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:33,168 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 353 transitions. [2019-09-10 03:23:33,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:33,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:33,170 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:33,171 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:33,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1699259242, now seen corresponding path program 1 times [2019-09-10 03:23:33,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:33,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:33,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:33,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:33,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:33,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:33,236 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:33,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:33,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:33,237 INFO L87 Difference]: Start difference. First operand 255 states and 353 transitions. Second operand 5 states. [2019-09-10 03:23:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:33,749 INFO L93 Difference]: Finished difference Result 311 states and 450 transitions. [2019-09-10 03:23:33,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:33,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:33,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:33,753 INFO L225 Difference]: With dead ends: 311 [2019-09-10 03:23:33,753 INFO L226 Difference]: Without dead ends: 311 [2019-09-10 03:23:33,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:33,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-09-10 03:23:33,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 255. [2019-09-10 03:23:33,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 352 transitions. [2019-09-10 03:23:33,765 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 352 transitions. Word has length 133 [2019-09-10 03:23:33,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:33,765 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 352 transitions. [2019-09-10 03:23:33,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 352 transitions. [2019-09-10 03:23:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:33,767 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:33,768 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:33,768 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:33,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:33,768 INFO L82 PathProgramCache]: Analyzing trace with hash 198237524, now seen corresponding path program 1 times [2019-09-10 03:23:33,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:33,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:33,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:33,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:33,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:33,856 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:33,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:33,857 INFO L87 Difference]: Start difference. First operand 255 states and 352 transitions. Second operand 5 states. [2019-09-10 03:23:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:34,422 INFO L93 Difference]: Finished difference Result 309 states and 445 transitions. [2019-09-10 03:23:34,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:34,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:34,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:34,426 INFO L225 Difference]: With dead ends: 309 [2019-09-10 03:23:34,426 INFO L226 Difference]: Without dead ends: 309 [2019-09-10 03:23:34,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-09-10 03:23:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 255. [2019-09-10 03:23:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 351 transitions. [2019-09-10 03:23:34,442 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 351 transitions. Word has length 133 [2019-09-10 03:23:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:34,442 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 351 transitions. [2019-09-10 03:23:34,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 351 transitions. [2019-09-10 03:23:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:34,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:34,444 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:34,444 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1229278422, now seen corresponding path program 1 times [2019-09-10 03:23:34,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:34,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:34,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:34,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:34,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:34,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:34,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:34,527 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:34,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:34,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:34,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:34,529 INFO L87 Difference]: Start difference. First operand 255 states and 351 transitions. Second operand 5 states. [2019-09-10 03:23:35,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:35,036 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2019-09-10 03:23:35,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:35,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:35,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:35,040 INFO L225 Difference]: With dead ends: 307 [2019-09-10 03:23:35,040 INFO L226 Difference]: Without dead ends: 307 [2019-09-10 03:23:35,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-10 03:23:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 255. [2019-09-10 03:23:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 350 transitions. [2019-09-10 03:23:35,062 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 350 transitions. Word has length 133 [2019-09-10 03:23:35,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:35,063 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 350 transitions. [2019-09-10 03:23:35,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:35,063 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 350 transitions. [2019-09-10 03:23:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:35,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:35,066 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:35,066 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:35,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash -677124844, now seen corresponding path program 1 times [2019-09-10 03:23:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:35,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:35,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:35,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:35,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:35,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:23:35,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:35,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:23:35,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:23:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:23:35,164 INFO L87 Difference]: Start difference. First operand 255 states and 350 transitions. Second operand 5 states. [2019-09-10 03:23:35,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:35,710 INFO L93 Difference]: Finished difference Result 305 states and 435 transitions. [2019-09-10 03:23:35,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:23:35,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-10 03:23:35,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:35,714 INFO L225 Difference]: With dead ends: 305 [2019-09-10 03:23:35,714 INFO L226 Difference]: Without dead ends: 305 [2019-09-10 03:23:35,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:23:35,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-10 03:23:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 255. [2019-09-10 03:23:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-09-10 03:23:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 349 transitions. [2019-09-10 03:23:35,726 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 349 transitions. Word has length 133 [2019-09-10 03:23:35,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:35,726 INFO L475 AbstractCegarLoop]: Abstraction has 255 states and 349 transitions. [2019-09-10 03:23:35,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:23:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 349 transitions. [2019-09-10 03:23:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-10 03:23:35,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:35,732 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:35,732 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 923946262, now seen corresponding path program 1 times [2019-09-10 03:23:35,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:35,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:35,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:35,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:23:35,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:23:35,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:23:35,799 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:35,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:23:35,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:23:35,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:23:35,800 INFO L87 Difference]: Start difference. First operand 255 states and 349 transitions. Second operand 4 states. [2019-09-10 03:23:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:36,038 INFO L93 Difference]: Finished difference Result 478 states and 653 transitions. [2019-09-10 03:23:36,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:23:36,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-10 03:23:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:36,041 INFO L225 Difference]: With dead ends: 478 [2019-09-10 03:23:36,041 INFO L226 Difference]: Without dead ends: 478 [2019-09-10 03:23:36,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:23:36,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-10 03:23:36,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 477. [2019-09-10 03:23:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-09-10 03:23:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 652 transitions. [2019-09-10 03:23:36,058 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 652 transitions. Word has length 133 [2019-09-10 03:23:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:36,058 INFO L475 AbstractCegarLoop]: Abstraction has 477 states and 652 transitions. [2019-09-10 03:23:36,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:23:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 652 transitions. [2019-09-10 03:23:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:23:36,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:36,062 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:36,062 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash -77668731, now seen corresponding path program 1 times [2019-09-10 03:23:36,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:36,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:36,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:36,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:36,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-10 03:23:36,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:36,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:36,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 03:23:36,142 INFO L207 CegarAbsIntRunner]: [145], [150], [164], [167], [170], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [370], [373], [378], [381], [386], [389], [394], [397], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [468], [474], [480], [486], [492], [498], [504], [512], [516], [522], [528], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [623], [624], [625], [634], [637], [640], [646], [649], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:23:36,217 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:36,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:36,351 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:36,352 INFO L272 AbstractInterpreter]: Visited 50 different actions 50 times. Never merged. Never widened. Performed 357 root evaluator evaluations with a maximum evaluation depth of 3. Performed 357 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:23:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:36,357 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:36,542 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 67.82% of their original sizes. [2019-09-10 03:23:36,542 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:36,721 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 03:23:36,721 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:36,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:36,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [6] total 17 [2019-09-10 03:23:36,723 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:36,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:23:36,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:23:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:23:36,724 INFO L87 Difference]: Start difference. First operand 477 states and 652 transitions. Second operand 13 states. [2019-09-10 03:23:38,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:38,855 INFO L93 Difference]: Finished difference Result 641 states and 848 transitions. [2019-09-10 03:23:38,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:23:38,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 217 [2019-09-10 03:23:38,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:38,860 INFO L225 Difference]: With dead ends: 641 [2019-09-10 03:23:38,860 INFO L226 Difference]: Without dead ends: 641 [2019-09-10 03:23:38,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:23:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-10 03:23:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 627. [2019-09-10 03:23:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-10 03:23:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 833 transitions. [2019-09-10 03:23:38,889 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 833 transitions. Word has length 217 [2019-09-10 03:23:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:38,890 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 833 transitions. [2019-09-10 03:23:38,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:23:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 833 transitions. [2019-09-10 03:23:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 03:23:38,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:38,899 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:38,901 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:38,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:38,901 INFO L82 PathProgramCache]: Analyzing trace with hash 121694116, now seen corresponding path program 1 times [2019-09-10 03:23:38,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:38,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:38,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:38,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:39,014 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-09-10 03:23:39,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:39,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:39,015 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 240 with the following transitions: [2019-09-10 03:23:39,017 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [378], [381], [386], [389], [394], [397], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [655], [659], [662], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [832], [833], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:23:39,029 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:39,029 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:39,059 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:39,060 INFO L272 AbstractInterpreter]: Visited 60 different actions 60 times. Never merged. Never widened. Performed 396 root evaluator evaluations with a maximum evaluation depth of 4. Performed 396 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:23:39,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:39,060 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:39,167 INFO L227 lantSequenceWeakener]: Weakened 57 states. On average, predicates are now at 67.26% of their original sizes. [2019-09-10 03:23:39,168 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:39,407 INFO L420 sIntCurrentIteration]: We unified 238 AI predicates to 238 [2019-09-10 03:23:39,407 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:39,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:39,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2019-09-10 03:23:39,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:39,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:23:39,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:23:39,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:23:39,409 INFO L87 Difference]: Start difference. First operand 627 states and 833 transitions. Second operand 18 states. [2019-09-10 03:23:46,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:46,926 INFO L93 Difference]: Finished difference Result 636 states and 835 transitions. [2019-09-10 03:23:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:23:46,926 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 239 [2019-09-10 03:23:46,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:46,929 INFO L225 Difference]: With dead ends: 636 [2019-09-10 03:23:46,929 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 03:23:46,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:23:46,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 03:23:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 622. [2019-09-10 03:23:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-10 03:23:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 820 transitions. [2019-09-10 03:23:46,946 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 820 transitions. Word has length 239 [2019-09-10 03:23:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:46,947 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 820 transitions. [2019-09-10 03:23:46,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:23:46,947 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 820 transitions. [2019-09-10 03:23:46,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:23:46,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:46,951 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:46,951 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:46,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 50792801, now seen corresponding path program 1 times [2019-09-10 03:23:46,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:46,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:46,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:46,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:46,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 03:23:47,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:47,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:47,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 03:23:47,027 INFO L207 CegarAbsIntRunner]: [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [386], [389], [394], [397], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:23:47,032 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:47,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:47,079 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:47,079 INFO L272 AbstractInterpreter]: Visited 71 different actions 71 times. Never merged. Never widened. Performed 436 root evaluator evaluations with a maximum evaluation depth of 4. Performed 436 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:23:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:47,080 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:47,139 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 67.65% of their original sizes. [2019-09-10 03:23:47,139 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:47,457 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 03:23:47,457 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:47,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:47,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2019-09-10 03:23:47,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:47,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 03:23:47,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 03:23:47,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:23:47,459 INFO L87 Difference]: Start difference. First operand 622 states and 820 transitions. Second operand 22 states. [2019-09-10 03:23:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:23:55,557 INFO L93 Difference]: Finished difference Result 636 states and 834 transitions. [2019-09-10 03:23:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:23:55,558 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 217 [2019-09-10 03:23:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:23:55,562 INFO L225 Difference]: With dead ends: 636 [2019-09-10 03:23:55,563 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 03:23:55,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:23:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 03:23:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 622. [2019-09-10 03:23:55,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-10 03:23:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 819 transitions. [2019-09-10 03:23:55,582 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 819 transitions. Word has length 217 [2019-09-10 03:23:55,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:23:55,583 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 819 transitions. [2019-09-10 03:23:55,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 03:23:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 819 transitions. [2019-09-10 03:23:55,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:23:55,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:23:55,586 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:23:55,586 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:23:55,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:55,587 INFO L82 PathProgramCache]: Analyzing trace with hash -872374625, now seen corresponding path program 1 times [2019-09-10 03:23:55,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:23:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:55,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:23:55,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:23:55,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:23:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:23:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-10 03:23:55,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:23:55,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:23:55,669 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 03:23:55,670 INFO L207 CegarAbsIntRunner]: [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [394], [397], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:23:55,673 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:23:55,673 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:23:55,704 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:23:55,705 INFO L272 AbstractInterpreter]: Visited 82 different actions 82 times. Never merged. Never widened. Performed 476 root evaluator evaluations with a maximum evaluation depth of 4. Performed 476 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:23:55,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:23:55,705 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:23:55,772 INFO L227 lantSequenceWeakener]: Weakened 75 states. On average, predicates are now at 67.96% of their original sizes. [2019-09-10 03:23:55,773 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:23:56,266 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 03:23:56,267 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:23:56,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:23:56,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2019-09-10 03:23:56,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:23:56,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:23:56,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:23:56,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:23:56,269 INFO L87 Difference]: Start difference. First operand 622 states and 819 transitions. Second operand 26 states. [2019-09-10 03:24:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:05,183 INFO L93 Difference]: Finished difference Result 636 states and 833 transitions. [2019-09-10 03:24:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-10 03:24:05,184 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 217 [2019-09-10 03:24:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:05,188 INFO L225 Difference]: With dead ends: 636 [2019-09-10 03:24:05,188 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 03:24:05,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=337, Invalid=1469, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:24:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 03:24:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 622. [2019-09-10 03:24:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-10 03:24:05,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 818 transitions. [2019-09-10 03:24:05,204 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 818 transitions. Word has length 217 [2019-09-10 03:24:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:05,205 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 818 transitions. [2019-09-10 03:24:05,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:24:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 818 transitions. [2019-09-10 03:24:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:24:05,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:05,207 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:05,208 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:05,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:05,208 INFO L82 PathProgramCache]: Analyzing trace with hash -325904527, now seen corresponding path program 1 times [2019-09-10 03:24:05,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:05,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:05,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:05,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:24:05,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:05,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:05,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 241 with the following transitions: [2019-09-10 03:24:05,299 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [391], [394], [397], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [652], [659], [662], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [832], [833], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:24:05,301 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:05,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:05,326 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:05,326 INFO L272 AbstractInterpreter]: Visited 92 different actions 92 times. Never merged. Never widened. Performed 515 root evaluator evaluations with a maximum evaluation depth of 4. Performed 515 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:24:05,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:05,326 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:05,392 INFO L227 lantSequenceWeakener]: Weakened 84 states. On average, predicates are now at 64.54% of their original sizes. [2019-09-10 03:24:05,392 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:06,112 INFO L420 sIntCurrentIteration]: We unified 239 AI predicates to 239 [2019-09-10 03:24:06,112 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:06,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:06,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2019-09-10 03:24:06,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:06,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:24:06,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:24:06,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:24:06,115 INFO L87 Difference]: Start difference. First operand 622 states and 818 transitions. Second operand 30 states. [2019-09-10 03:24:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:16,831 INFO L93 Difference]: Finished difference Result 636 states and 829 transitions. [2019-09-10 03:24:16,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:24:16,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 240 [2019-09-10 03:24:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:16,835 INFO L225 Difference]: With dead ends: 636 [2019-09-10 03:24:16,835 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 03:24:16,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=491, Invalid=2371, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 03:24:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 03:24:16,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 622. [2019-09-10 03:24:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-10 03:24:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 814 transitions. [2019-09-10 03:24:16,851 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 814 transitions. Word has length 240 [2019-09-10 03:24:16,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:16,852 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 814 transitions. [2019-09-10 03:24:16,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:24:16,852 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 814 transitions. [2019-09-10 03:24:16,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:24:16,854 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:16,855 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:16,855 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:16,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:16,855 INFO L82 PathProgramCache]: Analyzing trace with hash -739535777, now seen corresponding path program 1 times [2019-09-10 03:24:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:16,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:16,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:16,856 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-10 03:24:16,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:16,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:16,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 03:24:16,947 INFO L207 CegarAbsIntRunner]: [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:24:16,949 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:16,949 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:16,993 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:16,993 INFO L272 AbstractInterpreter]: Visited 102 different actions 102 times. Never merged. Never widened. Performed 554 root evaluator evaluations with a maximum evaluation depth of 4. Performed 554 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:24:16,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:16,993 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:17,098 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 68.45% of their original sizes. [2019-09-10 03:24:17,098 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:17,925 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 03:24:17,926 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:17,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:17,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [6] total 38 [2019-09-10 03:24:17,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:17,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:24:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:24:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:24:17,929 INFO L87 Difference]: Start difference. First operand 622 states and 814 transitions. Second operand 34 states. [2019-09-10 03:24:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:28,888 INFO L93 Difference]: Finished difference Result 636 states and 828 transitions. [2019-09-10 03:24:28,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-10 03:24:28,888 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 217 [2019-09-10 03:24:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:28,892 INFO L225 Difference]: With dead ends: 636 [2019-09-10 03:24:28,892 INFO L226 Difference]: Without dead ends: 636 [2019-09-10 03:24:28,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=505, Invalid=2917, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 03:24:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-09-10 03:24:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 622. [2019-09-10 03:24:28,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-09-10 03:24:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 813 transitions. [2019-09-10 03:24:28,909 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 813 transitions. Word has length 217 [2019-09-10 03:24:28,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:28,909 INFO L475 AbstractCegarLoop]: Abstraction has 622 states and 813 transitions. [2019-09-10 03:24:28,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:24:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 813 transitions. [2019-09-10 03:24:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:24:28,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:28,912 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:28,912 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:28,913 INFO L82 PathProgramCache]: Analyzing trace with hash 122297825, now seen corresponding path program 1 times [2019-09-10 03:24:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:28,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:28,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 03:24:29,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:24:29,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:24:29,036 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:29,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:24:29,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:24:29,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:24:29,037 INFO L87 Difference]: Start difference. First operand 622 states and 813 transitions. Second operand 6 states. [2019-09-10 03:24:29,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:29,091 INFO L93 Difference]: Finished difference Result 644 states and 846 transitions. [2019-09-10 03:24:29,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:24:29,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 217 [2019-09-10 03:24:29,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:29,097 INFO L225 Difference]: With dead ends: 644 [2019-09-10 03:24:29,097 INFO L226 Difference]: Without dead ends: 644 [2019-09-10 03:24:29,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:24:29,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-09-10 03:24:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 627. [2019-09-10 03:24:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-10 03:24:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 817 transitions. [2019-09-10 03:24:29,122 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 817 transitions. Word has length 217 [2019-09-10 03:24:29,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:29,123 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 817 transitions. [2019-09-10 03:24:29,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:24:29,123 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 817 transitions. [2019-09-10 03:24:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-10 03:24:29,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:29,128 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:29,128 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:29,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:29,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1684450637, now seen corresponding path program 1 times [2019-09-10 03:24:29,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:29,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:29,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-10 03:24:29,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:24:29,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:24:29,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:29,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:24:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:24:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:24:29,279 INFO L87 Difference]: Start difference. First operand 627 states and 817 transitions. Second operand 4 states. [2019-09-10 03:24:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:29,589 INFO L93 Difference]: Finished difference Result 1072 states and 1420 transitions. [2019-09-10 03:24:29,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:24:29,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-09-10 03:24:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:29,596 INFO L225 Difference]: With dead ends: 1072 [2019-09-10 03:24:29,597 INFO L226 Difference]: Without dead ends: 1072 [2019-09-10 03:24:29,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:24:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-09-10 03:24:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1065. [2019-09-10 03:24:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-10 03:24:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1414 transitions. [2019-09-10 03:24:29,637 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1414 transitions. Word has length 240 [2019-09-10 03:24:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:29,637 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1414 transitions. [2019-09-10 03:24:29,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:24:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1414 transitions. [2019-09-10 03:24:29,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-09-10 03:24:29,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:29,642 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:29,642 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:29,642 INFO L82 PathProgramCache]: Analyzing trace with hash -585863406, now seen corresponding path program 1 times [2019-09-10 03:24:29,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-10 03:24:29,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:24:29,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:24:29,808 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:29,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:24:29,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:24:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:24:29,810 INFO L87 Difference]: Start difference. First operand 1065 states and 1414 transitions. Second operand 6 states. [2019-09-10 03:24:29,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:24:29,851 INFO L93 Difference]: Finished difference Result 1103 states and 1470 transitions. [2019-09-10 03:24:29,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:24:29,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-09-10 03:24:29,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:24:29,859 INFO L225 Difference]: With dead ends: 1103 [2019-09-10 03:24:29,859 INFO L226 Difference]: Without dead ends: 1103 [2019-09-10 03:24:29,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:24:29,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-10 03:24:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1075. [2019-09-10 03:24:29,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-09-10 03:24:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1422 transitions. [2019-09-10 03:24:29,906 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1422 transitions. Word has length 241 [2019-09-10 03:24:29,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:24:29,910 INFO L475 AbstractCegarLoop]: Abstraction has 1075 states and 1422 transitions. [2019-09-10 03:24:29,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:24:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1422 transitions. [2019-09-10 03:24:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-09-10 03:24:29,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:24:29,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:24:29,917 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:24:29,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1124434849, now seen corresponding path program 1 times [2019-09-10 03:24:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:24:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:24:29,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:24:29,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:24:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:24:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-10 03:24:30,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:24:30,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:24:30,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 218 with the following transitions: [2019-09-10 03:24:30,018 INFO L207 CegarAbsIntRunner]: [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [668], [681], [694], [707], [720], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:24:30,020 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:24:30,020 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:24:30,082 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:24:30,082 INFO L272 AbstractInterpreter]: Visited 147 different actions 209 times. Never merged. Never widened. Performed 1050 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1050 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:24:30,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:24:30,083 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:24:30,247 INFO L227 lantSequenceWeakener]: Weakened 205 states. On average, predicates are now at 77.35% of their original sizes. [2019-09-10 03:24:30,247 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:24:33,864 INFO L420 sIntCurrentIteration]: We unified 216 AI predicates to 216 [2019-09-10 03:24:33,864 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:24:33,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:24:33,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [91] imperfect sequences [4] total 93 [2019-09-10 03:24:33,865 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:24:33,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-09-10 03:24:33,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-09-10 03:24:33,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=7523, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 03:24:33,870 INFO L87 Difference]: Start difference. First operand 1075 states and 1422 transitions. Second operand 91 states. [2019-09-10 03:26:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:50,004 INFO L93 Difference]: Finished difference Result 3975 states and 5320 transitions. [2019-09-10 03:26:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2019-09-10 03:26:50,004 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 217 [2019-09-10 03:26:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:50,024 INFO L225 Difference]: With dead ends: 3975 [2019-09-10 03:26:50,024 INFO L226 Difference]: Without dead ends: 3975 [2019-09-10 03:26:50,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34025 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=6380, Invalid=85732, Unknown=0, NotChecked=0, Total=92112 [2019-09-10 03:26:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-09-10 03:26:50,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3858. [2019-09-10 03:26:50,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3858 states. [2019-09-10 03:26:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3858 states to 3858 states and 5194 transitions. [2019-09-10 03:26:50,137 INFO L78 Accepts]: Start accepts. Automaton has 3858 states and 5194 transitions. Word has length 217 [2019-09-10 03:26:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:50,138 INFO L475 AbstractCegarLoop]: Abstraction has 3858 states and 5194 transitions. [2019-09-10 03:26:50,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-09-10 03:26:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3858 states and 5194 transitions. [2019-09-10 03:26:50,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-10 03:26:50,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:50,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:26:50,144 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:50,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:50,144 INFO L82 PathProgramCache]: Analyzing trace with hash -123159461, now seen corresponding path program 1 times [2019-09-10 03:26:50,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:50,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:50,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:50,256 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-09-10 03:26:50,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:26:50,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:26:50,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:50,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:26:50,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:26:50,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:26:50,258 INFO L87 Difference]: Start difference. First operand 3858 states and 5194 transitions. Second operand 5 states. [2019-09-10 03:26:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:26:51,281 INFO L93 Difference]: Finished difference Result 6162 states and 8332 transitions. [2019-09-10 03:26:51,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:26:51,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 224 [2019-09-10 03:26:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:26:51,310 INFO L225 Difference]: With dead ends: 6162 [2019-09-10 03:26:51,311 INFO L226 Difference]: Without dead ends: 6162 [2019-09-10 03:26:51,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:26:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6162 states. [2019-09-10 03:26:51,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6162 to 6085. [2019-09-10 03:26:51,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6085 states. [2019-09-10 03:26:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6085 states to 6085 states and 8218 transitions. [2019-09-10 03:26:51,476 INFO L78 Accepts]: Start accepts. Automaton has 6085 states and 8218 transitions. Word has length 224 [2019-09-10 03:26:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:26:51,477 INFO L475 AbstractCegarLoop]: Abstraction has 6085 states and 8218 transitions. [2019-09-10 03:26:51,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:26:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 6085 states and 8218 transitions. [2019-09-10 03:26:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-09-10 03:26:51,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:26:51,488 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:26:51,489 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:26:51,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1994560325, now seen corresponding path program 1 times [2019-09-10 03:26:51,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:26:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:51,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:26:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:26:51,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:26:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:26:51,683 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:26:51,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:26:51,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:26:51,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 296 with the following transitions: [2019-09-10 03:26:51,684 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [447], [450], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [662], [681], [694], [707], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [832], [833], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:26:51,687 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:26:51,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:26:51,733 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:26:51,733 INFO L272 AbstractInterpreter]: Visited 159 different actions 225 times. Never merged. Never widened. Performed 1138 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1138 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:26:51,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:26:51,733 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:26:51,888 INFO L227 lantSequenceWeakener]: Weakened 215 states. On average, predicates are now at 71.41% of their original sizes. [2019-09-10 03:26:51,888 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:26:55,746 INFO L420 sIntCurrentIteration]: We unified 294 AI predicates to 294 [2019-09-10 03:26:55,747 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:26:55,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:26:55,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [88] imperfect sequences [6] total 92 [2019-09-10 03:26:55,747 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:26:55,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 03:26:55,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 03:26:55,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=610, Invalid=7046, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 03:26:55,749 INFO L87 Difference]: Start difference. First operand 6085 states and 8218 transitions. Second operand 88 states. [2019-09-10 03:28:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:28:08,212 INFO L93 Difference]: Finished difference Result 6601 states and 8853 transitions. [2019-09-10 03:28:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-09-10 03:28:08,213 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 295 [2019-09-10 03:28:08,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:28:08,239 INFO L225 Difference]: With dead ends: 6601 [2019-09-10 03:28:08,240 INFO L226 Difference]: Without dead ends: 6601 [2019-09-10 03:28:08,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15546 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3082, Invalid=44224, Unknown=0, NotChecked=0, Total=47306 [2019-09-10 03:28:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6601 states. [2019-09-10 03:28:08,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6601 to 6453. [2019-09-10 03:28:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6453 states. [2019-09-10 03:28:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6453 states to 6453 states and 8685 transitions. [2019-09-10 03:28:08,389 INFO L78 Accepts]: Start accepts. Automaton has 6453 states and 8685 transitions. Word has length 295 [2019-09-10 03:28:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:28:08,390 INFO L475 AbstractCegarLoop]: Abstraction has 6453 states and 8685 transitions. [2019-09-10 03:28:08,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-10 03:28:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 6453 states and 8685 transitions. [2019-09-10 03:28:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 03:28:08,402 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:28:08,402 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:28:08,402 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:28:08,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1298109967, now seen corresponding path program 1 times [2019-09-10 03:28:08,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:28:08,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:08,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:28:08,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:28:08,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:28:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:28:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:28:08,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:28:08,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:28:08,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2019-09-10 03:28:08,567 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [447], [450], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [662], [672], [678], [685], [691], [698], [704], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [832], [833], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:28:08,568 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:28:08,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:28:08,651 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:28:08,651 INFO L272 AbstractInterpreter]: Visited 168 different actions 234 times. Never merged. Never widened. Performed 1237 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1237 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 78 variables. [2019-09-10 03:28:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:28:08,651 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:28:08,796 INFO L227 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 71.81% of their original sizes. [2019-09-10 03:28:08,796 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:28:13,257 INFO L420 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2019-09-10 03:28:13,257 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:28:13,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:28:13,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [96] imperfect sequences [6] total 100 [2019-09-10 03:28:13,257 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:28:13,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-10 03:28:13,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-10 03:28:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=646, Invalid=8474, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 03:28:13,260 INFO L87 Difference]: Start difference. First operand 6453 states and 8685 transitions. Second operand 96 states. [2019-09-10 03:29:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:29:46,248 INFO L93 Difference]: Finished difference Result 6659 states and 8959 transitions. [2019-09-10 03:29:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2019-09-10 03:29:46,248 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 298 [2019-09-10 03:29:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:29:46,268 INFO L225 Difference]: With dead ends: 6659 [2019-09-10 03:29:46,269 INFO L226 Difference]: Without dead ends: 6659 [2019-09-10 03:29:46,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17579 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=3196, Invalid=50860, Unknown=0, NotChecked=0, Total=54056 [2019-09-10 03:29:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6659 states. [2019-09-10 03:29:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6659 to 6485. [2019-09-10 03:29:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6485 states. [2019-09-10 03:29:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6485 states to 6485 states and 8733 transitions. [2019-09-10 03:29:46,408 INFO L78 Accepts]: Start accepts. Automaton has 6485 states and 8733 transitions. Word has length 298 [2019-09-10 03:29:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:29:46,409 INFO L475 AbstractCegarLoop]: Abstraction has 6485 states and 8733 transitions. [2019-09-10 03:29:46,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-10 03:29:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6485 states and 8733 transitions. [2019-09-10 03:29:46,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-10 03:29:46,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:29:46,421 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:29:46,421 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:29:46,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:46,421 INFO L82 PathProgramCache]: Analyzing trace with hash -556779021, now seen corresponding path program 1 times [2019-09-10 03:29:46,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:29:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:29:46,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:29:46,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:29:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:29:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:29:46,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:29:46,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:29:46,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 297 with the following transitions: [2019-09-10 03:29:46,567 INFO L207 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [665], [672], [675], [694], [707], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [834], [835], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:29:46,569 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:29:46,569 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:29:46,632 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:29:46,633 INFO L272 AbstractInterpreter]: Visited 159 different actions 223 times. Never merged. Never widened. Performed 1142 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1142 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:29:46,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:29:46,633 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:29:46,782 INFO L227 lantSequenceWeakener]: Weakened 217 states. On average, predicates are now at 71.61% of their original sizes. [2019-09-10 03:29:46,782 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:29:51,012 INFO L420 sIntCurrentIteration]: We unified 295 AI predicates to 295 [2019-09-10 03:29:51,012 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:29:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:29:51,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [90] imperfect sequences [6] total 94 [2019-09-10 03:29:51,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:29:51,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-09-10 03:29:51,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-09-10 03:29:51,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=7390, Unknown=0, NotChecked=0, Total=8010 [2019-09-10 03:29:51,016 INFO L87 Difference]: Start difference. First operand 6485 states and 8733 transitions. Second operand 90 states. [2019-09-10 03:31:04,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:31:04,169 INFO L93 Difference]: Finished difference Result 6994 states and 9393 transitions. [2019-09-10 03:31:04,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-09-10 03:31:04,170 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 296 [2019-09-10 03:31:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:31:04,190 INFO L225 Difference]: With dead ends: 6994 [2019-09-10 03:31:04,191 INFO L226 Difference]: Without dead ends: 6994 [2019-09-10 03:31:04,193 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12150 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=2753, Invalid=36253, Unknown=0, NotChecked=0, Total=39006 [2019-09-10 03:31:04,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6994 states. [2019-09-10 03:31:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6994 to 6874. [2019-09-10 03:31:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-09-10 03:31:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 9249 transitions. [2019-09-10 03:31:04,326 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 9249 transitions. Word has length 296 [2019-09-10 03:31:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:31:04,326 INFO L475 AbstractCegarLoop]: Abstraction has 6874 states and 9249 transitions. [2019-09-10 03:31:04,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-09-10 03:31:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 9249 transitions. [2019-09-10 03:31:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-10 03:31:04,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:31:04,338 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:31:04,338 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:31:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:31:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1264910781, now seen corresponding path program 1 times [2019-09-10 03:31:04,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:31:04,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:31:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:31:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:31:04,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:31:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:31:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:31:04,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:31:04,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:31:04,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 298 with the following transitions: [2019-09-10 03:31:04,473 INFO L207 CegarAbsIntRunner]: [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [665], [672], [678], [685], [688], [707], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [836], [837], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:31:04,475 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:31:04,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:31:04,524 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:31:04,524 INFO L272 AbstractInterpreter]: Visited 161 different actions 225 times. Never merged. Never widened. Performed 1150 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1150 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:31:04,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:31:04,524 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:31:04,622 INFO L227 lantSequenceWeakener]: Weakened 219 states. On average, predicates are now at 71.75% of their original sizes. [2019-09-10 03:31:04,623 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:31:08,736 INFO L420 sIntCurrentIteration]: We unified 296 AI predicates to 296 [2019-09-10 03:31:08,737 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:31:08,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:31:08,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [92] imperfect sequences [6] total 96 [2019-09-10 03:31:08,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:31:08,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-10 03:31:08,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-10 03:31:08,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=7740, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 03:31:08,740 INFO L87 Difference]: Start difference. First operand 6874 states and 9249 transitions. Second operand 92 states. [2019-09-10 03:32:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:35,778 INFO L93 Difference]: Finished difference Result 7402 states and 9941 transitions. [2019-09-10 03:32:35,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2019-09-10 03:32:35,778 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 297 [2019-09-10 03:32:35,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:35,802 INFO L225 Difference]: With dead ends: 7402 [2019-09-10 03:32:35,802 INFO L226 Difference]: Without dead ends: 7402 [2019-09-10 03:32:35,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12626 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=2825, Invalid=37777, Unknown=0, NotChecked=0, Total=40602 [2019-09-10 03:32:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7402 states. [2019-09-10 03:32:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7402 to 7264. [2019-09-10 03:32:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7264 states. [2019-09-10 03:32:35,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7264 states to 7264 states and 9770 transitions. [2019-09-10 03:32:35,965 INFO L78 Accepts]: Start accepts. Automaton has 7264 states and 9770 transitions. Word has length 297 [2019-09-10 03:32:35,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:35,966 INFO L475 AbstractCegarLoop]: Abstraction has 7264 states and 9770 transitions. [2019-09-10 03:32:35,966 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-10 03:32:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 7264 states and 9770 transitions. [2019-09-10 03:32:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-09-10 03:32:35,981 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:35,981 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-10 03:32:35,982 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:35,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:35,982 INFO L82 PathProgramCache]: Analyzing trace with hash -229040535, now seen corresponding path program 1 times [2019-09-10 03:32:35,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:35,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:35,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-09-10 03:32:36,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:36,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:32:36,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 320 with the following transitions: [2019-09-10 03:32:36,205 INFO L207 CegarAbsIntRunner]: [89], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [415], [418], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [655], [659], [665], [672], [678], [685], [691], [698], [704], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:32:36,208 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:32:36,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:32:36,423 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:32:36,424 INFO L272 AbstractInterpreter]: Visited 176 different actions 505 times. Merged at 40 different actions 55 times. Never widened. Performed 3010 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3010 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 78 variables. [2019-09-10 03:32:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:36,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:32:36,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:36,427 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-09-10 03:32:36,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:36,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:32:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:36,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-10 03:32:36,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:32:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 03:32:36,847 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:32:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 55 proven. 18 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 03:32:37,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:32:37,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 4] total 5 [2019-09-10 03:32:37,208 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:37,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:32:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:32:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:37,210 INFO L87 Difference]: Start difference. First operand 7264 states and 9770 transitions. Second operand 3 states. [2019-09-10 03:32:37,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:37,305 INFO L93 Difference]: Finished difference Result 8945 states and 12363 transitions. [2019-09-10 03:32:37,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:32:37,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-09-10 03:32:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:37,335 INFO L225 Difference]: With dead ends: 8945 [2019-09-10 03:32:37,335 INFO L226 Difference]: Without dead ends: 8945 [2019-09-10 03:32:37,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8945 states. [2019-09-10 03:32:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8945 to 8918. [2019-09-10 03:32:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8918 states. [2019-09-10 03:32:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8918 states to 8918 states and 12337 transitions. [2019-09-10 03:32:37,628 INFO L78 Accepts]: Start accepts. Automaton has 8918 states and 12337 transitions. Word has length 319 [2019-09-10 03:32:37,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:37,629 INFO L475 AbstractCegarLoop]: Abstraction has 8918 states and 12337 transitions. [2019-09-10 03:32:37,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:32:37,629 INFO L276 IsEmpty]: Start isEmpty. Operand 8918 states and 12337 transitions. [2019-09-10 03:32:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 03:32:37,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:37,645 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:37,645 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -700532364, now seen corresponding path program 1 times [2019-09-10 03:32:37,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:37,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:37,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:37,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:37,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:37,815 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-10 03:32:37,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:32:37,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:32:37,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2019-09-10 03:32:37,816 INFO L207 CegarAbsIntRunner]: [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [665], [672], [675], [685], [691], [698], [704], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [834], [835], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:32:37,818 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:32:37,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:32:37,877 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:32:37,878 INFO L272 AbstractInterpreter]: Visited 166 different actions 230 times. Never merged. Never widened. Performed 1233 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1233 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 78 variables. [2019-09-10 03:32:37,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:37,878 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:32:38,052 INFO L227 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 71.99% of their original sizes. [2019-09-10 03:32:38,052 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:32:42,894 INFO L420 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2019-09-10 03:32:42,894 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:32:42,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:32:42,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [96] imperfect sequences [6] total 100 [2019-09-10 03:32:42,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:42,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-10 03:32:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-10 03:32:42,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=644, Invalid=8476, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 03:32:42,896 INFO L87 Difference]: Start difference. First operand 8918 states and 12337 transitions. Second operand 96 states. [2019-09-10 03:34:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:34:17,035 INFO L93 Difference]: Finished difference Result 9132 states and 12624 transitions. [2019-09-10 03:34:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-10 03:34:17,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 298 [2019-09-10 03:34:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:34:17,061 INFO L225 Difference]: With dead ends: 9132 [2019-09-10 03:34:17,062 INFO L226 Difference]: Without dead ends: 9132 [2019-09-10 03:34:17,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13510 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2824, Invalid=40648, Unknown=0, NotChecked=0, Total=43472 [2019-09-10 03:34:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9132 states. [2019-09-10 03:34:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9132 to 8945. [2019-09-10 03:34:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8945 states. [2019-09-10 03:34:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8945 states to 8945 states and 12377 transitions. [2019-09-10 03:34:17,261 INFO L78 Accepts]: Start accepts. Automaton has 8945 states and 12377 transitions. Word has length 298 [2019-09-10 03:34:17,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:34:17,261 INFO L475 AbstractCegarLoop]: Abstraction has 8945 states and 12377 transitions. [2019-09-10 03:34:17,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-10 03:34:17,261 INFO L276 IsEmpty]: Start isEmpty. Operand 8945 states and 12377 transitions. [2019-09-10 03:34:17,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-09-10 03:34:17,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:34:17,277 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:34:17,278 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:34:17,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash -658382829, now seen corresponding path program 1 times [2019-09-10 03:34:17,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:34:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:17,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:34:17,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:17,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:34:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:34:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-09-10 03:34:17,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:34:17,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:34:17,408 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 299 with the following transitions: [2019-09-10 03:34:17,408 INFO L207 CegarAbsIntRunner]: [31], [47], [49], [57], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [665], [672], [678], [685], [688], [698], [704], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [836], [837], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:34:17,411 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:34:17,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:34:17,472 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:34:17,472 INFO L272 AbstractInterpreter]: Visited 165 different actions 228 times. Never merged. Never widened. Performed 1231 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1231 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 78 variables. [2019-09-10 03:34:17,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:17,473 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:34:17,643 INFO L227 lantSequenceWeakener]: Weakened 224 states. On average, predicates are now at 72.76% of their original sizes. [2019-09-10 03:34:17,644 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:34:22,502 INFO L420 sIntCurrentIteration]: We unified 297 AI predicates to 297 [2019-09-10 03:34:22,502 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:34:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:34:22,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [97] imperfect sequences [6] total 101 [2019-09-10 03:34:22,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:34:22,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-09-10 03:34:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-09-10 03:34:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=684, Invalid=8628, Unknown=0, NotChecked=0, Total=9312 [2019-09-10 03:34:22,505 INFO L87 Difference]: Start difference. First operand 8945 states and 12377 transitions. Second operand 97 states. [2019-09-10 03:36:04,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:04,690 INFO L93 Difference]: Finished difference Result 9163 states and 12674 transitions. [2019-09-10 03:36:04,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-09-10 03:36:04,690 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 298 [2019-09-10 03:36:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:04,714 INFO L225 Difference]: With dead ends: 9163 [2019-09-10 03:36:04,715 INFO L226 Difference]: Without dead ends: 9163 [2019-09-10 03:36:04,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13587 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2932, Invalid=40958, Unknown=0, NotChecked=0, Total=43890 [2019-09-10 03:36:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9163 states. [2019-09-10 03:36:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9163 to 8962. [2019-09-10 03:36:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8962 states. [2019-09-10 03:36:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8962 states to 8962 states and 12401 transitions. [2019-09-10 03:36:04,908 INFO L78 Accepts]: Start accepts. Automaton has 8962 states and 12401 transitions. Word has length 298 [2019-09-10 03:36:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:04,908 INFO L475 AbstractCegarLoop]: Abstraction has 8962 states and 12401 transitions. [2019-09-10 03:36:04,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-09-10 03:36:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 8962 states and 12401 transitions. [2019-09-10 03:36:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-10 03:36:04,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:04,925 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:36:04,926 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2004270922, now seen corresponding path program 1 times [2019-09-10 03:36:04,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:04,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:04,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-09-10 03:36:05,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:36:05,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:36:05,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 303 with the following transitions: [2019-09-10 03:36:05,055 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [60], [76], [78], [86], [91], [94], [105], [107], [109], [111], [115], [145], [150], [164], [167], [170], [174], [176], [178], [179], [184], [190], [196], [202], [208], [214], [220], [226], [232], [238], [244], [250], [252], [253], [256], [259], [263], [265], [267], [268], [342], [352], [354], [356], [357], [359], [360], [362], [365], [367], [370], [373], [375], [378], [381], [383], [386], [389], [391], [394], [397], [399], [402], [405], [407], [409], [410], [413], [442], [443], [444], [447], [450], [454], [456], [458], [459], [464], [470], [476], [482], [488], [494], [500], [506], [512], [518], [524], [530], [532], [535], [541], [547], [553], [559], [565], [569], [572], [574], [577], [588], [590], [592], [596], [604], [607], [608], [609], [612], [615], [619], [621], [623], [624], [625], [634], [637], [640], [646], [649], [659], [662], [672], [675], [694], [707], [711], [714], [726], [736], [738], [740], [741], [742], [743], [757], [759], [792], [793], [800], [801], [804], [805], [806], [810], [811], [812], [813], [814], [815], [816], [817], [818], [819], [820], [821], [822], [823], [824], [825], [826], [828], [829], [830], [831], [832], [833], [834], [835], [840], [841], [842], [843], [844], [845], [846], [847], [848], [849], [850], [851], [852], [872], [873], [874] [2019-09-10 03:36:05,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:36:05,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:36:05,111 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:36:05,111 INFO L272 AbstractInterpreter]: Visited 167 different actions 233 times. Never merged. Never widened. Performed 1218 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1218 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 76 variables. [2019-09-10 03:36:05,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:05,111 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:36:05,260 INFO L227 lantSequenceWeakener]: Weakened 223 states. On average, predicates are now at 71.68% of their original sizes. [2019-09-10 03:36:05,260 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:36:09,359 INFO L420 sIntCurrentIteration]: We unified 301 AI predicates to 301 [2019-09-10 03:36:09,359 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:36:09,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:36:09,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [92] imperfect sequences [6] total 96 [2019-09-10 03:36:09,360 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:09,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-10 03:36:09,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-10 03:36:09,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=7748, Unknown=0, NotChecked=0, Total=8372 [2019-09-10 03:36:09,362 INFO L87 Difference]: Start difference. First operand 8962 states and 12401 transitions. Second operand 92 states.