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.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:38:24,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:38:24,503 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:38:24,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:38:24,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:38:24,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:38:24,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:38:24,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:38:24,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:38:24,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:38:24,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:38:24,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:38:24,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:38:24,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:38:24,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:38:24,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:38:24,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:38:24,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:38:24,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:38:24,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:38:24,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:38:24,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:38:24,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:38:24,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:38:24,540 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:38:24,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:38:24,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:38:24,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:38:24,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:38:24,543 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:38:24,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:38:24,544 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:38:24,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:38:24,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:38:24,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:38:24,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:38:24,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:38:24,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:38:24,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:38:24,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:38:24,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:38:24,550 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:38:24,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:38:24,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:38:24,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:38:24,566 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:38:24,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:38:24,566 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:38:24,567 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:38:24,567 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:38:24,567 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:38:24,567 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:38:24,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:38:24,568 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:38:24,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:38:24,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:38:24,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:38:24,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:38:24,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:38:24,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:38:24,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:38:24,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:38:24,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:38:24,571 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:38:24,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:38:24,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:38:24,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:38:24,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:38:24,573 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:38:24,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:38:24,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:38:24,573 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:38:24,615 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:38:24,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:38:24,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:38:24,630 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:38:24,631 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:38:24,631 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.15.cil.c [2019-09-10 03:38:24,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb12c60f/0e2624c87a074531bfef711469b93b01/FLAGa626ffa8f [2019-09-10 03:38:25,251 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:38:25,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.15.cil.c [2019-09-10 03:38:25,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb12c60f/0e2624c87a074531bfef711469b93b01/FLAGa626ffa8f [2019-09-10 03:38:25,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efb12c60f/0e2624c87a074531bfef711469b93b01 [2019-09-10 03:38:25,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:38:25,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:38:25,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:38:25,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:38:25,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:38:25,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:38:25" (1/1) ... [2019-09-10 03:38:25,537 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f1723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:25, skipping insertion in model container [2019-09-10 03:38:25,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:38:25" (1/1) ... [2019-09-10 03:38:25,545 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:38:25,610 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:38:26,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:38:26,060 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:38:26,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:38:26,241 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:38:26,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26 WrapperNode [2019-09-10 03:38:26,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:38:26,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:38:26,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:38:26,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:38:26,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... [2019-09-10 03:38:26,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:38:26,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:38:26,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:38:26,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:38:26,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:38:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:38:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:38:26,462 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:38:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-09-10 03:38:26,463 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit5 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit6 [2019-09-10 03:38:26,464 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit7 [2019-09-10 03:38:26,465 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit8 [2019-09-10 03:38:26,466 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit9 [2019-09-10 03:38:26,467 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit10 [2019-09-10 03:38:26,467 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit11 [2019-09-10 03:38:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit12 [2019-09-10 03:38:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit13 [2019-09-10 03:38:26,470 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-09-10 03:38:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-09-10 03:38:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-09-10 03:38:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-09-10 03:38:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-09-10 03:38:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit5_triggered [2019-09-10 03:38:26,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit6_triggered [2019-09-10 03:38:26,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit7_triggered [2019-09-10 03:38:26,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit8_triggered [2019-09-10 03:38:26,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit9_triggered [2019-09-10 03:38:26,472 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit10_triggered [2019-09-10 03:38:26,473 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit11_triggered [2019-09-10 03:38:26,473 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit12_triggered [2019-09-10 03:38:26,473 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit13_triggered [2019-09-10 03:38:26,473 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:38:26,474 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:38:26,475 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:38:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:38:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:38:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-09-10 03:38:26,476 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-09-10 03:38:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-09-10 03:38:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-09-10 03:38:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-09-10 03:38:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit5_triggered [2019-09-10 03:38:26,477 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit6_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit7_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit8_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit9_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit10_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit11_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit12_triggered [2019-09-10 03:38:26,478 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit13_triggered [2019-09-10 03:38:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-09-10 03:38:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:38:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-09-10 03:38:26,479 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit5 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit6 [2019-09-10 03:38:26,480 INFO L130 BoogieDeclarations]: Found specification of procedure transmit7 [2019-09-10 03:38:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure transmit8 [2019-09-10 03:38:26,481 INFO L130 BoogieDeclarations]: Found specification of procedure transmit9 [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure transmit10 [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure transmit11 [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure transmit12 [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure transmit13 [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:38:26,482 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:38:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:38:26,483 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:38:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:38:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:38:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:38:26,484 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-10 03:38:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-10 03:38:26,485 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:38:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:38:26,486 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:38:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:38:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:38:26,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:38:27,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:38:27,945 INFO L283 CfgBuilder]: Removed 16 assume(true) statements. [2019-09-10 03:38:27,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:38:27 BoogieIcfgContainer [2019-09-10 03:38:27,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:38:27,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:38:27,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:38:27,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:38:27,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:38:25" (1/3) ... [2019-09-10 03:38:27,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b50a88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:38:27, skipping insertion in model container [2019-09-10 03:38:27,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:38:26" (2/3) ... [2019-09-10 03:38:27,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b50a88f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:38:27, skipping insertion in model container [2019-09-10 03:38:27,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:38:27" (3/3) ... [2019-09-10 03:38:27,955 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.15.cil.c [2019-09-10 03:38:27,966 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:38:27,975 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:38:27,993 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:38:28,023 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:38:28,024 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:38:28,024 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:38:28,024 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:38:28,024 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:38:28,025 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:38:28,025 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:38:28,025 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:38:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states. [2019-09-10 03:38:28,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:28,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:28,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:28,087 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:28,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:28,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1434129213, now seen corresponding path program 1 times [2019-09-10 03:38:28,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:28,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:28,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:28,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:28,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:28,694 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:38:28,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:28,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:28,697 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:28,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:28,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:28,722 INFO L87 Difference]: Start difference. First operand 509 states. Second operand 4 states. [2019-09-10 03:38:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:29,196 INFO L93 Difference]: Finished difference Result 507 states and 743 transitions. [2019-09-10 03:38:29,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:29,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:38:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:29,233 INFO L225 Difference]: With dead ends: 507 [2019-09-10 03:38:29,233 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 03:38:29,235 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:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 03:38:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-09-10 03:38:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 736 transitions. [2019-09-10 03:38:29,322 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 736 transitions. Word has length 246 [2019-09-10 03:38:29,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:29,324 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 736 transitions. [2019-09-10 03:38:29,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 736 transitions. [2019-09-10 03:38:29,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:29,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:29,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:29,332 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:29,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:29,332 INFO L82 PathProgramCache]: Analyzing trace with hash -770136895, now seen corresponding path program 1 times [2019-09-10 03:38:29,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:29,576 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:38:29,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:29,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:38:29,577 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:29,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:38:29,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:38:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:38:29,580 INFO L87 Difference]: Start difference. First operand 500 states and 736 transitions. Second operand 4 states. [2019-09-10 03:38:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:29,891 INFO L93 Difference]: Finished difference Result 500 states and 735 transitions. [2019-09-10 03:38:29,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:38:29,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:38:29,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:29,897 INFO L225 Difference]: With dead ends: 500 [2019-09-10 03:38:29,897 INFO L226 Difference]: Without dead ends: 500 [2019-09-10 03:38:29,898 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:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-09-10 03:38:29,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 500. [2019-09-10 03:38:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:29,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 735 transitions. [2019-09-10 03:38:29,933 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 735 transitions. Word has length 246 [2019-09-10 03:38:29,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:29,933 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 735 transitions. [2019-09-10 03:38:29,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:38:29,934 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 735 transitions. [2019-09-10 03:38:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:29,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:29,939 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:29,939 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash 992688831, now seen corresponding path program 1 times [2019-09-10 03:38:29,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:29,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:29,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:30,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:30,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:30,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:30,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:30,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:30,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:30,226 INFO L87 Difference]: Start difference. First operand 500 states and 735 transitions. Second operand 5 states. [2019-09-10 03:38:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:31,354 INFO L93 Difference]: Finished difference Result 574 states and 873 transitions. [2019-09-10 03:38:31,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:31,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:31,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:31,359 INFO L225 Difference]: With dead ends: 574 [2019-09-10 03:38:31,359 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 03:38:31,359 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:38:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 03:38:31,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-10 03:38:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 734 transitions. [2019-09-10 03:38:31,381 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 734 transitions. Word has length 246 [2019-09-10 03:38:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:31,382 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 734 transitions. [2019-09-10 03:38:31,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 734 transitions. [2019-09-10 03:38:31,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:31,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:31,386 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:31,387 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1238496705, now seen corresponding path program 1 times [2019-09-10 03:38:31,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:31,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:31,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:31,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:31,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:31,561 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:38:31,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:31,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:31,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:31,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:31,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:31,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:31,564 INFO L87 Difference]: Start difference. First operand 500 states and 734 transitions. Second operand 5 states. [2019-09-10 03:38:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:32,639 INFO L93 Difference]: Finished difference Result 574 states and 873 transitions. [2019-09-10 03:38:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:32,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:32,644 INFO L225 Difference]: With dead ends: 574 [2019-09-10 03:38:32,644 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 03:38:32,645 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:38:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 03:38:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-10 03:38:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 733 transitions. [2019-09-10 03:38:32,665 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 733 transitions. Word has length 246 [2019-09-10 03:38:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:32,665 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 733 transitions. [2019-09-10 03:38:32,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 733 transitions. [2019-09-10 03:38:32,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:32,669 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:32,669 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:32,670 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:32,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:32,670 INFO L82 PathProgramCache]: Analyzing trace with hash 969331327, now seen corresponding path program 1 times [2019-09-10 03:38:32,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:32,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:32,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:32,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:32,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:32,856 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:38:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:32,857 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:32,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:32,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:32,859 INFO L87 Difference]: Start difference. First operand 500 states and 733 transitions. Second operand 5 states. [2019-09-10 03:38:33,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:33,943 INFO L93 Difference]: Finished difference Result 572 states and 868 transitions. [2019-09-10 03:38:33,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:33,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:33,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:33,948 INFO L225 Difference]: With dead ends: 572 [2019-09-10 03:38:33,948 INFO L226 Difference]: Without dead ends: 572 [2019-09-10 03:38:33,948 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:38:33,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-10 03:38:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 500. [2019-09-10 03:38:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 732 transitions. [2019-09-10 03:38:33,967 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 732 transitions. Word has length 246 [2019-09-10 03:38:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:33,968 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 732 transitions. [2019-09-10 03:38:33,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 732 transitions. [2019-09-10 03:38:33,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:33,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:33,972 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:33,972 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:33,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1099195905, now seen corresponding path program 1 times [2019-09-10 03:38:33,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:33,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:33,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:34,131 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:38:34,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:34,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:34,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:34,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:34,135 INFO L87 Difference]: Start difference. First operand 500 states and 732 transitions. Second operand 5 states. [2019-09-10 03:38:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:35,115 INFO L93 Difference]: Finished difference Result 570 states and 863 transitions. [2019-09-10 03:38:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:35,116 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:35,121 INFO L225 Difference]: With dead ends: 570 [2019-09-10 03:38:35,121 INFO L226 Difference]: Without dead ends: 570 [2019-09-10 03:38:35,122 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:38:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-09-10 03:38:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 500. [2019-09-10 03:38:35,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 731 transitions. [2019-09-10 03:38:35,145 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 731 transitions. Word has length 246 [2019-09-10 03:38:35,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:35,147 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 731 transitions. [2019-09-10 03:38:35,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:35,147 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 731 transitions. [2019-09-10 03:38:35,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:35,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:35,150 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:35,151 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:35,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:35,151 INFO L82 PathProgramCache]: Analyzing trace with hash -974824897, now seen corresponding path program 1 times [2019-09-10 03:38:35,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:35,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:35,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:35,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:35,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:35,356 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:38:35,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:35,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:35,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:35,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:35,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:35,358 INFO L87 Difference]: Start difference. First operand 500 states and 731 transitions. Second operand 5 states. [2019-09-10 03:38:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:36,304 INFO L93 Difference]: Finished difference Result 568 states and 858 transitions. [2019-09-10 03:38:36,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:36,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:36,308 INFO L225 Difference]: With dead ends: 568 [2019-09-10 03:38:36,308 INFO L226 Difference]: Without dead ends: 568 [2019-09-10 03:38:36,309 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:38:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-10 03:38:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 500. [2019-09-10 03:38:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 730 transitions. [2019-09-10 03:38:36,324 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 730 transitions. Word has length 246 [2019-09-10 03:38:36,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:36,324 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 730 transitions. [2019-09-10 03:38:36,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 730 transitions. [2019-09-10 03:38:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:36,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:36,326 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:36,327 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:36,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:36,327 INFO L82 PathProgramCache]: Analyzing trace with hash 2006312513, now seen corresponding path program 1 times [2019-09-10 03:38:36,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:36,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:36,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:36,451 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:38:36,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:36,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:36,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:36,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:36,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:36,453 INFO L87 Difference]: Start difference. First operand 500 states and 730 transitions. Second operand 5 states. [2019-09-10 03:38:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:37,394 INFO L93 Difference]: Finished difference Result 566 states and 853 transitions. [2019-09-10 03:38:37,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:37,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:37,405 INFO L225 Difference]: With dead ends: 566 [2019-09-10 03:38:37,405 INFO L226 Difference]: Without dead ends: 566 [2019-09-10 03:38:37,405 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:38:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2019-09-10 03:38:37,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 500. [2019-09-10 03:38:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 729 transitions. [2019-09-10 03:38:37,427 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 729 transitions. Word has length 246 [2019-09-10 03:38:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:37,428 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 729 transitions. [2019-09-10 03:38:37,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 729 transitions. [2019-09-10 03:38:37,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:37,430 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:37,430 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:37,430 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:37,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:37,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1132646911, now seen corresponding path program 1 times [2019-09-10 03:38:37,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:37,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:37,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:37,558 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:38:37,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:37,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:37,559 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:37,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:37,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:37,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:37,560 INFO L87 Difference]: Start difference. First operand 500 states and 729 transitions. Second operand 5 states. [2019-09-10 03:38:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:39,112 INFO L93 Difference]: Finished difference Result 562 states and 844 transitions. [2019-09-10 03:38:39,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:39,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:39,123 INFO L225 Difference]: With dead ends: 562 [2019-09-10 03:38:39,124 INFO L226 Difference]: Without dead ends: 562 [2019-09-10 03:38:39,124 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:38:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-10 03:38:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 500. [2019-09-10 03:38:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 728 transitions. [2019-09-10 03:38:39,157 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 728 transitions. Word has length 246 [2019-09-10 03:38:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:39,158 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 728 transitions. [2019-09-10 03:38:39,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 728 transitions. [2019-09-10 03:38:39,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:39,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:39,162 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:39,162 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 278107453, now seen corresponding path program 1 times [2019-09-10 03:38:39,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:39,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:39,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:39,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:39,408 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:38:39,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:39,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:39,410 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:39,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:39,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:39,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:39,412 INFO L87 Difference]: Start difference. First operand 500 states and 728 transitions. Second operand 5 states. [2019-09-10 03:38:40,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:40,665 INFO L93 Difference]: Finished difference Result 560 states and 839 transitions. [2019-09-10 03:38:40,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:40,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:40,671 INFO L225 Difference]: With dead ends: 560 [2019-09-10 03:38:40,671 INFO L226 Difference]: Without dead ends: 560 [2019-09-10 03:38:40,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:38:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-09-10 03:38:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 500. [2019-09-10 03:38:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 727 transitions. [2019-09-10 03:38:40,695 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 727 transitions. Word has length 246 [2019-09-10 03:38:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:40,695 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 727 transitions. [2019-09-10 03:38:40,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 727 transitions. [2019-09-10 03:38:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:40,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:40,700 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:40,700 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:40,701 INFO L82 PathProgramCache]: Analyzing trace with hash -857836993, now seen corresponding path program 1 times [2019-09-10 03:38:40,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:40,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:40,918 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:38:40,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:40,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:40,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:40,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:40,920 INFO L87 Difference]: Start difference. First operand 500 states and 727 transitions. Second operand 5 states. [2019-09-10 03:38:41,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:41,939 INFO L93 Difference]: Finished difference Result 558 states and 834 transitions. [2019-09-10 03:38:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:41,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:41,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:41,948 INFO L225 Difference]: With dead ends: 558 [2019-09-10 03:38:41,948 INFO L226 Difference]: Without dead ends: 558 [2019-09-10 03:38:41,949 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:38:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-09-10 03:38:41,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 500. [2019-09-10 03:38:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:41,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 726 transitions. [2019-09-10 03:38:41,976 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 726 transitions. Word has length 246 [2019-09-10 03:38:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:41,979 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 726 transitions. [2019-09-10 03:38:41,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 726 transitions. [2019-09-10 03:38:41,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:41,984 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:41,985 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:41,989 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:41,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1725764355, now seen corresponding path program 1 times [2019-09-10 03:38:41,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:41,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:41,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:42,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:42,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:42,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:42,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:42,146 INFO L87 Difference]: Start difference. First operand 500 states and 726 transitions. Second operand 5 states. [2019-09-10 03:38:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:43,366 INFO L93 Difference]: Finished difference Result 556 states and 829 transitions. [2019-09-10 03:38:43,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:43,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:43,370 INFO L225 Difference]: With dead ends: 556 [2019-09-10 03:38:43,370 INFO L226 Difference]: Without dead ends: 556 [2019-09-10 03:38:43,371 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:38:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-09-10 03:38:43,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 500. [2019-09-10 03:38:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:43,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 725 transitions. [2019-09-10 03:38:43,385 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 725 transitions. Word has length 246 [2019-09-10 03:38:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:43,385 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 725 transitions. [2019-09-10 03:38:43,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 725 transitions. [2019-09-10 03:38:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:43,387 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:43,387 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:43,388 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:43,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1294279295, now seen corresponding path program 1 times [2019-09-10 03:38:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:43,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:43,501 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:38:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:43,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:43,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:43,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:43,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:43,503 INFO L87 Difference]: Start difference. First operand 500 states and 725 transitions. Second operand 5 states. [2019-09-10 03:38:44,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:44,749 INFO L93 Difference]: Finished difference Result 554 states and 824 transitions. [2019-09-10 03:38:44,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:44,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:44,755 INFO L225 Difference]: With dead ends: 554 [2019-09-10 03:38:44,756 INFO L226 Difference]: Without dead ends: 554 [2019-09-10 03:38:44,756 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:38:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-09-10 03:38:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 500. [2019-09-10 03:38:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 724 transitions. [2019-09-10 03:38:44,777 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 724 transitions. Word has length 246 [2019-09-10 03:38:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:44,778 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 724 transitions. [2019-09-10 03:38:44,778 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 724 transitions. [2019-09-10 03:38:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:44,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:44,782 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:44,782 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash 421868733, now seen corresponding path program 1 times [2019-09-10 03:38:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:44,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:44,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:45,010 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:38:45,010 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:45,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:45,011 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:45,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:45,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:45,014 INFO L87 Difference]: Start difference. First operand 500 states and 724 transitions. Second operand 5 states. [2019-09-10 03:38:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:46,425 INFO L93 Difference]: Finished difference Result 552 states and 819 transitions. [2019-09-10 03:38:46,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:46,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:46,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:46,430 INFO L225 Difference]: With dead ends: 552 [2019-09-10 03:38:46,430 INFO L226 Difference]: Without dead ends: 552 [2019-09-10 03:38:46,431 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:38:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2019-09-10 03:38:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 500. [2019-09-10 03:38:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 723 transitions. [2019-09-10 03:38:46,445 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 723 transitions. Word has length 246 [2019-09-10 03:38:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:46,446 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 723 transitions. [2019-09-10 03:38:46,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 723 transitions. [2019-09-10 03:38:46,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:46,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:46,448 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:46,449 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:46,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1545936193, now seen corresponding path program 1 times [2019-09-10 03:38:46,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:46,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:46,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:46,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:46,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:46,575 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:38:46,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:46,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:46,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:46,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:46,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:46,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:46,577 INFO L87 Difference]: Start difference. First operand 500 states and 723 transitions. Second operand 5 states. [2019-09-10 03:38:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:47,611 INFO L93 Difference]: Finished difference Result 550 states and 814 transitions. [2019-09-10 03:38:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:47,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:47,617 INFO L225 Difference]: With dead ends: 550 [2019-09-10 03:38:47,617 INFO L226 Difference]: Without dead ends: 550 [2019-09-10 03:38:47,621 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:38:47,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-09-10 03:38:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 500. [2019-09-10 03:38:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 722 transitions. [2019-09-10 03:38:47,643 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 722 transitions. Word has length 246 [2019-09-10 03:38:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:47,644 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 722 transitions. [2019-09-10 03:38:47,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 722 transitions. [2019-09-10 03:38:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:47,647 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:47,647 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:47,648 INFO L418 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:47,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:47,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1332319107, now seen corresponding path program 1 times [2019-09-10 03:38:47,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:47,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:47,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:47,904 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:38:47,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:47,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:47,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:47,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:47,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:47,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:47,910 INFO L87 Difference]: Start difference. First operand 500 states and 722 transitions. Second operand 5 states. [2019-09-10 03:38:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:48,890 INFO L93 Difference]: Finished difference Result 594 states and 898 transitions. [2019-09-10 03:38:48,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:48,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:48,895 INFO L225 Difference]: With dead ends: 594 [2019-09-10 03:38:48,895 INFO L226 Difference]: Without dead ends: 594 [2019-09-10 03:38:48,895 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:38:48,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-10 03:38:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 500. [2019-09-10 03:38:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:48,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 721 transitions. [2019-09-10 03:38:48,910 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 721 transitions. Word has length 246 [2019-09-10 03:38:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:48,910 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 721 transitions. [2019-09-10 03:38:48,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:48,910 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 721 transitions. [2019-09-10 03:38:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:48,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:48,912 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:48,912 INFO L418 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:48,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1032146363, now seen corresponding path program 1 times [2019-09-10 03:38:48,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:48,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:48,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:48,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:48,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:49,039 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:38:49,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:49,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:49,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:49,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:49,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:49,043 INFO L87 Difference]: Start difference. First operand 500 states and 721 transitions. Second operand 5 states. [2019-09-10 03:38:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:50,030 INFO L93 Difference]: Finished difference Result 596 states and 898 transitions. [2019-09-10 03:38:50,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:50,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:50,035 INFO L225 Difference]: With dead ends: 596 [2019-09-10 03:38:50,035 INFO L226 Difference]: Without dead ends: 596 [2019-09-10 03:38:50,036 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:38:50,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-09-10 03:38:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 500. [2019-09-10 03:38:50,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:50,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 720 transitions. [2019-09-10 03:38:50,050 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 720 transitions. Word has length 246 [2019-09-10 03:38:50,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:50,050 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 720 transitions. [2019-09-10 03:38:50,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 720 transitions. [2019-09-10 03:38:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:50,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:50,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:50,053 INFO L418 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash -692695875, now seen corresponding path program 1 times [2019-09-10 03:38:50,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:50,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:50,193 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:38:50,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:50,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:50,194 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:50,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:50,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:50,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:50,195 INFO L87 Difference]: Start difference. First operand 500 states and 720 transitions. Second operand 5 states. [2019-09-10 03:38:51,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:51,232 INFO L93 Difference]: Finished difference Result 594 states and 893 transitions. [2019-09-10 03:38:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:51,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:51,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:51,237 INFO L225 Difference]: With dead ends: 594 [2019-09-10 03:38:51,237 INFO L226 Difference]: Without dead ends: 594 [2019-09-10 03:38:51,237 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:38:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-09-10 03:38:51,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 500. [2019-09-10 03:38:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 719 transitions. [2019-09-10 03:38:51,254 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 719 transitions. Word has length 246 [2019-09-10 03:38:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:51,254 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 719 transitions. [2019-09-10 03:38:51,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 719 transitions. [2019-09-10 03:38:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:51,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:51,257 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:51,257 INFO L418 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1606968699, now seen corresponding path program 1 times [2019-09-10 03:38:51,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:51,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:51,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:51,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:51,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:51,381 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:38:51,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:51,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:51,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:51,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:51,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:51,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:51,385 INFO L87 Difference]: Start difference. First operand 500 states and 719 transitions. Second operand 5 states. [2019-09-10 03:38:52,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:52,399 INFO L93 Difference]: Finished difference Result 592 states and 888 transitions. [2019-09-10 03:38:52,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:52,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:52,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:52,404 INFO L225 Difference]: With dead ends: 592 [2019-09-10 03:38:52,404 INFO L226 Difference]: Without dead ends: 592 [2019-09-10 03:38:52,405 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:38:52,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-09-10 03:38:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 500. [2019-09-10 03:38:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 718 transitions. [2019-09-10 03:38:52,418 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 718 transitions. Word has length 246 [2019-09-10 03:38:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:52,419 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 718 transitions. [2019-09-10 03:38:52,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 718 transitions. [2019-09-10 03:38:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:52,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:52,421 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:52,421 INFO L418 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:52,422 INFO L82 PathProgramCache]: Analyzing trace with hash -674153219, now seen corresponding path program 1 times [2019-09-10 03:38:52,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:52,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:52,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:52,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:52,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:52,546 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:38:52,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:52,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:52,547 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:52,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:52,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:52,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:52,548 INFO L87 Difference]: Start difference. First operand 500 states and 718 transitions. Second operand 5 states. [2019-09-10 03:38:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:53,561 INFO L93 Difference]: Finished difference Result 590 states and 883 transitions. [2019-09-10 03:38:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:53,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:53,565 INFO L225 Difference]: With dead ends: 590 [2019-09-10 03:38:53,565 INFO L226 Difference]: Without dead ends: 590 [2019-09-10 03:38:53,565 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:38:53,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-09-10 03:38:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 500. [2019-09-10 03:38:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 717 transitions. [2019-09-10 03:38:53,578 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 717 transitions. Word has length 246 [2019-09-10 03:38:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:53,579 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 717 transitions. [2019-09-10 03:38:53,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:53,579 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 717 transitions. [2019-09-10 03:38:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:53,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:53,581 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:53,581 INFO L418 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:53,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash -747737797, now seen corresponding path program 1 times [2019-09-10 03:38:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:53,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:53,583 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:53,692 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:38:53,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:53,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:53,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:53,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:53,694 INFO L87 Difference]: Start difference. First operand 500 states and 717 transitions. Second operand 5 states. [2019-09-10 03:38:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:54,679 INFO L93 Difference]: Finished difference Result 588 states and 878 transitions. [2019-09-10 03:38:54,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:54,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:54,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:54,687 INFO L225 Difference]: With dead ends: 588 [2019-09-10 03:38:54,688 INFO L226 Difference]: Without dead ends: 588 [2019-09-10 03:38:54,688 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:38:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2019-09-10 03:38:54,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 500. [2019-09-10 03:38:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 716 transitions. [2019-09-10 03:38:54,703 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 716 transitions. Word has length 246 [2019-09-10 03:38:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:54,704 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 716 transitions. [2019-09-10 03:38:54,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 716 transitions. [2019-09-10 03:38:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:54,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:54,706 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:54,706 INFO L418 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1466645821, now seen corresponding path program 1 times [2019-09-10 03:38:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:54,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:54,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:54,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:54,825 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:38:54,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:54,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:54,825 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:54,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:54,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:54,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:54,827 INFO L87 Difference]: Start difference. First operand 500 states and 716 transitions. Second operand 5 states. [2019-09-10 03:38:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:55,773 INFO L93 Difference]: Finished difference Result 586 states and 873 transitions. [2019-09-10 03:38:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:55,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:55,779 INFO L225 Difference]: With dead ends: 586 [2019-09-10 03:38:55,779 INFO L226 Difference]: Without dead ends: 586 [2019-09-10 03:38:55,780 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:38:55,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-09-10 03:38:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 500. [2019-09-10 03:38:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 715 transitions. [2019-09-10 03:38:55,792 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 715 transitions. Word has length 246 [2019-09-10 03:38:55,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:55,792 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 715 transitions. [2019-09-10 03:38:55,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 715 transitions. [2019-09-10 03:38:55,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:55,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:55,794 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:55,795 INFO L418 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:55,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:55,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1953719547, now seen corresponding path program 1 times [2019-09-10 03:38:55,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:55,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:55,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:55,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:38:55,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:55,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:55,903 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:55,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:55,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:55,904 INFO L87 Difference]: Start difference. First operand 500 states and 715 transitions. Second operand 5 states. [2019-09-10 03:38:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:56,856 INFO L93 Difference]: Finished difference Result 582 states and 864 transitions. [2019-09-10 03:38:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:56,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:56,861 INFO L225 Difference]: With dead ends: 582 [2019-09-10 03:38:56,861 INFO L226 Difference]: Without dead ends: 582 [2019-09-10 03:38:56,861 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:38:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-10 03:38:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 500. [2019-09-10 03:38:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 714 transitions. [2019-09-10 03:38:56,873 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 714 transitions. Word has length 246 [2019-09-10 03:38:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:56,874 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 714 transitions. [2019-09-10 03:38:56,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 714 transitions. [2019-09-10 03:38:56,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:56,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:56,876 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:56,876 INFO L418 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:56,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:56,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1480483897, now seen corresponding path program 1 times [2019-09-10 03:38:56,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:56,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:56,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:56,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:38:56,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:56,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:56,983 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:56,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:56,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:56,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:56,986 INFO L87 Difference]: Start difference. First operand 500 states and 714 transitions. Second operand 5 states. [2019-09-10 03:38:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:57,990 INFO L93 Difference]: Finished difference Result 580 states and 859 transitions. [2019-09-10 03:38:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:57,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:57,994 INFO L225 Difference]: With dead ends: 580 [2019-09-10 03:38:57,994 INFO L226 Difference]: Without dead ends: 580 [2019-09-10 03:38:57,994 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:38:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-09-10 03:38:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 500. [2019-09-10 03:38:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 713 transitions. [2019-09-10 03:38:58,006 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 713 transitions. Word has length 246 [2019-09-10 03:38:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:58,006 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 713 transitions. [2019-09-10 03:38:58,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 713 transitions. [2019-09-10 03:38:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:58,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:58,008 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:58,008 INFO L418 AbstractCegarLoop]: === Iteration 25 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1603765563, now seen corresponding path program 1 times [2019-09-10 03:38:58,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:58,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:58,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:58,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:58,125 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:38:58,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:58,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:58,126 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:58,127 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:58,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:58,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:58,128 INFO L87 Difference]: Start difference. First operand 500 states and 713 transitions. Second operand 5 states. [2019-09-10 03:38:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:38:59,085 INFO L93 Difference]: Finished difference Result 578 states and 854 transitions. [2019-09-10 03:38:59,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:38:59,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:38:59,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:38:59,090 INFO L225 Difference]: With dead ends: 578 [2019-09-10 03:38:59,090 INFO L226 Difference]: Without dead ends: 578 [2019-09-10 03:38:59,090 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:38:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2019-09-10 03:38:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 500. [2019-09-10 03:38:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:38:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 712 transitions. [2019-09-10 03:38:59,102 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 712 transitions. Word has length 246 [2019-09-10 03:38:59,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:38:59,102 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 712 transitions. [2019-09-10 03:38:59,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:38:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 712 transitions. [2019-09-10 03:38:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:38:59,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:38:59,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:38:59,104 INFO L418 AbstractCegarLoop]: === Iteration 26 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:38:59,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:38:59,105 INFO L82 PathProgramCache]: Analyzing trace with hash -470467591, now seen corresponding path program 1 times [2019-09-10 03:38:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:38:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:59,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:38:59,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:38:59,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:38:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:38:59,199 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:38:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:38:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:38:59,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:38:59,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:38:59,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:38:59,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:38:59,201 INFO L87 Difference]: Start difference. First operand 500 states and 712 transitions. Second operand 5 states. [2019-09-10 03:39:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:00,197 INFO L93 Difference]: Finished difference Result 576 states and 849 transitions. [2019-09-10 03:39:00,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:39:00,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:39:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:00,207 INFO L225 Difference]: With dead ends: 576 [2019-09-10 03:39:00,207 INFO L226 Difference]: Without dead ends: 576 [2019-09-10 03:39:00,207 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:39:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-09-10 03:39:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 500. [2019-09-10 03:39:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:39:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 711 transitions. [2019-09-10 03:39:00,219 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 711 transitions. Word has length 246 [2019-09-10 03:39:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:00,219 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 711 transitions. [2019-09-10 03:39:00,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:39:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 711 transitions. [2019-09-10 03:39:00,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:39:00,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:00,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:39:00,221 INFO L418 AbstractCegarLoop]: === Iteration 27 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:00,222 INFO L82 PathProgramCache]: Analyzing trace with hash 432452987, now seen corresponding path program 1 times [2019-09-10 03:39:00,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:00,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:00,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:00,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:00,341 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:39:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:39:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:39:00,341 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:00,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:39:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:39:00,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:39:00,343 INFO L87 Difference]: Start difference. First operand 500 states and 711 transitions. Second operand 5 states. [2019-09-10 03:39:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:01,312 INFO L93 Difference]: Finished difference Result 574 states and 844 transitions. [2019-09-10 03:39:01,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:39:01,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 246 [2019-09-10 03:39:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:01,316 INFO L225 Difference]: With dead ends: 574 [2019-09-10 03:39:01,316 INFO L226 Difference]: Without dead ends: 574 [2019-09-10 03:39:01,317 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:39:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-09-10 03:39:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 500. [2019-09-10 03:39:01,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-09-10 03:39:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 710 transitions. [2019-09-10 03:39:01,327 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 710 transitions. Word has length 246 [2019-09-10 03:39:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:01,328 INFO L475 AbstractCegarLoop]: Abstraction has 500 states and 710 transitions. [2019-09-10 03:39:01,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:39:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 710 transitions. [2019-09-10 03:39:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-10 03:39:01,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:01,330 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:39:01,330 INFO L418 AbstractCegarLoop]: === Iteration 28 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:01,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 184484793, now seen corresponding path program 1 times [2019-09-10 03:39:01,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:01,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:01,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:01,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:01,450 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:39:01,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:39:01,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:39:01,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:01,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:39:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:39:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:39:01,452 INFO L87 Difference]: Start difference. First operand 500 states and 710 transitions. Second operand 4 states. [2019-09-10 03:39:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:01,897 INFO L93 Difference]: Finished difference Result 956 states and 1353 transitions. [2019-09-10 03:39:01,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 03:39:01,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 246 [2019-09-10 03:39:01,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:01,904 INFO L225 Difference]: With dead ends: 956 [2019-09-10 03:39:01,904 INFO L226 Difference]: Without dead ends: 956 [2019-09-10 03:39:01,905 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:39:01,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2019-09-10 03:39:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 955. [2019-09-10 03:39:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2019-09-10 03:39:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1352 transitions. [2019-09-10 03:39:01,931 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1352 transitions. Word has length 246 [2019-09-10 03:39:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:01,932 INFO L475 AbstractCegarLoop]: Abstraction has 955 states and 1352 transitions. [2019-09-10 03:39:01,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:39:01,932 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1352 transitions. [2019-09-10 03:39:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:39:01,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:01,936 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:39:01,937 INFO L418 AbstractCegarLoop]: === Iteration 29 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1747623780, now seen corresponding path program 1 times [2019-09-10 03:39:01,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:01,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:01,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:01,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:01,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-10 03:39:02,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:02,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:02,080 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:39:02,082 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [963], [964], [965], [968], [971], [979], [980], [983], [989], [995], [1001], [1009], [1013], [1019], [1025], [1031], [1037], [1043], [1049], [1057], [1061], [1067], [1073], [1079], [1085], [1091], [1097], [1105], [1109], [1115], [1121], [1127], [1133], [1139], [1145], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1249], [1250], [1251], [1254], [1257], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:39:02,128 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:02,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:02,340 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:02,345 INFO L272 AbstractInterpreter]: Visited 74 different actions 74 times. Never merged. Never widened. Performed 797 root evaluator evaluations with a maximum evaluation depth of 3. Performed 797 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:02,350 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:02,671 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 67.51% of their original sizes. [2019-09-10 03:39:02,671 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:03,354 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:39:03,354 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2019-09-10 03:39:03,356 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:03,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-10 03:39:03,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-10 03:39:03,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:39:03,358 INFO L87 Difference]: Start difference. First operand 955 states and 1352 transitions. Second operand 21 states. [2019-09-10 03:39:16,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:16,193 INFO L93 Difference]: Finished difference Result 1280 states and 1742 transitions. [2019-09-10 03:39:16,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:39:16,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 411 [2019-09-10 03:39:16,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:16,198 INFO L225 Difference]: With dead ends: 1280 [2019-09-10 03:39:16,198 INFO L226 Difference]: Without dead ends: 1280 [2019-09-10 03:39:16,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=378, Unknown=0, NotChecked=0, Total=600 [2019-09-10 03:39:16,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-09-10 03:39:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1250. [2019-09-10 03:39:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1250 states. [2019-09-10 03:39:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1711 transitions. [2019-09-10 03:39:16,224 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1711 transitions. Word has length 411 [2019-09-10 03:39:16,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:16,224 INFO L475 AbstractCegarLoop]: Abstraction has 1250 states and 1711 transitions. [2019-09-10 03:39:16,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-10 03:39:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1711 transitions. [2019-09-10 03:39:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:39:16,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:16,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:16,230 INFO L418 AbstractCegarLoop]: === Iteration 30 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:16,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash -48097739, now seen corresponding path program 1 times [2019-09-10 03:39:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:16,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:16,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-09-10 03:39:16,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:16,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:16,397 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:39:16,398 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:39:16,418 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:16,419 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:16,523 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:16,523 INFO L272 AbstractInterpreter]: Visited 85 different actions 85 times. Never merged. Never widened. Performed 877 root evaluator evaluations with a maximum evaluation depth of 4. Performed 877 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:16,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:16,524 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:16,777 INFO L227 lantSequenceWeakener]: Weakened 81 states. On average, predicates are now at 67.3% of their original sizes. [2019-09-10 03:39:16,777 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:17,593 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:39:17,593 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:17,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:17,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [6] total 30 [2019-09-10 03:39:17,594 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:17,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-10 03:39:17,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-10 03:39:17,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:39:17,596 INFO L87 Difference]: Start difference. First operand 1250 states and 1711 transitions. Second operand 26 states. [2019-09-10 03:39:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:39:37,316 INFO L93 Difference]: Finished difference Result 1267 states and 1713 transitions. [2019-09-10 03:39:37,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:39:37,316 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 411 [2019-09-10 03:39:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:39:37,322 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:39:37,322 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:39:37,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=357, Invalid=833, Unknown=0, NotChecked=0, Total=1190 [2019-09-10 03:39:37,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:39:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:39:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:39:37,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1682 transitions. [2019-09-10 03:39:37,347 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1682 transitions. Word has length 411 [2019-09-10 03:39:37,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:39:37,347 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1682 transitions. [2019-09-10 03:39:37,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-10 03:39:37,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1682 transitions. [2019-09-10 03:39:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:39:37,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:39:37,353 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:37,354 INFO L418 AbstractCegarLoop]: === Iteration 31 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:39:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash -965368777, now seen corresponding path program 1 times [2019-09-10 03:39:37,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:39:37,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:37,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:39:37,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:39:37,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:39:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:39:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-10 03:39:37,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:39:37,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:39:37,523 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:39:37,524 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:39:37,527 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:39:37,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:39:37,595 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:39:37,596 INFO L272 AbstractInterpreter]: Visited 95 different actions 95 times. Never merged. Never widened. Performed 956 root evaluator evaluations with a maximum evaluation depth of 4. Performed 956 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:39:37,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:39:37,596 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:39:37,721 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 67.57% of their original sizes. [2019-09-10 03:39:37,722 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:39:38,693 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:39:38,693 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:39:38,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:39:38,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [6] total 34 [2019-09-10 03:39:38,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:39:38,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-10 03:39:38,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-10 03:39:38,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2019-09-10 03:39:38,695 INFO L87 Difference]: Start difference. First operand 1237 states and 1682 transitions. Second operand 30 states. [2019-09-10 03:40:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:09,495 INFO L93 Difference]: Finished difference Result 1267 states and 1712 transitions. [2019-09-10 03:40:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-10 03:40:09,495 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 411 [2019-09-10 03:40:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:09,500 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:40:09,500 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:40:09,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 03:40:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:40:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:40:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:40:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1681 transitions. [2019-09-10 03:40:09,524 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1681 transitions. Word has length 411 [2019-09-10 03:40:09,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:09,525 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1681 transitions. [2019-09-10 03:40:09,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-10 03:40:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1681 transitions. [2019-09-10 03:40:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:40:09,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:09,531 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:09,531 INFO L418 AbstractCegarLoop]: === Iteration 32 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:09,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1711557118, now seen corresponding path program 1 times [2019-09-10 03:40:09,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:09,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 37 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-10 03:40:09,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:09,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:09,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:40:09,685 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [134], [150], [152], [160], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1384], [1397], [1410], [1414], [1417], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1789], [1790], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:40:09,687 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:09,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:09,735 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:09,735 INFO L272 AbstractInterpreter]: Visited 106 different actions 106 times. Never merged. Never widened. Performed 1036 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1036 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:40:09,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:09,736 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:09,880 INFO L227 lantSequenceWeakener]: Weakened 99 states. On average, predicates are now at 66.65% of their original sizes. [2019-09-10 03:40:09,880 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:11,208 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:40:11,208 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:11,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:11,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [6] total 38 [2019-09-10 03:40:11,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:11,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 03:40:11,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 03:40:11,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 03:40:11,210 INFO L87 Difference]: Start difference. First operand 1237 states and 1681 transitions. Second operand 34 states. [2019-09-10 03:40:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:40:46,582 INFO L93 Difference]: Finished difference Result 1267 states and 1709 transitions. [2019-09-10 03:40:46,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:40:46,582 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 442 [2019-09-10 03:40:46,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:40:46,589 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:40:46,590 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:40:46,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2019-09-10 03:40:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:40:46,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:40:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:40:46,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1678 transitions. [2019-09-10 03:40:46,613 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1678 transitions. Word has length 442 [2019-09-10 03:40:46,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:40:46,613 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1678 transitions. [2019-09-10 03:40:46,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 03:40:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1678 transitions. [2019-09-10 03:40:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:40:46,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:40:46,619 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:46,619 INFO L418 AbstractCegarLoop]: === Iteration 33 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:40:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1246079183, now seen corresponding path program 1 times [2019-09-10 03:40:46,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:40:46,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:40:46,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:40:46,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:40:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:40:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-09-10 03:40:46,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:40:46,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:40:46,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:40:46,883 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:40:46,886 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:40:46,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:40:46,980 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:40:46,981 INFO L272 AbstractInterpreter]: Visited 116 different actions 116 times. Never merged. Never widened. Performed 1115 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1115 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:40:46,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:40:46,981 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:40:47,191 INFO L227 lantSequenceWeakener]: Weakened 108 states. On average, predicates are now at 66.26% of their original sizes. [2019-09-10 03:40:47,191 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:40:48,842 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:40:48,842 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:40:48,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:40:48,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [38] imperfect sequences [6] total 42 [2019-09-10 03:40:48,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:40:48,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-10 03:40:48,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-10 03:40:48,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-09-10 03:40:48,845 INFO L87 Difference]: Start difference. First operand 1237 states and 1678 transitions. Second operand 38 states. [2019-09-10 03:41:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:41:24,627 INFO L93 Difference]: Finished difference Result 1267 states and 1707 transitions. [2019-09-10 03:41:24,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-10 03:41:24,628 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 442 [2019-09-10 03:41:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:41:24,632 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:41:24,632 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:41:24,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=735, Invalid=3047, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:41:24,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:41:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:41:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:41:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1676 transitions. [2019-09-10 03:41:24,653 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1676 transitions. Word has length 442 [2019-09-10 03:41:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:41:24,653 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1676 transitions. [2019-09-10 03:41:24,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-10 03:41:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1676 transitions. [2019-09-10 03:41:24,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:41:24,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:41:24,659 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,659 INFO L418 AbstractCegarLoop]: === Iteration 34 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:41:24,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1857229875, now seen corresponding path program 1 times [2019-09-10 03:41:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:41:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:24,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:41:24,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:41:24,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:41:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:41:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-09-10 03:41:24,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:41:24,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:41:24,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:41:24,861 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:41:24,865 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:41:24,865 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:41:24,982 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:41:24,983 INFO L272 AbstractInterpreter]: Visited 126 different actions 126 times. Never merged. Never widened. Performed 1194 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:41:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:41:24,983 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:41:25,187 INFO L227 lantSequenceWeakener]: Weakened 117 states. On average, predicates are now at 65.83% of their original sizes. [2019-09-10 03:41:25,187 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:41:27,316 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:41:27,316 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:41:27,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:41:27,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [42] imperfect sequences [6] total 46 [2019-09-10 03:41:27,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:41:27,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-10 03:41:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-10 03:41:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1533, Unknown=0, NotChecked=0, Total=1722 [2019-09-10 03:41:27,318 INFO L87 Difference]: Start difference. First operand 1237 states and 1676 transitions. Second operand 42 states. [2019-09-10 03:42:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:15,909 INFO L93 Difference]: Finished difference Result 1267 states and 1705 transitions. [2019-09-10 03:42:15,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-10 03:42:15,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 442 [2019-09-10 03:42:15,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:15,915 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:42:15,915 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:42:15,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=891, Invalid=4079, Unknown=0, NotChecked=0, Total=4970 [2019-09-10 03:42:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:42:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:42:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:42:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1674 transitions. [2019-09-10 03:42:15,935 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1674 transitions. Word has length 442 [2019-09-10 03:42:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:15,936 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1674 transitions. [2019-09-10 03:42:15,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-10 03:42:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1674 transitions. [2019-09-10 03:42:15,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:42:15,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:15,942 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:15,942 INFO L418 AbstractCegarLoop]: === Iteration 35 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash -973386511, now seen corresponding path program 1 times [2019-09-10 03:42:15,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:15,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:15,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-09-10 03:42:16,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:16,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:16,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:42:16,113 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:42:16,116 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:16,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:16,196 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:16,196 INFO L272 AbstractInterpreter]: Visited 137 different actions 137 times. Never merged. Never widened. Performed 1274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:42:16,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:16,197 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:16,337 INFO L227 lantSequenceWeakener]: Weakened 126 states. On average, predicates are now at 65.37% of their original sizes. [2019-09-10 03:42:16,337 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:19,013 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:42:19,013 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:19,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:19,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [46] imperfect sequences [6] total 50 [2019-09-10 03:42:19,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:19,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-10 03:42:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-10 03:42:19,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1874, Unknown=0, NotChecked=0, Total=2070 [2019-09-10 03:42:19,019 INFO L87 Difference]: Start difference. First operand 1237 states and 1674 transitions. Second operand 46 states. [2019-09-10 03:42:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:42:55,955 INFO L93 Difference]: Finished difference Result 1267 states and 1703 transitions. [2019-09-10 03:42:55,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 03:42:55,955 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 442 [2019-09-10 03:42:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:42:55,960 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:42:55,961 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:42:55,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1062, Invalid=5258, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 03:42:55,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:42:55,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:42:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:42:55,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1672 transitions. [2019-09-10 03:42:55,984 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1672 transitions. Word has length 442 [2019-09-10 03:42:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:42:55,984 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1672 transitions. [2019-09-10 03:42:55,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-10 03:42:55,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1672 transitions. [2019-09-10 03:42:55,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:42:55,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:42:55,990 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:55,990 INFO L418 AbstractCegarLoop]: === Iteration 36 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:42:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash -768432525, now seen corresponding path program 1 times [2019-09-10 03:42:55,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:42:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:55,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:42:55,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:42:55,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:42:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:42:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-09-10 03:42:56,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:42:56,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:42:56,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:42:56,196 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:42:56,199 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:42:56,199 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:42:56,265 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:42:56,265 INFO L272 AbstractInterpreter]: Visited 148 different actions 148 times. Never merged. Never widened. Performed 1354 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1354 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:42:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:42:56,266 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:42:56,462 INFO L227 lantSequenceWeakener]: Weakened 135 states. On average, predicates are now at 64.9% of their original sizes. [2019-09-10 03:42:56,462 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:42:59,937 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:42:59,937 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:42:59,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:42:59,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [50] imperfect sequences [6] total 54 [2019-09-10 03:42:59,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:42:59,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-10 03:42:59,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-10 03:42:59,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2246, Unknown=0, NotChecked=0, Total=2450 [2019-09-10 03:42:59,939 INFO L87 Difference]: Start difference. First operand 1237 states and 1672 transitions. Second operand 50 states. [2019-09-10 03:43:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:43:39,956 INFO L93 Difference]: Finished difference Result 1267 states and 1701 transitions. [2019-09-10 03:43:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-10 03:43:39,956 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 442 [2019-09-10 03:43:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:43:39,960 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:43:39,960 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:43:39,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1238 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1248, Invalid=6584, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 03:43:39,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:43:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:43:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:43:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1670 transitions. [2019-09-10 03:43:39,985 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1670 transitions. Word has length 442 [2019-09-10 03:43:39,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:43:39,985 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1670 transitions. [2019-09-10 03:43:39,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-10 03:43:39,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1670 transitions. [2019-09-10 03:43:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:43:39,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:43:39,990 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:39,990 INFO L418 AbstractCegarLoop]: === Iteration 37 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:43:39,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:39,991 INFO L82 PathProgramCache]: Analyzing trace with hash -155325705, now seen corresponding path program 1 times [2019-09-10 03:43:39,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:43:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:39,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:43:39,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:43:39,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:43:40,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:43:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-10 03:43:40,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:43:40,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:43:40,161 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:43:40,161 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:43:40,165 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:43:40,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:43:40,273 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:43:40,274 INFO L272 AbstractInterpreter]: Visited 159 different actions 159 times. Never merged. Never widened. Performed 1434 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1434 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:43:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:43:40,274 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:43:40,470 INFO L227 lantSequenceWeakener]: Weakened 144 states. On average, predicates are now at 68.59% of their original sizes. [2019-09-10 03:43:40,470 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:43:43,549 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:43:43,549 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:43:43,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:43:43,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [54] imperfect sequences [6] total 58 [2019-09-10 03:43:43,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:43:43,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-10 03:43:43,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-10 03:43:43,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2579, Unknown=0, NotChecked=0, Total=2862 [2019-09-10 03:43:43,552 INFO L87 Difference]: Start difference. First operand 1237 states and 1670 transitions. Second operand 54 states. [2019-09-10 03:44:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:44:28,907 INFO L93 Difference]: Finished difference Result 1267 states and 1700 transitions. [2019-09-10 03:44:28,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-10 03:44:28,907 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 411 [2019-09-10 03:44:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:44:28,911 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:44:28,911 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:44:28,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1183, Invalid=7007, Unknown=0, NotChecked=0, Total=8190 [2019-09-10 03:44:28,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:44:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:44:28,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:44:28,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1669 transitions. [2019-09-10 03:44:28,930 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1669 transitions. Word has length 411 [2019-09-10 03:44:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:44:28,930 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1669 transitions. [2019-09-10 03:44:28,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-10 03:44:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1669 transitions. [2019-09-10 03:44:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:44:28,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:44:28,935 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:28,935 INFO L418 AbstractCegarLoop]: === Iteration 38 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:44:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 227347765, now seen corresponding path program 1 times [2019-09-10 03:44:28,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:44:28,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:28,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:44:28,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:44:28,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:44:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:44:29,145 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-10 03:44:29,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:44:29,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:44:29,146 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:44:29,146 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:44:29,151 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:44:29,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:44:29,255 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:44:29,255 INFO L272 AbstractInterpreter]: Visited 169 different actions 169 times. Never merged. Never widened. Performed 1513 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1513 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:44:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:44:29,256 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:44:29,403 INFO L227 lantSequenceWeakener]: Weakened 153 states. On average, predicates are now at 68.7% of their original sizes. [2019-09-10 03:44:29,403 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:44:32,920 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:44:32,920 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:44:32,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:44:32,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [6] total 62 [2019-09-10 03:44:32,921 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:44:32,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:44:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:44:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=3007, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:44:32,923 INFO L87 Difference]: Start difference. First operand 1237 states and 1669 transitions. Second operand 58 states. [2019-09-10 03:45:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:45:13,582 INFO L93 Difference]: Finished difference Result 1267 states and 1699 transitions. [2019-09-10 03:45:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 03:45:13,582 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 411 [2019-09-10 03:45:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:45:13,587 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:45:13,587 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:45:13,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1317, Invalid=8385, Unknown=0, NotChecked=0, Total=9702 [2019-09-10 03:45:13,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:45:13,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:45:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:45:13,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1668 transitions. [2019-09-10 03:45:13,609 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1668 transitions. Word has length 411 [2019-09-10 03:45:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:45:13,609 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1668 transitions. [2019-09-10 03:45:13,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:45:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1668 transitions. [2019-09-10 03:45:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:45:13,612 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:45:13,613 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:13,613 INFO L418 AbstractCegarLoop]: === Iteration 39 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:45:13,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:45:13,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1173031025, now seen corresponding path program 1 times [2019-09-10 03:45:13,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:45:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:45:13,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:45:13,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:45:13,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:45:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:45:13,803 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-09-10 03:45:13,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:45:13,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:45:13,804 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:45:13,804 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:45:13,807 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:45:13,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:45:13,887 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:45:13,887 INFO L272 AbstractInterpreter]: Visited 179 different actions 179 times. Never merged. Never widened. Performed 1592 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1592 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:45:13,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:45:13,888 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:45:14,072 INFO L227 lantSequenceWeakener]: Weakened 162 states. On average, predicates are now at 63.39% of their original sizes. [2019-09-10 03:45:14,072 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:45:19,576 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:45:19,576 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:45:19,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:45:19,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [62] imperfect sequences [6] total 66 [2019-09-10 03:45:19,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:45:19,577 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-10 03:45:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-10 03:45:19,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3548, Unknown=0, NotChecked=0, Total=3782 [2019-09-10 03:45:19,578 INFO L87 Difference]: Start difference. First operand 1237 states and 1668 transitions. Second operand 62 states. [2019-09-10 03:46:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:46:23,496 INFO L93 Difference]: Finished difference Result 1267 states and 1695 transitions. [2019-09-10 03:46:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-10 03:46:23,497 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 442 [2019-09-10 03:46:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:46:23,501 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:46:23,501 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:46:23,502 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=1896, Invalid=11444, Unknown=0, NotChecked=0, Total=13340 [2019-09-10 03:46:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:46:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:46:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:46:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1664 transitions. [2019-09-10 03:46:23,519 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1664 transitions. Word has length 442 [2019-09-10 03:46:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:46:23,519 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1664 transitions. [2019-09-10 03:46:23,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-10 03:46:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1664 transitions. [2019-09-10 03:46:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:46:23,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:46:23,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:23,523 INFO L418 AbstractCegarLoop]: === Iteration 40 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:46:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1261526283, now seen corresponding path program 1 times [2019-09-10 03:46:23,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:46:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:46:23,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:46:23,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:46:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:46:23,690 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-10 03:46:23,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:46:23,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:46:23,691 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:46:23,692 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:46:23,695 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:46:23,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:46:23,869 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:46:23,870 INFO L272 AbstractInterpreter]: Visited 190 different actions 190 times. Never merged. Never widened. Performed 1672 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1672 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:46:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:46:23,870 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:46:24,032 INFO L227 lantSequenceWeakener]: Weakened 171 states. On average, predicates are now at 68.9% of their original sizes. [2019-09-10 03:46:24,032 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:46:28,668 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:46:28,668 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:46:28,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:46:28,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [66] imperfect sequences [6] total 70 [2019-09-10 03:46:28,669 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:46:28,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-09-10 03:46:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-09-10 03:46:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=3959, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 03:46:28,671 INFO L87 Difference]: Start difference. First operand 1237 states and 1664 transitions. Second operand 66 states. [2019-09-10 03:47:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:47:24,707 INFO L93 Difference]: Finished difference Result 1267 states and 1694 transitions. [2019-09-10 03:47:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-10 03:47:24,707 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 411 [2019-09-10 03:47:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:47:24,710 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:47:24,711 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:47:24,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1597, Invalid=11513, Unknown=0, NotChecked=0, Total=13110 [2019-09-10 03:47:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:47:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:47:24,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:47:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1663 transitions. [2019-09-10 03:47:24,726 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1663 transitions. Word has length 411 [2019-09-10 03:47:24,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:47:24,726 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1663 transitions. [2019-09-10 03:47:24,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-09-10 03:47:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1663 transitions. [2019-09-10 03:47:24,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:47:24,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:47:24,730 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:24,730 INFO L418 AbstractCegarLoop]: === Iteration 41 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:47:24,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:24,730 INFO L82 PathProgramCache]: Analyzing trace with hash -908869769, now seen corresponding path program 1 times [2019-09-10 03:47:24,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:47:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:47:24,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:47:24,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:47:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:47:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-09-10 03:47:24,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:47:24,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:47:24,910 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 412 with the following transitions: [2019-09-10 03:47:24,911 INFO L207 CegarAbsIntRunner]: [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:47:24,913 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:47:24,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:47:25,034 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:47:25,034 INFO L272 AbstractInterpreter]: Visited 201 different actions 201 times. Never merged. Never widened. Performed 1752 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1752 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:47:25,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:47:25,034 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:47:25,322 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 68.99% of their original sizes. [2019-09-10 03:47:25,323 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:47:30,682 INFO L420 sIntCurrentIteration]: We unified 410 AI predicates to 410 [2019-09-10 03:47:30,682 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:47:30,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:47:30,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [70] imperfect sequences [6] total 74 [2019-09-10 03:47:30,683 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:47:30,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-10 03:47:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-10 03:47:30,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=4483, Unknown=0, NotChecked=0, Total=4830 [2019-09-10 03:47:30,685 INFO L87 Difference]: Start difference. First operand 1237 states and 1663 transitions. Second operand 70 states. [2019-09-10 03:48:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:48:44,585 INFO L93 Difference]: Finished difference Result 1267 states and 1693 transitions. [2019-09-10 03:48:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-10 03:48:44,585 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 411 [2019-09-10 03:48:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:48:44,588 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:48:44,588 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:48:44,590 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1743, Invalid=13263, Unknown=0, NotChecked=0, Total=15006 [2019-09-10 03:48:44,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:48:44,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:48:44,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:48:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1662 transitions. [2019-09-10 03:48:44,605 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1662 transitions. Word has length 411 [2019-09-10 03:48:44,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:48:44,605 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1662 transitions. [2019-09-10 03:48:44,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-10 03:48:44,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1662 transitions. [2019-09-10 03:48:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:48:44,610 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:48:44,610 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:44,611 INFO L418 AbstractCegarLoop]: === Iteration 42 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:48:44,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:44,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2029404877, now seen corresponding path program 1 times [2019-09-10 03:48:44,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:48:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:44,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:48:44,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:48:44,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:48:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:48:44,828 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-09-10 03:48:44,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:48:44,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:48:44,829 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:48:44,830 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [737], [739], [742], [745], [747], [750], [753], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:48:44,833 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:48:44,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:48:44,923 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:48:44,924 INFO L272 AbstractInterpreter]: Visited 211 different actions 211 times. Never merged. Never widened. Performed 1831 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1831 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:48:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:48:44,925 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:48:45,142 INFO L227 lantSequenceWeakener]: Weakened 189 states. On average, predicates are now at 61.8% of their original sizes. [2019-09-10 03:48:45,143 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:48:53,641 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:48:53,641 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:48:53,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:48:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [74] imperfect sequences [6] total 78 [2019-09-10 03:48:53,642 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:48:53,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-10 03:48:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-10 03:48:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=5129, Unknown=0, NotChecked=0, Total=5402 [2019-09-10 03:48:53,644 INFO L87 Difference]: Start difference. First operand 1237 states and 1662 transitions. Second operand 74 states. [2019-09-10 03:50:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:33,378 INFO L93 Difference]: Finished difference Result 1267 states and 1689 transitions. [2019-09-10 03:50:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-10 03:50:33,378 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 442 [2019-09-10 03:50:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:33,381 INFO L225 Difference]: With dead ends: 1267 [2019-09-10 03:50:33,381 INFO L226 Difference]: Without dead ends: 1267 [2019-09-10 03:50:33,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=2679, Invalid=17627, Unknown=0, NotChecked=0, Total=20306 [2019-09-10 03:50:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2019-09-10 03:50:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1237. [2019-09-10 03:50:33,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-10 03:50:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1658 transitions. [2019-09-10 03:50:33,405 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1658 transitions. Word has length 442 [2019-09-10 03:50:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:33,405 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1658 transitions. [2019-09-10 03:50:33,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-10 03:50:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1658 transitions. [2019-09-10 03:50:33,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-09-10 03:50:33,410 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:33,411 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,411 INFO L418 AbstractCegarLoop]: === Iteration 43 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1669513655, now seen corresponding path program 1 times [2019-09-10 03:50:33,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:33,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:33,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-10 03:50:33,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:33,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:33,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:33,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:33,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:33,604 INFO L87 Difference]: Start difference. First operand 1237 states and 1658 transitions. Second operand 6 states. [2019-09-10 03:50:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:33,648 INFO L93 Difference]: Finished difference Result 1283 states and 1731 transitions. [2019-09-10 03:50:33,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:33,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 411 [2019-09-10 03:50:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:33,653 INFO L225 Difference]: With dead ends: 1283 [2019-09-10 03:50:33,653 INFO L226 Difference]: Without dead ends: 1283 [2019-09-10 03:50:33,653 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:50:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-09-10 03:50:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1242. [2019-09-10 03:50:33,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1242 states. [2019-09-10 03:50:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1242 states to 1242 states and 1662 transitions. [2019-09-10 03:50:33,679 INFO L78 Accepts]: Start accepts. Automaton has 1242 states and 1662 transitions. Word has length 411 [2019-09-10 03:50:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:33,680 INFO L475 AbstractCegarLoop]: Abstraction has 1242 states and 1662 transitions. [2019-09-10 03:50:33,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:33,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1242 states and 1662 transitions. [2019-09-10 03:50:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:50:33,685 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:33,686 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,686 INFO L418 AbstractCegarLoop]: === Iteration 44 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1320504657, now seen corresponding path program 1 times [2019-09-10 03:50:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-10 03:50:33,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:50:33,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 03:50:33,917 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:50:33,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:50:33,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:50:33,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:50:33,919 INFO L87 Difference]: Start difference. First operand 1242 states and 1662 transitions. Second operand 6 states. [2019-09-10 03:50:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:50:33,954 INFO L93 Difference]: Finished difference Result 1322 states and 1790 transitions. [2019-09-10 03:50:33,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:50:33,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 442 [2019-09-10 03:50:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:50:33,959 INFO L225 Difference]: With dead ends: 1322 [2019-09-10 03:50:33,959 INFO L226 Difference]: Without dead ends: 1322 [2019-09-10 03:50:33,959 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:50:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2019-09-10 03:50:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1252. [2019-09-10 03:50:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-09-10 03:50:33,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1672 transitions. [2019-09-10 03:50:33,984 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1672 transitions. Word has length 442 [2019-09-10 03:50:33,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:50:33,985 INFO L475 AbstractCegarLoop]: Abstraction has 1252 states and 1672 transitions. [2019-09-10 03:50:33,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:50:33,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1672 transitions. [2019-09-10 03:50:33,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-09-10 03:50:33,989 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:50:33,990 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,990 INFO L418 AbstractCegarLoop]: === Iteration 45 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:50:33,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:33,990 INFO L82 PathProgramCache]: Analyzing trace with hash 838579437, now seen corresponding path program 1 times [2019-09-10 03:50:33,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:50:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:50:33,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:50:33,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:50:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:50:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-10 03:50:34,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:50:34,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:50:34,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 443 with the following transitions: [2019-09-10 03:50:34,210 INFO L207 CegarAbsIntRunner]: [2], [18], [20], [28], [29], [32], [35], [39], [41], [43], [44], [248], [258], [260], [262], [263], [293], [298], [301], [304], [307], [311], [313], [315], [316], [328], [338], [340], [342], [343], [348], [354], [360], [366], [372], [378], [384], [390], [396], [402], [408], [414], [420], [426], [432], [438], [444], [450], [456], [462], [468], [474], [480], [486], [492], [498], [504], [510], [512], [513], [523], [525], [527], [528], [698], [708], [710], [712], [713], [714], [724], [726], [728], [729], [731], [732], [734], [739], [742], [745], [747], [750], [755], [758], [761], [763], [766], [769], [771], [774], [777], [779], [782], [785], [787], [790], [793], [795], [798], [801], [803], [806], [809], [811], [814], [817], [819], [822], [825], [827], [830], [833], [835], [838], [841], [843], [845], [875], [878], [947], [948], [949], [952], [955], [959], [961], [963], [964], [965], [968], [971], [975], [977], [979], [980], [985], [991], [997], [1003], [1009], [1015], [1021], [1027], [1033], [1039], [1045], [1051], [1057], [1063], [1069], [1075], [1081], [1087], [1093], [1099], [1105], [1111], [1117], [1123], [1129], [1135], [1141], [1147], [1149], [1152], [1158], [1164], [1170], [1176], [1182], [1188], [1194], [1200], [1206], [1212], [1218], [1224], [1230], [1234], [1235], [1238], [1241], [1245], [1247], [1249], [1250], [1251], [1254], [1257], [1261], [1263], [1265], [1266], [1267], [1270], [1272], [1275], [1286], [1288], [1290], [1294], [1320], [1323], [1324], [1325], [1328], [1331], [1335], [1337], [1339], [1340], [1341], [1350], [1353], [1356], [1362], [1365], [1368], [1375], [1378], [1384], [1397], [1410], [1423], [1436], [1449], [1462], [1475], [1488], [1501], [1514], [1527], [1540], [1546], [1556], [1558], [1560], [1561], [1562], [1572], [1574], [1576], [1577], [1578], [1579], [1593], [1595], [1715], [1716], [1735], [1736], [1737], [1741], [1742], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1751], [1752], [1753], [1754], [1755], [1756], [1757], [1758], [1759], [1760], [1761], [1762], [1763], [1764], [1765], [1766], [1767], [1768], [1769], [1770], [1773], [1774], [1775], [1779], [1780], [1781], [1782], [1783], [1784], [1809], [1810], [1811], [1812], [1813], [1814], [1815], [1816], [1817], [1818], [1819], [1839], [1840], [1841] [2019-09-10 03:50:34,213 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:50:34,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:50:34,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:50:34,515 INFO L272 AbstractInterpreter]: Visited 283 different actions 440 times. Merged at 4 different actions 4 times. Never widened. Performed 3970 root evaluator evaluations with a maximum evaluation depth of 4. Performed 3970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 172 variables. [2019-09-10 03:50:34,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:50:34,516 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:50:35,342 INFO L227 lantSequenceWeakener]: Weakened 407 states. On average, predicates are now at 73.33% of their original sizes. [2019-09-10 03:50:35,343 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:51:05,440 INFO L420 sIntCurrentIteration]: We unified 441 AI predicates to 441 [2019-09-10 03:51:05,440 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:51:05,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:51:05,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [199] imperfect sequences [4] total 201 [2019-09-10 03:51:05,441 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:51:05,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 199 states [2019-09-10 03:51:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2019-09-10 03:51:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2533, Invalid=36869, Unknown=0, NotChecked=0, Total=39402 [2019-09-10 03:51:05,446 INFO L87 Difference]: Start difference. First operand 1252 states and 1672 transitions. Second operand 199 states.