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.10.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:32:51,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:32:51,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:32:51,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:32:51,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:32:51,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:32:51,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:32:51,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:32:51,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:32:51,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:32:51,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:32:51,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:32:51,280 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:32:51,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:32:51,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:32:51,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:32:51,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:32:51,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:32:51,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:32:51,288 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:32:51,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:32:51,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:32:51,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:32:51,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:32:51,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:32:51,296 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:32:51,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:32:51,297 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:32:51,297 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:32:51,298 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:32:51,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:32:51,299 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:32:51,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:32:51,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:32:51,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:32:51,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:32:51,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:32:51,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:32:51,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:32:51,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:32:51,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:32:51,306 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:32:51,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:32:51,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:32:51,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:32:51,321 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:32:51,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:32:51,322 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:32:51,322 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:32:51,323 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:32:51,323 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:32:51,323 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:32:51,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:32:51,324 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:32:51,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:32:51,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:32:51,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:32:51,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:32:51,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:32:51,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:32:51,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:32:51,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:32:51,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:32:51,326 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:32:51,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:32:51,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:32:51,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:32:51,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:32:51,327 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:32:51,327 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:32:51,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:32:51,328 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:32:51,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:32:51,369 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:32:51,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:32:51,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:32:51,375 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:32:51,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.10.cil-2.c [2019-09-10 03:32:51,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d623bd9c8/786f90bcf1784217842e1e278e5f5735/FLAG1fbad017a [2019-09-10 03:32:51,974 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:32:51,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.10.cil-2.c [2019-09-10 03:32:51,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d623bd9c8/786f90bcf1784217842e1e278e5f5735/FLAG1fbad017a [2019-09-10 03:32:52,274 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d623bd9c8/786f90bcf1784217842e1e278e5f5735 [2019-09-10 03:32:52,282 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:32:52,284 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:32:52,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:32:52,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:32:52,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:32:52,290 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:32:52" (1/1) ... [2019-09-10 03:32:52,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7042d4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:52, skipping insertion in model container [2019-09-10 03:32:52,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:32:52" (1/1) ... [2019-09-10 03:32:52,300 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:32:52,352 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:32:52,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:32:52,902 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:32:53,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:32:53,071 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:32:53,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53 WrapperNode [2019-09-10 03:32:53,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:32:53,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:32:53,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:32:53,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:32:53,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (1/1) ... [2019-09-10 03:32:53,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:32:53,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:32:53,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:32:53,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:32:53,209 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (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:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:32:53,262 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:32:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:32:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:32:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:32:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:32:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:32:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:32:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:32:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:32:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:32:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:32:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:32:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:32:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:32:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:32:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:32:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:32:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:32:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:32:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:32:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:32:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:32:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:32:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:32:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:32:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:32:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:32:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:32:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:32:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:32:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:32:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:32:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:32:54,530 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:32:54,533 INFO L283 CfgBuilder]: Removed 13 assume(true) statements. [2019-09-10 03:32:54,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:32:54 BoogieIcfgContainer [2019-09-10 03:32:54,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:32:54,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:32:54,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:32:54,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:32:54,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:32:52" (1/3) ... [2019-09-10 03:32:54,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e9ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:32:54, skipping insertion in model container [2019-09-10 03:32:54,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:32:53" (2/3) ... [2019-09-10 03:32:54,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3e9ca4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:32:54, skipping insertion in model container [2019-09-10 03:32:54,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:32:54" (3/3) ... [2019-09-10 03:32:54,545 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-2.c [2019-09-10 03:32:54,556 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:32:54,585 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:32:54,602 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:32:54,636 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:32:54,636 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:32:54,636 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:32:54,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:32:54,637 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:32:54,637 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:32:54,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:32:54,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:32:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states. [2019-09-10 03:32:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:32:54,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:54,712 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:54,714 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash 389771711, now seen corresponding path program 1 times [2019-09-10 03:32:54,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:54,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:54,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:54,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:55,217 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:32:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:32:55,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:32:55,221 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:55,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:32:55,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:32:55,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:32:55,249 INFO L87 Difference]: Start difference. First operand 414 states. Second operand 4 states. [2019-09-10 03:32:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:55,739 INFO L93 Difference]: Finished difference Result 412 states and 597 transitions. [2019-09-10 03:32:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:32:55,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-10 03:32:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:55,759 INFO L225 Difference]: With dead ends: 412 [2019-09-10 03:32:55,760 INFO L226 Difference]: Without dead ends: 405 [2019-09-10 03:32:55,761 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:32:55,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-09-10 03:32:55,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2019-09-10 03:32:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:32:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 590 transitions. [2019-09-10 03:32:55,838 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 590 transitions. Word has length 203 [2019-09-10 03:32:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:55,840 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 590 transitions. [2019-09-10 03:32:55,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:32:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 590 transitions. [2019-09-10 03:32:55,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:32:55,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:55,847 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:55,847 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:55,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1133990911, now seen corresponding path program 1 times [2019-09-10 03:32:55,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:55,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:55,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:55,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:56,182 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:32:56,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:32:56,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:32:56,183 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:56,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:32:56,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:32:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:56,187 INFO L87 Difference]: Start difference. First operand 405 states and 590 transitions. Second operand 5 states. [2019-09-10 03:32:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:57,175 INFO L93 Difference]: Finished difference Result 467 states and 704 transitions. [2019-09-10 03:32:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:32:57,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:32:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:57,181 INFO L225 Difference]: With dead ends: 467 [2019-09-10 03:32:57,182 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 03:32:57,186 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:32:57,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 03:32:57,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 405. [2019-09-10 03:32:57,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:32:57,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 589 transitions. [2019-09-10 03:32:57,235 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 589 transitions. Word has length 203 [2019-09-10 03:32:57,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:57,238 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 589 transitions. [2019-09-10 03:32:57,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:32:57,238 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 589 transitions. [2019-09-10 03:32:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:32:57,241 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:57,242 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:57,242 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:57,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:57,243 INFO L82 PathProgramCache]: Analyzing trace with hash -606596861, now seen corresponding path program 1 times [2019-09-10 03:32:57,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:57,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:57,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:57,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:32:57,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:32:57,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:32:57,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:57,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:32:57,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:32:57,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:57,413 INFO L87 Difference]: Start difference. First operand 405 states and 589 transitions. Second operand 5 states. [2019-09-10 03:32:58,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:58,250 INFO L93 Difference]: Finished difference Result 467 states and 704 transitions. [2019-09-10 03:32:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:32:58,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:32:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:58,256 INFO L225 Difference]: With dead ends: 467 [2019-09-10 03:32:58,256 INFO L226 Difference]: Without dead ends: 467 [2019-09-10 03:32:58,257 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:32:58,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-09-10 03:32:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 405. [2019-09-10 03:32:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:32:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 588 transitions. [2019-09-10 03:32:58,295 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 588 transitions. Word has length 203 [2019-09-10 03:32:58,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:58,296 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 588 transitions. [2019-09-10 03:32:58,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:32:58,296 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 588 transitions. [2019-09-10 03:32:58,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:32:58,299 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:58,300 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:58,300 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:58,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:58,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1975057471, now seen corresponding path program 1 times [2019-09-10 03:32:58,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:58,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:58,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:58,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:58,507 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:32:58,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:32:58,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:32:58,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:58,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:32:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:32:58,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:58,509 INFO L87 Difference]: Start difference. First operand 405 states and 588 transitions. Second operand 5 states. [2019-09-10 03:32:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:32:59,324 INFO L93 Difference]: Finished difference Result 465 states and 699 transitions. [2019-09-10 03:32:59,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:32:59,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:32:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:32:59,328 INFO L225 Difference]: With dead ends: 465 [2019-09-10 03:32:59,329 INFO L226 Difference]: Without dead ends: 465 [2019-09-10 03:32:59,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:32:59,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-09-10 03:32:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 405. [2019-09-10 03:32:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:32:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 587 transitions. [2019-09-10 03:32:59,366 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 587 transitions. Word has length 203 [2019-09-10 03:32:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:32:59,366 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 587 transitions. [2019-09-10 03:32:59,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:32:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 587 transitions. [2019-09-10 03:32:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:32:59,369 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:32:59,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:32:59,370 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:32:59,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:32:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1326464701, now seen corresponding path program 1 times [2019-09-10 03:32:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:32:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:59,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:32:59,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:32:59,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:32:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:32:59,481 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:32:59,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:32:59,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:32:59,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:32:59,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:32:59,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:32:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:32:59,494 INFO L87 Difference]: Start difference. First operand 405 states and 587 transitions. Second operand 5 states. [2019-09-10 03:33:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:00,364 INFO L93 Difference]: Finished difference Result 463 states and 694 transitions. [2019-09-10 03:33:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:00,364 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:00,368 INFO L225 Difference]: With dead ends: 463 [2019-09-10 03:33:00,369 INFO L226 Difference]: Without dead ends: 463 [2019-09-10 03:33:00,369 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:33:00,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-09-10 03:33:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 405. [2019-09-10 03:33:00,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 586 transitions. [2019-09-10 03:33:00,385 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 586 transitions. Word has length 203 [2019-09-10 03:33:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:00,385 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 586 transitions. [2019-09-10 03:33:00,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 586 transitions. [2019-09-10 03:33:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:00,388 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:00,389 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:00,389 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:00,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:00,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1465404289, now seen corresponding path program 1 times [2019-09-10 03:33:00,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:00,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:00,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:00,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:00,522 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:33:00,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:00,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:00,523 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:00,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:00,524 INFO L87 Difference]: Start difference. First operand 405 states and 586 transitions. Second operand 5 states. [2019-09-10 03:33:01,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:01,399 INFO L93 Difference]: Finished difference Result 461 states and 689 transitions. [2019-09-10 03:33:01,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:01,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:01,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:01,403 INFO L225 Difference]: With dead ends: 461 [2019-09-10 03:33:01,403 INFO L226 Difference]: Without dead ends: 461 [2019-09-10 03:33:01,404 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:33:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-09-10 03:33:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 405. [2019-09-10 03:33:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 585 transitions. [2019-09-10 03:33:01,418 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 585 transitions. Word has length 203 [2019-09-10 03:33:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:01,419 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 585 transitions. [2019-09-10 03:33:01,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 585 transitions. [2019-09-10 03:33:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:01,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:01,422 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:01,422 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1555464579, now seen corresponding path program 1 times [2019-09-10 03:33:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:01,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:01,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:01,543 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:33:01,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:01,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:01,544 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:01,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:01,545 INFO L87 Difference]: Start difference. First operand 405 states and 585 transitions. Second operand 5 states. [2019-09-10 03:33:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:02,393 INFO L93 Difference]: Finished difference Result 459 states and 684 transitions. [2019-09-10 03:33:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:02,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:02,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:02,396 INFO L225 Difference]: With dead ends: 459 [2019-09-10 03:33:02,397 INFO L226 Difference]: Without dead ends: 459 [2019-09-10 03:33:02,397 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:33:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2019-09-10 03:33:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 405. [2019-09-10 03:33:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 584 transitions. [2019-09-10 03:33:02,411 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 584 transitions. Word has length 203 [2019-09-10 03:33:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:02,411 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 584 transitions. [2019-09-10 03:33:02,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 584 transitions. [2019-09-10 03:33:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:02,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:02,413 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:02,413 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 865633089, now seen corresponding path program 1 times [2019-09-10 03:33:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:02,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:02,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:02,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:33:02,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:02,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:02,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:02,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:02,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:02,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:02,513 INFO L87 Difference]: Start difference. First operand 405 states and 584 transitions. Second operand 5 states. [2019-09-10 03:33:03,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:03,639 INFO L93 Difference]: Finished difference Result 455 states and 675 transitions. [2019-09-10 03:33:03,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:03,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:03,649 INFO L225 Difference]: With dead ends: 455 [2019-09-10 03:33:03,650 INFO L226 Difference]: Without dead ends: 455 [2019-09-10 03:33:03,651 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:33:03,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2019-09-10 03:33:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 405. [2019-09-10 03:33:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 583 transitions. [2019-09-10 03:33:03,684 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 583 transitions. Word has length 203 [2019-09-10 03:33:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:03,685 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 583 transitions. [2019-09-10 03:33:03,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 583 transitions. [2019-09-10 03:33:03,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:03,688 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:03,689 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:03,689 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:03,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:03,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1374411903, now seen corresponding path program 1 times [2019-09-10 03:33:03,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:03,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:03,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:03,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:03,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:03,863 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:33:03,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:03,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:03,864 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:03,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:03,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:03,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:03,866 INFO L87 Difference]: Start difference. First operand 405 states and 583 transitions. Second operand 5 states. [2019-09-10 03:33:04,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:04,841 INFO L93 Difference]: Finished difference Result 453 states and 670 transitions. [2019-09-10 03:33:04,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:04,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:04,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:04,845 INFO L225 Difference]: With dead ends: 453 [2019-09-10 03:33:04,845 INFO L226 Difference]: Without dead ends: 453 [2019-09-10 03:33:04,846 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:33:04,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-09-10 03:33:04,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 405. [2019-09-10 03:33:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 582 transitions. [2019-09-10 03:33:04,859 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 582 transitions. Word has length 203 [2019-09-10 03:33:04,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:04,859 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 582 transitions. [2019-09-10 03:33:04,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:04,859 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 582 transitions. [2019-09-10 03:33:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:04,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:04,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:04,861 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -548838527, now seen corresponding path program 1 times [2019-09-10 03:33:04,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:04,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:04,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:04,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:04,982 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:33:04,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:04,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:04,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:04,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:04,984 INFO L87 Difference]: Start difference. First operand 405 states and 582 transitions. Second operand 5 states. [2019-09-10 03:33:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:05,841 INFO L93 Difference]: Finished difference Result 451 states and 665 transitions. [2019-09-10 03:33:05,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:05,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:05,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:05,845 INFO L225 Difference]: With dead ends: 451 [2019-09-10 03:33:05,846 INFO L226 Difference]: Without dead ends: 451 [2019-09-10 03:33:05,846 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:33:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-09-10 03:33:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 405. [2019-09-10 03:33:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:05,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2019-09-10 03:33:05,858 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 203 [2019-09-10 03:33:05,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:05,859 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2019-09-10 03:33:05,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2019-09-10 03:33:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:05,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:05,861 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:05,861 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2021520447, now seen corresponding path program 1 times [2019-09-10 03:33:05,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:05,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:05,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:05,970 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:33:05,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:05,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:05,971 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:05,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:05,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:05,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:05,973 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand 5 states. [2019-09-10 03:33:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:06,796 INFO L93 Difference]: Finished difference Result 449 states and 660 transitions. [2019-09-10 03:33:06,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:06,796 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:06,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:06,799 INFO L225 Difference]: With dead ends: 449 [2019-09-10 03:33:06,800 INFO L226 Difference]: Without dead ends: 449 [2019-09-10 03:33:06,801 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:33:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-10 03:33:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 405. [2019-09-10 03:33:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 580 transitions. [2019-09-10 03:33:06,821 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 580 transitions. Word has length 203 [2019-09-10 03:33:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:06,822 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 580 transitions. [2019-09-10 03:33:06,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 580 transitions. [2019-09-10 03:33:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:06,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:06,824 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:06,824 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1774890047, now seen corresponding path program 1 times [2019-09-10 03:33:06,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:06,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:06,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:06,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:06,929 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:33:06,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:06,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:06,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:06,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:06,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:06,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:06,932 INFO L87 Difference]: Start difference. First operand 405 states and 580 transitions. Second operand 5 states. [2019-09-10 03:33:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:07,775 INFO L93 Difference]: Finished difference Result 490 states and 735 transitions. [2019-09-10 03:33:07,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:07,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:07,780 INFO L225 Difference]: With dead ends: 490 [2019-09-10 03:33:07,780 INFO L226 Difference]: Without dead ends: 490 [2019-09-10 03:33:07,781 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:33:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-09-10 03:33:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 405. [2019-09-10 03:33:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 579 transitions. [2019-09-10 03:33:07,793 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 579 transitions. Word has length 203 [2019-09-10 03:33:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:07,794 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 579 transitions. [2019-09-10 03:33:07,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 579 transitions. [2019-09-10 03:33:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:07,795 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:07,795 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:07,796 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:07,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1204618241, now seen corresponding path program 1 times [2019-09-10 03:33:07,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:07,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:07,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:07,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:07,900 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:33:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:07,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:07,901 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:07,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:07,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:07,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:07,902 INFO L87 Difference]: Start difference. First operand 405 states and 579 transitions. Second operand 5 states. [2019-09-10 03:33:08,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:08,617 INFO L93 Difference]: Finished difference Result 484 states and 725 transitions. [2019-09-10 03:33:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:08,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:08,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:08,622 INFO L225 Difference]: With dead ends: 484 [2019-09-10 03:33:08,622 INFO L226 Difference]: Without dead ends: 484 [2019-09-10 03:33:08,622 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:33:08,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-09-10 03:33:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 405. [2019-09-10 03:33:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:08,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 578 transitions. [2019-09-10 03:33:08,635 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 578 transitions. Word has length 203 [2019-09-10 03:33:08,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:08,635 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 578 transitions. [2019-09-10 03:33:08,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:08,635 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 578 transitions. [2019-09-10 03:33:08,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:08,637 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:08,637 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:08,637 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:08,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:08,638 INFO L82 PathProgramCache]: Analyzing trace with hash 199250945, now seen corresponding path program 1 times [2019-09-10 03:33:08,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:08,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:08,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:08,728 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:33:08,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:08,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:08,729 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:08,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:08,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:08,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:08,731 INFO L87 Difference]: Start difference. First operand 405 states and 578 transitions. Second operand 5 states. [2019-09-10 03:33:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:09,708 INFO L93 Difference]: Finished difference Result 486 states and 725 transitions. [2019-09-10 03:33:09,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:09,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:09,712 INFO L225 Difference]: With dead ends: 486 [2019-09-10 03:33:09,712 INFO L226 Difference]: Without dead ends: 486 [2019-09-10 03:33:09,712 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:33:09,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2019-09-10 03:33:09,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 405. [2019-09-10 03:33:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:09,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 577 transitions. [2019-09-10 03:33:09,724 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 577 transitions. Word has length 203 [2019-09-10 03:33:09,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:09,725 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 577 transitions. [2019-09-10 03:33:09,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 577 transitions. [2019-09-10 03:33:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:09,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:09,727 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:09,727 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash -586746945, now seen corresponding path program 1 times [2019-09-10 03:33:09,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:09,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:09,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:09,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:09,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:09,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:33:09,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:09,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:09,828 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:09,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:09,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:09,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:09,830 INFO L87 Difference]: Start difference. First operand 405 states and 577 transitions. Second operand 5 states. [2019-09-10 03:33:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:10,683 INFO L93 Difference]: Finished difference Result 482 states and 716 transitions. [2019-09-10 03:33:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:10,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:10,687 INFO L225 Difference]: With dead ends: 482 [2019-09-10 03:33:10,687 INFO L226 Difference]: Without dead ends: 482 [2019-09-10 03:33:10,687 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:33:10,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-09-10 03:33:10,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 405. [2019-09-10 03:33:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:10,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 576 transitions. [2019-09-10 03:33:10,699 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 576 transitions. Word has length 203 [2019-09-10 03:33:10,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:10,700 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 576 transitions. [2019-09-10 03:33:10,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:10,700 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 576 transitions. [2019-09-10 03:33:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:10,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:10,702 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:10,702 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:10,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:10,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1512991485, now seen corresponding path program 1 times [2019-09-10 03:33:10,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:10,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:10,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:10,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:10,790 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:33:10,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:10,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:10,792 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:10,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:10,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:10,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:10,794 INFO L87 Difference]: Start difference. First operand 405 states and 576 transitions. Second operand 5 states. [2019-09-10 03:33:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:11,599 INFO L93 Difference]: Finished difference Result 480 states and 711 transitions. [2019-09-10 03:33:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:11,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:11,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:11,603 INFO L225 Difference]: With dead ends: 480 [2019-09-10 03:33:11,603 INFO L226 Difference]: Without dead ends: 480 [2019-09-10 03:33:11,604 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:33:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-09-10 03:33:11,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 405. [2019-09-10 03:33:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:11,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 575 transitions. [2019-09-10 03:33:11,615 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 575 transitions. Word has length 203 [2019-09-10 03:33:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:11,616 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 575 transitions. [2019-09-10 03:33:11,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 575 transitions. [2019-09-10 03:33:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:11,617 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:11,617 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:11,618 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1857819647, now seen corresponding path program 1 times [2019-09-10 03:33:11,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:11,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:11,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:11,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:11,706 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:33:11,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:11,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:11,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:11,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:11,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:11,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:11,708 INFO L87 Difference]: Start difference. First operand 405 states and 575 transitions. Second operand 5 states. [2019-09-10 03:33:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:12,467 INFO L93 Difference]: Finished difference Result 478 states and 706 transitions. [2019-09-10 03:33:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:12,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:12,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:12,471 INFO L225 Difference]: With dead ends: 478 [2019-09-10 03:33:12,471 INFO L226 Difference]: Without dead ends: 478 [2019-09-10 03:33:12,472 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:33:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-09-10 03:33:12,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 405. [2019-09-10 03:33:12,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 574 transitions. [2019-09-10 03:33:12,487 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 574 transitions. Word has length 203 [2019-09-10 03:33:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:12,487 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 574 transitions. [2019-09-10 03:33:12,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 574 transitions. [2019-09-10 03:33:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:12,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:12,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:12,489 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:12,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1456192835, now seen corresponding path program 1 times [2019-09-10 03:33:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:12,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:12,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:12,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:12,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:12,599 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:33:12,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:12,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:12,600 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:12,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:12,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:12,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:12,601 INFO L87 Difference]: Start difference. First operand 405 states and 574 transitions. Second operand 5 states. [2019-09-10 03:33:13,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:13,527 INFO L93 Difference]: Finished difference Result 476 states and 701 transitions. [2019-09-10 03:33:13,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:13,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:13,531 INFO L225 Difference]: With dead ends: 476 [2019-09-10 03:33:13,531 INFO L226 Difference]: Without dead ends: 476 [2019-09-10 03:33:13,532 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:33:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2019-09-10 03:33:13,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 405. [2019-09-10 03:33:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 573 transitions. [2019-09-10 03:33:13,555 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 573 transitions. Word has length 203 [2019-09-10 03:33:13,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:13,555 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 573 transitions. [2019-09-10 03:33:13,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 573 transitions. [2019-09-10 03:33:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:13,558 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:13,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:13,559 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:13,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1069302847, now seen corresponding path program 1 times [2019-09-10 03:33:13,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:13,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:13,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:13,710 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:33:13,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:13,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:13,711 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:13,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:13,721 INFO L87 Difference]: Start difference. First operand 405 states and 573 transitions. Second operand 5 states. [2019-09-10 03:33:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:14,831 INFO L93 Difference]: Finished difference Result 474 states and 696 transitions. [2019-09-10 03:33:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:14,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:14,836 INFO L225 Difference]: With dead ends: 474 [2019-09-10 03:33:14,836 INFO L226 Difference]: Without dead ends: 474 [2019-09-10 03:33:14,838 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:33:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-09-10 03:33:14,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 405. [2019-09-10 03:33:14,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:14,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 572 transitions. [2019-09-10 03:33:14,856 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 572 transitions. Word has length 203 [2019-09-10 03:33:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:14,856 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 572 transitions. [2019-09-10 03:33:14,856 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 572 transitions. [2019-09-10 03:33:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:14,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:14,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:14,859 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 458033789, now seen corresponding path program 1 times [2019-09-10 03:33:14,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:14,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:14,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:14,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:15,026 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:33:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:15,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:15,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:15,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:15,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:15,029 INFO L87 Difference]: Start difference. First operand 405 states and 572 transitions. Second operand 5 states. [2019-09-10 03:33:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:16,179 INFO L93 Difference]: Finished difference Result 472 states and 691 transitions. [2019-09-10 03:33:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:16,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:16,183 INFO L225 Difference]: With dead ends: 472 [2019-09-10 03:33:16,183 INFO L226 Difference]: Without dead ends: 472 [2019-09-10 03:33:16,184 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:33:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-10 03:33:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 405. [2019-09-10 03:33:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 571 transitions. [2019-09-10 03:33:16,201 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 571 transitions. Word has length 203 [2019-09-10 03:33:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:16,201 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 571 transitions. [2019-09-10 03:33:16,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 571 transitions. [2019-09-10 03:33:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:16,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:16,204 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:16,204 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:16,204 INFO L82 PathProgramCache]: Analyzing trace with hash -947157889, now seen corresponding path program 1 times [2019-09-10 03:33:16,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:16,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:16,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:16,306 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:33:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:16,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:33:16,307 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:16,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:33:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:33:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:33:16,308 INFO L87 Difference]: Start difference. First operand 405 states and 571 transitions. Second operand 5 states. [2019-09-10 03:33:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:17,083 INFO L93 Difference]: Finished difference Result 470 states and 686 transitions. [2019-09-10 03:33:17,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:33:17,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-10 03:33:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:17,087 INFO L225 Difference]: With dead ends: 470 [2019-09-10 03:33:17,087 INFO L226 Difference]: Without dead ends: 470 [2019-09-10 03:33:17,087 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:33:17,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-09-10 03:33:17,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 405. [2019-09-10 03:33:17,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2019-09-10 03:33:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 570 transitions. [2019-09-10 03:33:17,104 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 570 transitions. Word has length 203 [2019-09-10 03:33:17,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:17,104 INFO L475 AbstractCegarLoop]: Abstraction has 405 states and 570 transitions. [2019-09-10 03:33:17,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:33:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 570 transitions. [2019-09-10 03:33:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:33:17,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:17,106 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:33:17,106 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash 947175997, now seen corresponding path program 1 times [2019-09-10 03:33:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:17,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:17,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:33:17,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:33:17,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:33:17,244 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:17,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:33:17,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:33:17,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:33:17,246 INFO L87 Difference]: Start difference. First operand 405 states and 570 transitions. Second operand 4 states. [2019-09-10 03:33:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:17,699 INFO L93 Difference]: Finished difference Result 773 states and 1085 transitions. [2019-09-10 03:33:17,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:33:17,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2019-09-10 03:33:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:17,704 INFO L225 Difference]: With dead ends: 773 [2019-09-10 03:33:17,704 INFO L226 Difference]: Without dead ends: 773 [2019-09-10 03:33:17,705 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:33:17,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-09-10 03:33:17,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 772. [2019-09-10 03:33:17,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-09-10 03:33:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1084 transitions. [2019-09-10 03:33:17,729 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1084 transitions. Word has length 203 [2019-09-10 03:33:17,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:17,729 INFO L475 AbstractCegarLoop]: Abstraction has 772 states and 1084 transitions. [2019-09-10 03:33:17,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:33:17,729 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1084 transitions. [2019-09-10 03:33:17,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:33:17,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:17,733 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:17,733 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1156380288, now seen corresponding path program 1 times [2019-09-10 03:33:17,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:17,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:17,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:17,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 1 proven. 37 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:33:17,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:33:17,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:33:17,894 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:33:17,897 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [608], [609], [610], [613], [616], [624], [625], [627], [628], [630], [633], [638], [641], [646], [649], [654], [657], [662], [665], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [840], [848], [852], [858], [864], [870], [876], [882], [888], [896], [900], [906], [912], [918], [924], [930], [936], [944], [948], [954], [960], [966], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:33:17,966 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:33:17,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:33:18,179 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:33:18,180 INFO L272 AbstractInterpreter]: Visited 65 different actions 65 times. Never merged. Never widened. Performed 632 root evaluator evaluations with a maximum evaluation depth of 3. Performed 632 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:33:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:18,185 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:33:18,455 INFO L227 lantSequenceWeakener]: Weakened 63 states. On average, predicates are now at 67.51% of their original sizes. [2019-09-10 03:33:18,455 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:33:18,809 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:33:18,810 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:33:18,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:33:18,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [6] total 22 [2019-09-10 03:33:18,811 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:18,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 03:33:18,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 03:33:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:33:18,812 INFO L87 Difference]: Start difference. First operand 772 states and 1084 transitions. Second operand 18 states. [2019-09-10 03:33:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:25,125 INFO L93 Difference]: Finished difference Result 1036 states and 1400 transitions. [2019-09-10 03:33:25,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:33:25,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 337 [2019-09-10 03:33:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:25,132 INFO L225 Difference]: With dead ends: 1036 [2019-09-10 03:33:25,132 INFO L226 Difference]: Without dead ends: 1036 [2019-09-10 03:33:25,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:33:25,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2019-09-10 03:33:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1012. [2019-09-10 03:33:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-09-10 03:33:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1375 transitions. [2019-09-10 03:33:25,167 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1375 transitions. Word has length 337 [2019-09-10 03:33:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:25,168 INFO L475 AbstractCegarLoop]: Abstraction has 1012 states and 1375 transitions. [2019-09-10 03:33:25,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 03:33:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1375 transitions. [2019-09-10 03:33:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:33:25,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:25,175 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,175 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:25,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 736727399, now seen corresponding path program 1 times [2019-09-10 03:33:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:25,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:25,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-10 03:33:25,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:33:25,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:33:25,406 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:33:25,410 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [646], [649], [654], [657], [662], [665], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:33:25,427 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:33:25,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:33:25,512 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:33:25,513 INFO L272 AbstractInterpreter]: Visited 75 different actions 75 times. Never merged. Never widened. Performed 696 root evaluator evaluations with a maximum evaluation depth of 4. Performed 696 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:33:25,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:25,513 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:33:25,724 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 67.23% of their original sizes. [2019-09-10 03:33:25,725 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:33:26,432 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:33:26,432 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:33:26,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:33:26,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [6] total 27 [2019-09-10 03:33:26,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:26,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-10 03:33:26,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-10 03:33:26,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-09-10 03:33:26,440 INFO L87 Difference]: Start difference. First operand 1012 states and 1375 transitions. Second operand 23 states. [2019-09-10 03:33:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:39,001 INFO L93 Difference]: Finished difference Result 1026 states and 1377 transitions. [2019-09-10 03:33:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:33:39,001 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 337 [2019-09-10 03:33:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:39,006 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:33:39,006 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:33:39,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2019-09-10 03:33:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:33:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:33:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:33:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1352 transitions. [2019-09-10 03:33:39,030 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1352 transitions. Word has length 337 [2019-09-10 03:33:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:39,031 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1352 transitions. [2019-09-10 03:33:39,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-10 03:33:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1352 transitions. [2019-09-10 03:33:39,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:33:39,037 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:39,038 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:39,039 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1647589545, now seen corresponding path program 1 times [2019-09-10 03:33:39,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:39,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:39,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:39,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:39,189 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 31 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-10 03:33:39,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:33:39,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:33:39,190 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2019-09-10 03:33:39,190 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [76], [92], [94], [102], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [654], [657], [662], [665], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1136], [1152], [1156], [1159], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1419], [1420], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:33:39,193 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:33:39,193 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:33:39,252 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:33:39,252 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Performed 760 root evaluator evaluations with a maximum evaluation depth of 4. Performed 760 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:33:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:39,253 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:33:39,383 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 66.85% of their original sizes. [2019-09-10 03:33:39,383 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:33:40,093 INFO L420 sIntCurrentIteration]: We unified 364 AI predicates to 364 [2019-09-10 03:33:40,094 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:33:40,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:33:40,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [6] total 31 [2019-09-10 03:33:40,094 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:40,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 03:33:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 03:33:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:33:40,095 INFO L87 Difference]: Start difference. First operand 1002 states and 1352 transitions. Second operand 27 states. [2019-09-10 03:33:49,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:33:49,225 INFO L93 Difference]: Finished difference Result 1026 states and 1375 transitions. [2019-09-10 03:33:49,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:33:49,225 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 365 [2019-09-10 03:33:49,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:33:49,229 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:33:49,230 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:33:49,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=387, Invalid=1253, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:33:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:33:49,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:33:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:33:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1350 transitions. [2019-09-10 03:33:49,252 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1350 transitions. Word has length 365 [2019-09-10 03:33:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:33:49,253 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1350 transitions. [2019-09-10 03:33:49,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 03:33:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1350 transitions. [2019-09-10 03:33:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:33:49,257 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:33:49,258 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:49,258 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:33:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:49,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1144586038, now seen corresponding path program 1 times [2019-09-10 03:33:49,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:33:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:49,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:33:49,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:33:49,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:33:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:33:49,403 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:33:49,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:33:49,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:33:49,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2019-09-10 03:33:49,404 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [662], [665], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1136], [1143], [1146], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1417], [1418], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:33:49,407 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:33:49,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:33:49,483 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:33:49,484 INFO L272 AbstractInterpreter]: Visited 96 different actions 96 times. Never merged. Never widened. Performed 825 root evaluator evaluations with a maximum evaluation depth of 4. Performed 825 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:33:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:33:49,485 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:33:49,627 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 66.38% of their original sizes. [2019-09-10 03:33:49,628 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:33:50,655 INFO L420 sIntCurrentIteration]: We unified 364 AI predicates to 364 [2019-09-10 03:33:50,656 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:33:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:33:50,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [31] imperfect sequences [6] total 35 [2019-09-10 03:33:50,657 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:33:50,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-10 03:33:50,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-10 03:33:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:33:50,659 INFO L87 Difference]: Start difference. First operand 1002 states and 1350 transitions. Second operand 31 states. [2019-09-10 03:34:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:34:11,899 INFO L93 Difference]: Finished difference Result 1026 states and 1373 transitions. [2019-09-10 03:34:11,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:34:11,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 365 [2019-09-10 03:34:11,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:34:11,906 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:34:11,906 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:34:11,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:34:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:34:11,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:34:11,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:34:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1348 transitions. [2019-09-10 03:34:11,929 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1348 transitions. Word has length 365 [2019-09-10 03:34:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:34:11,929 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1348 transitions. [2019-09-10 03:34:11,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-10 03:34:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1348 transitions. [2019-09-10 03:34:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:34:11,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:34:11,934 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,934 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:34:11,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 458818420, now seen corresponding path program 1 times [2019-09-10 03:34:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:34:11,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:11,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:34:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:11,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:34:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:34:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-09-10 03:34:12,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:34:12,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:34:12,124 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2019-09-10 03:34:12,124 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1136], [1143], [1146], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1417], [1418], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:34:12,127 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:34:12,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:34:12,187 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:34:12,187 INFO L272 AbstractInterpreter]: Visited 107 different actions 107 times. Never merged. Never widened. Performed 890 root evaluator evaluations with a maximum evaluation depth of 4. Performed 890 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:34:12,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:12,188 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:34:12,324 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 65.86% of their original sizes. [2019-09-10 03:34:12,325 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:34:13,646 INFO L420 sIntCurrentIteration]: We unified 364 AI predicates to 364 [2019-09-10 03:34:13,646 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:34:13,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:34:13,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [35] imperfect sequences [6] total 39 [2019-09-10 03:34:13,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:34:13,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-10 03:34:13,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-10 03:34:13,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:34:13,653 INFO L87 Difference]: Start difference. First operand 1002 states and 1348 transitions. Second operand 35 states. [2019-09-10 03:34:29,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:34:29,886 INFO L93 Difference]: Finished difference Result 1026 states and 1371 transitions. [2019-09-10 03:34:29,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:34:29,886 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 365 [2019-09-10 03:34:29,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:34:29,890 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:34:29,890 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:34:29,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=636, Invalid=2786, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 03:34:29,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:34:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:34:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:34:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1346 transitions. [2019-09-10 03:34:29,911 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1346 transitions. Word has length 365 [2019-09-10 03:34:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:34:29,912 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1346 transitions. [2019-09-10 03:34:29,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-10 03:34:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1346 transitions. [2019-09-10 03:34:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:34:29,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:34:29,916 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,916 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:34:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1025352054, now seen corresponding path program 1 times [2019-09-10 03:34:29,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:34:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:29,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:34:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:29,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:34:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:34:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-10 03:34:30,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:34:30,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:34:30,128 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2019-09-10 03:34:30,129 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1136], [1143], [1146], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1417], [1418], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:34:30,131 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:34:30,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:34:30,206 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:34:30,207 INFO L272 AbstractInterpreter]: Visited 117 different actions 117 times. Never merged. Never widened. Performed 954 root evaluator evaluations with a maximum evaluation depth of 4. Performed 954 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:34:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:30,207 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:34:30,356 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 65.3% of their original sizes. [2019-09-10 03:34:30,356 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:34:31,927 INFO L420 sIntCurrentIteration]: We unified 364 AI predicates to 364 [2019-09-10 03:34:31,927 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:34:31,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:34:31,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [39] imperfect sequences [6] total 43 [2019-09-10 03:34:31,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:34:31,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-10 03:34:31,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-10 03:34:31,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1326, Unknown=0, NotChecked=0, Total=1482 [2019-09-10 03:34:31,930 INFO L87 Difference]: Start difference. First operand 1002 states and 1346 transitions. Second operand 39 states. [2019-09-10 03:34:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:34:55,712 INFO L93 Difference]: Finished difference Result 1026 states and 1369 transitions. [2019-09-10 03:34:55,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:34:55,712 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 365 [2019-09-10 03:34:55,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:34:55,717 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:34:55,717 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:34:55,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=783, Invalid=3773, Unknown=0, NotChecked=0, Total=4556 [2019-09-10 03:34:55,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:34:55,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:34:55,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:34:55,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1344 transitions. [2019-09-10 03:34:55,738 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1344 transitions. Word has length 365 [2019-09-10 03:34:55,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:34:55,739 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1344 transitions. [2019-09-10 03:34:55,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-10 03:34:55,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1344 transitions. [2019-09-10 03:34:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:34:55,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:34:55,743 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55,743 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:34:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1010443941, now seen corresponding path program 1 times [2019-09-10 03:34:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:34:55,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:34:55,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:34:55,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:34:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:34:55,865 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-09-10 03:34:55,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:34:55,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:34:55,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:34:55,866 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:34:55,869 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:34:55,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:34:55,908 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:34:55,908 INFO L272 AbstractInterpreter]: Visited 128 different actions 128 times. Never merged. Never widened. Performed 1019 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1019 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:34:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:34:55,908 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:34:56,043 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 68.39% of their original sizes. [2019-09-10 03:34:56,044 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:34:57,779 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:34:57,779 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:34:57,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:34:57,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [43] imperfect sequences [6] total 47 [2019-09-10 03:34:57,780 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:34:57,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-10 03:34:57,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-10 03:34:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1600, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:34:57,782 INFO L87 Difference]: Start difference. First operand 1002 states and 1344 transitions. Second operand 43 states. [2019-09-10 03:35:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:25,431 INFO L93 Difference]: Finished difference Result 1026 states and 1368 transitions. [2019-09-10 03:35:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:35:25,431 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 337 [2019-09-10 03:35:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:25,436 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:35:25,436 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:35:25,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=795, Invalid=4317, Unknown=0, NotChecked=0, Total=5112 [2019-09-10 03:35:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:35:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:35:25,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:35:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1343 transitions. [2019-09-10 03:35:25,465 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1343 transitions. Word has length 337 [2019-09-10 03:35:25,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:25,465 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1343 transitions. [2019-09-10 03:35:25,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-10 03:35:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1343 transitions. [2019-09-10 03:35:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:35:25,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:25,470 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:25,470 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -847964121, now seen corresponding path program 1 times [2019-09-10 03:35:25,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:25,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:25,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:25,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-09-10 03:35:25,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:25,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:35:25,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:35:25,618 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [683], [686], [689], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:35:25,622 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:35:25,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:35:25,690 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:35:25,691 INFO L272 AbstractInterpreter]: Visited 139 different actions 139 times. Never merged. Never widened. Performed 1084 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1084 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:35:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:25,691 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:35:25,848 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 68.54% of their original sizes. [2019-09-10 03:35:25,848 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:35:27,906 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:35:27,906 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:35:27,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:35:27,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [47] imperfect sequences [6] total 51 [2019-09-10 03:35:27,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:27,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-10 03:35:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-10 03:35:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1940, Unknown=0, NotChecked=0, Total=2162 [2019-09-10 03:35:27,909 INFO L87 Difference]: Start difference. First operand 1002 states and 1343 transitions. Second operand 47 states. [2019-09-10 03:35:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:35:53,759 INFO L93 Difference]: Finished difference Result 1026 states and 1367 transitions. [2019-09-10 03:35:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-10 03:35:53,759 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 337 [2019-09-10 03:35:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:35:53,764 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:35:53,764 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:35:53,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=909, Invalid=5411, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 03:35:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:35:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:35:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:35:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1342 transitions. [2019-09-10 03:35:53,785 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1342 transitions. Word has length 337 [2019-09-10 03:35:53,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:35:53,785 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1342 transitions. [2019-09-10 03:35:53,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-10 03:35:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1342 transitions. [2019-09-10 03:35:53,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:35:53,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:35:53,790 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:53,790 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:35:53,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:53,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1542889204, now seen corresponding path program 1 times [2019-09-10 03:35:53,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:35:53,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:53,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:35:53,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:35:53,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:35:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:35:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-09-10 03:35:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:35:53,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:35:53,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 366 with the following transitions: [2019-09-10 03:35:53,939 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [683], [686], [689], [691], [694], [697], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1136], [1143], [1146], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1417], [1418], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:35:53,941 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:35:53,942 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:35:53,998 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:35:53,998 INFO L272 AbstractInterpreter]: Visited 149 different actions 149 times. Never merged. Never widened. Performed 1148 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1148 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:35:53,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:35:53,999 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:35:54,147 INFO L227 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 63.46% of their original sizes. [2019-09-10 03:35:54,147 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:35:57,192 INFO L420 sIntCurrentIteration]: We unified 364 AI predicates to 364 [2019-09-10 03:35:57,192 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:35:57,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:35:57,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [6] total 55 [2019-09-10 03:35:57,193 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:35:57,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-10 03:35:57,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-10 03:35:57,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2361, Unknown=0, NotChecked=0, Total=2550 [2019-09-10 03:35:57,195 INFO L87 Difference]: Start difference. First operand 1002 states and 1342 transitions. Second operand 51 states. [2019-09-10 03:36:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:36:27,378 INFO L93 Difference]: Finished difference Result 1026 states and 1363 transitions. [2019-09-10 03:36:27,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-10 03:36:27,378 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 365 [2019-09-10 03:36:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:36:27,382 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:36:27,383 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:36:27,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1314, Invalid=7616, Unknown=0, NotChecked=0, Total=8930 [2019-09-10 03:36:27,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:36:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:36:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:36:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1338 transitions. [2019-09-10 03:36:27,403 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1338 transitions. Word has length 365 [2019-09-10 03:36:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:36:27,403 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1338 transitions. [2019-09-10 03:36:27,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-10 03:36:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1338 transitions. [2019-09-10 03:36:27,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:36:27,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:36:27,408 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,408 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:36:27,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -594822553, now seen corresponding path program 1 times [2019-09-10 03:36:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:36:27,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:27,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:36:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:36:27,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:36:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:36:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-09-10 03:36:27,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:36:27,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:36:27,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:36:27,538 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [683], [686], [689], [691], [694], [697], [699], [702], [705], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:36:27,541 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:36:27,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:36:27,607 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:36:27,607 INFO L272 AbstractInterpreter]: Visited 160 different actions 160 times. Never merged. Never widened. Performed 1213 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1213 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:36:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:36:27,607 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:36:27,717 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 68.79% of their original sizes. [2019-09-10 03:36:27,718 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:36:30,698 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:36:30,698 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:36:30,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:36:30,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [55] imperfect sequences [6] total 59 [2019-09-10 03:36:30,699 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:36:30,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-10 03:36:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-10 03:36:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2716, Unknown=0, NotChecked=0, Total=2970 [2019-09-10 03:36:30,702 INFO L87 Difference]: Start difference. First operand 1002 states and 1338 transitions. Second operand 55 states. [2019-09-10 03:37:11,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:11,010 INFO L93 Difference]: Finished difference Result 1026 states and 1362 transitions. [2019-09-10 03:37:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:37:11,011 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 337 [2019-09-10 03:37:11,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:11,015 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:37:11,015 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:37:11,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1080 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1149, Invalid=7971, Unknown=0, NotChecked=0, Total=9120 [2019-09-10 03:37:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:37:11,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:37:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:37:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1337 transitions. [2019-09-10 03:37:11,037 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1337 transitions. Word has length 337 [2019-09-10 03:37:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:11,037 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1337 transitions. [2019-09-10 03:37:11,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-10 03:37:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1337 transitions. [2019-09-10 03:37:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:37:11,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:11,041 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:11,041 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:11,042 INFO L82 PathProgramCache]: Analyzing trace with hash -107748827, now seen corresponding path program 1 times [2019-09-10 03:37:11,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:11,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:11,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:11,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:37:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-10 03:37:11,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:37:11,174 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:37:11,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:37:11,175 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [633], [635], [638], [641], [643], [646], [649], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [683], [686], [689], [691], [694], [697], [699], [702], [705], [707], [710], [713], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:37:11,177 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:37:11,177 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:37:11,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:37:11,227 INFO L272 AbstractInterpreter]: Visited 170 different actions 170 times. Never merged. Never widened. Performed 1277 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:37:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:11,228 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:37:11,373 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 68.91% of their original sizes. [2019-09-10 03:37:11,373 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:37:14,673 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:37:14,674 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:37:14,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:37:14,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [59] imperfect sequences [6] total 63 [2019-09-10 03:37:14,674 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:37:14,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-10 03:37:14,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-10 03:37:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3152, Unknown=0, NotChecked=0, Total=3422 [2019-09-10 03:37:14,677 INFO L87 Difference]: Start difference. First operand 1002 states and 1337 transitions. Second operand 59 states. [2019-09-10 03:37:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:37:59,870 INFO L93 Difference]: Finished difference Result 1026 states and 1361 transitions. [2019-09-10 03:37:59,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-10 03:37:59,871 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 337 [2019-09-10 03:37:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:37:59,876 INFO L225 Difference]: With dead ends: 1026 [2019-09-10 03:37:59,876 INFO L226 Difference]: Without dead ends: 1026 [2019-09-10 03:37:59,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1275, Invalid=9437, Unknown=0, NotChecked=0, Total=10712 [2019-09-10 03:37:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2019-09-10 03:37:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 1002. [2019-09-10 03:37:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2019-09-10 03:37:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1336 transitions. [2019-09-10 03:37:59,899 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1336 transitions. Word has length 337 [2019-09-10 03:37:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:37:59,899 INFO L475 AbstractCegarLoop]: Abstraction has 1002 states and 1336 transitions. [2019-09-10 03:37:59,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-10 03:37:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1336 transitions. [2019-09-10 03:37:59,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:37:59,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:37:59,903 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,904 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:37:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:37:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1049783463, now seen corresponding path program 1 times [2019-09-10 03:37:59,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:37:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:59,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:37:59,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:37:59,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:37:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-09-10 03:38:00,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:00,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:38:00,043 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:00,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:38:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:38:00,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:38:00,044 INFO L87 Difference]: Start difference. First operand 1002 states and 1336 transitions. Second operand 6 states. [2019-09-10 03:38:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:00,074 INFO L93 Difference]: Finished difference Result 1039 states and 1394 transitions. [2019-09-10 03:38:00,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:38:00,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-09-10 03:38:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:00,080 INFO L225 Difference]: With dead ends: 1039 [2019-09-10 03:38:00,080 INFO L226 Difference]: Without dead ends: 1039 [2019-09-10 03:38:00,080 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:38:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-09-10 03:38:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1007. [2019-09-10 03:38:00,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-09-10 03:38:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1340 transitions. [2019-09-10 03:38:00,100 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1340 transitions. Word has length 337 [2019-09-10 03:38:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:00,100 INFO L475 AbstractCegarLoop]: Abstraction has 1007 states and 1340 transitions. [2019-09-10 03:38:00,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:38:00,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1340 transitions. [2019-09-10 03:38:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:38:00,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:00,105 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,105 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 343186857, now seen corresponding path program 1 times [2019-09-10 03:38:00,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:00,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-10 03:38:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:38:00,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:00,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:38:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:38:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:38:00,279 INFO L87 Difference]: Start difference. First operand 1007 states and 1340 transitions. Second operand 6 states. [2019-09-10 03:38:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:00,312 INFO L93 Difference]: Finished difference Result 1075 states and 1448 transitions. [2019-09-10 03:38:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:38:00,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-09-10 03:38:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:00,317 INFO L225 Difference]: With dead ends: 1075 [2019-09-10 03:38:00,318 INFO L226 Difference]: Without dead ends: 1075 [2019-09-10 03:38:00,318 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:38:00,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-09-10 03:38:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1017. [2019-09-10 03:38:00,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2019-09-10 03:38:00,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1350 transitions. [2019-09-10 03:38:00,340 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1350 transitions. Word has length 337 [2019-09-10 03:38:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:00,340 INFO L475 AbstractCegarLoop]: Abstraction has 1017 states and 1350 transitions. [2019-09-10 03:38:00,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:38:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1350 transitions. [2019-09-10 03:38:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-09-10 03:38:00,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:00,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,347 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:00,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1963613686, now seen corresponding path program 1 times [2019-09-10 03:38:00,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:00,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:00,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-10 03:38:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:00,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:00,491 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:00,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:00,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:00,492 INFO L87 Difference]: Start difference. First operand 1017 states and 1350 transitions. Second operand 4 states. [2019-09-10 03:38:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:00,866 INFO L93 Difference]: Finished difference Result 1752 states and 2373 transitions. [2019-09-10 03:38:00,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:00,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 365 [2019-09-10 03:38:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:00,875 INFO L225 Difference]: With dead ends: 1752 [2019-09-10 03:38:00,875 INFO L226 Difference]: Without dead ends: 1752 [2019-09-10 03:38:00,876 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:38:00,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-09-10 03:38:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1745. [2019-09-10 03:38:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1745 states. [2019-09-10 03:38:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2367 transitions. [2019-09-10 03:38:00,908 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2367 transitions. Word has length 365 [2019-09-10 03:38:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:00,909 INFO L475 AbstractCegarLoop]: Abstraction has 1745 states and 2367 transitions. [2019-09-10 03:38:00,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2367 transitions. [2019-09-10 03:38:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:38:00,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:00,915 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,915 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:00,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash 10543719, now seen corresponding path program 1 times [2019-09-10 03:38:00,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:00,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:00,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:00,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-10 03:38:01,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:01,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:38:01,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:01,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:38:01,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:38:01,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:38:01,053 INFO L87 Difference]: Start difference. First operand 1745 states and 2367 transitions. Second operand 6 states. [2019-09-10 03:38:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:01,089 INFO L93 Difference]: Finished difference Result 1869 states and 2563 transitions. [2019-09-10 03:38:01,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:38:01,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-09-10 03:38:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:01,109 INFO L225 Difference]: With dead ends: 1869 [2019-09-10 03:38:01,110 INFO L226 Difference]: Without dead ends: 1869 [2019-09-10 03:38:01,110 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:38:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2019-09-10 03:38:01,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1765. [2019-09-10 03:38:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-09-10 03:38:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2387 transitions. [2019-09-10 03:38:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2387 transitions. Word has length 337 [2019-09-10 03:38:01,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:01,153 INFO L475 AbstractCegarLoop]: Abstraction has 1765 states and 2387 transitions. [2019-09-10 03:38:01,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:38:01,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2387 transitions. [2019-09-10 03:38:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-09-10 03:38:01,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:01,161 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,162 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:01,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:01,162 INFO L82 PathProgramCache]: Analyzing trace with hash -723763295, now seen corresponding path program 1 times [2019-09-10 03:38:01,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:01,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:01,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:01,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:01,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-09-10 03:38:01,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:01,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:01,431 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:01,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:01,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:01,433 INFO L87 Difference]: Start difference. First operand 1765 states and 2387 transitions. Second operand 4 states. [2019-09-10 03:38:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:01,815 INFO L93 Difference]: Finished difference Result 3226 states and 4417 transitions. [2019-09-10 03:38:01,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:01,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-09-10 03:38:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:01,827 INFO L225 Difference]: With dead ends: 3226 [2019-09-10 03:38:01,827 INFO L226 Difference]: Without dead ends: 3226 [2019-09-10 03:38:01,827 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:38:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states. [2019-09-10 03:38:01,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 3215. [2019-09-10 03:38:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3215 states. [2019-09-10 03:38:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4407 transitions. [2019-09-10 03:38:01,883 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4407 transitions. Word has length 366 [2019-09-10 03:38:01,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:01,884 INFO L475 AbstractCegarLoop]: Abstraction has 3215 states and 4407 transitions. [2019-09-10 03:38:01,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:01,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4407 transitions. [2019-09-10 03:38:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-10 03:38:01,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:01,892 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,892 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:01,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:01,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2131316759, now seen corresponding path program 1 times [2019-09-10 03:38:01,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:01,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:01,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-10 03:38:02,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:38:02,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:38:02,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 338 with the following transitions: [2019-09-10 03:38:02,054 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [277], [282], [296], [306], [308], [310], [311], [316], [322], [328], [334], [340], [346], [352], [358], [364], [370], [376], [382], [388], [394], [400], [406], [412], [418], [424], [430], [436], [442], [444], [445], [455], [457], [459], [460], [594], [597], [600], [604], [606], [608], [609], [610], [613], [616], [620], [622], [624], [625], [627], [628], [630], [635], [638], [643], [646], [651], [654], [657], [659], [662], [665], [667], [670], [673], [675], [678], [681], [683], [686], [689], [691], [694], [697], [699], [702], [705], [707], [710], [713], [715], [717], [747], [750], [804], [805], [806], [816], [818], [820], [821], [822], [832], [834], [836], [837], [842], [848], [854], [860], [866], [872], [878], [884], [890], [896], [902], [908], [914], [920], [926], [932], [938], [944], [950], [956], [962], [968], [970], [973], [979], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1037], [1038], [1041], [1044], [1048], [1050], [1052], [1053], [1056], [1058], [1061], [1072], [1074], [1076], [1080], [1088], [1091], [1092], [1093], [1096], [1099], [1103], [1105], [1107], [1108], [1109], [1118], [1121], [1124], [1130], [1133], [1152], [1165], [1178], [1191], [1204], [1217], [1230], [1243], [1256], [1269], [1275], [1285], [1287], [1289], [1290], [1291], [1301], [1303], [1305], [1306], [1307], [1308], [1322], [1324], [1357], [1358], [1377], [1378], [1379], [1383], [1384], [1385], [1386], [1387], [1388], [1389], [1390], [1391], [1392], [1393], [1394], [1395], [1396], [1397], [1398], [1399], [1400], [1401], [1402], [1403], [1404], [1405], [1406], [1409], [1410], [1411], [1413], [1414], [1415], [1416], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1445], [1446], [1447], [1467], [1468], [1469] [2019-09-10 03:38:02,057 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:38:02,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:38:02,146 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:38:02,146 INFO L272 AbstractInterpreter]: Visited 224 different actions 338 times. Never merged. Never widened. Performed 2429 root evaluator evaluations with a maximum evaluation depth of 4. Performed 2429 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 136 variables. [2019-09-10 03:38:02,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:02,147 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:38:02,489 INFO L227 lantSequenceWeakener]: Weakened 317 states. On average, predicates are now at 76.75% of their original sizes. [2019-09-10 03:38:02,490 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:38:15,619 INFO L420 sIntCurrentIteration]: We unified 336 AI predicates to 336 [2019-09-10 03:38:15,619 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:38:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:38:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [149] imperfect sequences [4] total 151 [2019-09-10 03:38:15,619 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:15,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-09-10 03:38:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-09-10 03:38:15,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1608, Invalid=20444, Unknown=0, NotChecked=0, Total=22052 [2019-09-10 03:38:15,623 INFO L87 Difference]: Start difference. First operand 3215 states and 4407 transitions. Second operand 149 states.