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/bist_cell.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:12:18,498 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:12:18,500 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:12:18,511 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:12:18,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:12:18,513 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:12:18,514 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:12:18,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:12:18,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:12:18,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:12:18,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:12:18,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:12:18,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:12:18,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:12:18,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:12:18,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:12:18,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:12:18,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:12:18,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:12:18,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:12:18,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:12:18,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:12:18,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:12:18,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:12:18,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:12:18,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:12:18,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:12:18,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:12:18,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:12:18,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:12:18,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:12:18,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:12:18,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:12:18,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:12:18,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:12:18,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:12:18,539 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:12:18,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:12:18,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:12:18,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:12:18,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:12:18,542 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:12:18,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:12:18,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:12:18,557 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:12:18,557 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:12:18,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:12:18,558 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:12:18,558 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:12:18,558 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:12:18,558 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:12:18,558 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:12:18,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:12:18,559 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:12:18,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:12:18,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:12:18,560 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:12:18,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:12:18,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:12:18,560 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:12:18,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:12:18,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:12:18,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:12:18,561 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:12:18,561 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:12:18,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:12:18,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:12:18,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:12:18,562 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:12:18,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:12:18,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:12:18,562 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:12:18,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:12:18,602 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:12:18,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:12:18,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:12:18,607 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:12:18,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-09-10 03:12:18,664 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754a723b/c08715290255401681a18db1927c7806/FLAGd1109ab2e [2019-09-10 03:12:19,150 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:12:19,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/bist_cell.cil.c [2019-09-10 03:12:19,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754a723b/c08715290255401681a18db1927c7806/FLAGd1109ab2e [2019-09-10 03:12:19,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0754a723b/c08715290255401681a18db1927c7806 [2019-09-10 03:12:19,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:12:19,518 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:12:19,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:12:19,519 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:12:19,522 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:12:19,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@664351b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19, skipping insertion in model container [2019-09-10 03:12:19,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,532 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:12:19,573 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:12:19,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:12:19,787 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:12:19,920 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:12:19,941 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:12:19,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19 WrapperNode [2019-09-10 03:12:19,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:12:19,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:12:19,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:12:19,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:12:19,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:19,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (1/1) ... [2019-09-10 03:12:20,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:12:20,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:12:20,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:12:20,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:12:20,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (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:12:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:12:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:12:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-10 03:12:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2019-09-10 03:12:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2019-09-10 03:12:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2019-09-10 03:12:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2019-09-10 03:12:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2019-09-10 03:12:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2019-09-10 03:12:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2019-09-10 03:12:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-10 03:12:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-10 03:12:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-10 03:12:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-10 03:12:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-10 03:12:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:12:20,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2019-09-10 03:12:20,057 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-10 03:12:20,058 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-10 03:12:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-10 03:12:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:12:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:12:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:12:20,566 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:12:20,566 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-10 03:12:20,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:12:20 BoogieIcfgContainer [2019-09-10 03:12:20,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:12:20,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:12:20,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:12:20,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:12:20,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:12:19" (1/3) ... [2019-09-10 03:12:20,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13789f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:12:20, skipping insertion in model container [2019-09-10 03:12:20,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:12:19" (2/3) ... [2019-09-10 03:12:20,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13789f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:12:20, skipping insertion in model container [2019-09-10 03:12:20,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:12:20" (3/3) ... [2019-09-10 03:12:20,574 INFO L109 eAbstractionObserver]: Analyzing ICFG bist_cell.cil.c [2019-09-10 03:12:20,583 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:12:20,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:12:20,631 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:12:20,659 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:12:20,659 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:12:20,659 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:12:20,659 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:12:20,660 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:12:20,660 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:12:20,660 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:12:20,660 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:12:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-10 03:12:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-10 03:12:20,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:20,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] [2019-09-10 03:12:20,709 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:20,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:20,715 INFO L82 PathProgramCache]: Analyzing trace with hash -778963544, now seen corresponding path program 1 times [2019-09-10 03:12:20,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:20,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:21,035 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:12:21,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:12:21,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 03:12:21,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:21,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 03:12:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 03:12:21,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 03:12:21,061 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2019-09-10 03:12:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:21,250 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2019-09-10 03:12:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:12:21,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-09-10 03:12:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:21,266 INFO L225 Difference]: With dead ends: 139 [2019-09-10 03:12:21,266 INFO L226 Difference]: Without dead ends: 134 [2019-09-10 03:12:21,268 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:12:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-09-10 03:12:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-09-10 03:12:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-10 03:12:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2019-09-10 03:12:21,336 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 58 [2019-09-10 03:12:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:21,338 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2019-09-10 03:12:21,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 03:12:21,339 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2019-09-10 03:12:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-10 03:12:21,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:21,355 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:21,355 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:21,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:21,356 INFO L82 PathProgramCache]: Analyzing trace with hash -820467770, now seen corresponding path program 1 times [2019-09-10 03:12:21,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:21,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:21,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:21,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:21,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:21,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:21,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:21,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 126 with the following transitions: [2019-09-10 03:12:21,646 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [222], [225], [244], [245], [251], [258], [265], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:21,697 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:21,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:21,800 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:21,801 INFO L272 AbstractInterpreter]: Visited 14 different actions 14 times. Never merged. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 3. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:21,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:21,806 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:21,896 INFO L227 lantSequenceWeakener]: Weakened 12 states. On average, predicates are now at 86.41% of their original sizes. [2019-09-10 03:12:21,896 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:21,905 INFO L420 sIntCurrentIteration]: We unified 124 AI predicates to 124 [2019-09-10 03:12:21,906 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:21,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:21,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-10 03:12:21,907 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:21,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:12:21,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:12:21,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:12:21,909 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 3 states. [2019-09-10 03:12:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:22,078 INFO L93 Difference]: Finished difference Result 138 states and 185 transitions. [2019-09-10 03:12:22,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:12:22,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-10 03:12:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:22,082 INFO L225 Difference]: With dead ends: 138 [2019-09-10 03:12:22,082 INFO L226 Difference]: Without dead ends: 138 [2019-09-10 03:12:22,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:12:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-10 03:12:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2019-09-10 03:12:22,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-10 03:12:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 180 transitions. [2019-09-10 03:12:22,097 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 180 transitions. Word has length 125 [2019-09-10 03:12:22,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:22,098 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 180 transitions. [2019-09-10 03:12:22,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:12:22,098 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 180 transitions. [2019-09-10 03:12:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-10 03:12:22,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:22,101 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,102 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:22,102 INFO L82 PathProgramCache]: Analyzing trace with hash 149420437, now seen corresponding path program 1 times [2019-09-10 03:12:22,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:22,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:22,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:22,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:22,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:22,299 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:22,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:22,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:22,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 131 with the following transitions: [2019-09-10 03:12:22,301 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [216], [220], [221], [222], [225], [244], [245], [248], [251], [258], [265], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:22,311 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:22,311 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:22,357 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:22,357 INFO L272 AbstractInterpreter]: Visited 21 different actions 21 times. Never merged. Never widened. Performed 188 root evaluator evaluations with a maximum evaluation depth of 3. Performed 188 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:22,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:22,358 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:22,445 INFO L227 lantSequenceWeakener]: Weakened 18 states. On average, predicates are now at 81.22% of their original sizes. [2019-09-10 03:12:22,445 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:22,474 INFO L420 sIntCurrentIteration]: We unified 129 AI predicates to 129 [2019-09-10 03:12:22,474 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:22,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-10 03:12:22,475 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:22,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:12:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:12:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:12:22,476 INFO L87 Difference]: Start difference. First operand 135 states and 180 transitions. Second operand 6 states. [2019-09-10 03:12:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:22,943 INFO L93 Difference]: Finished difference Result 144 states and 191 transitions. [2019-09-10 03:12:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:12:22,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-09-10 03:12:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:22,946 INFO L225 Difference]: With dead ends: 144 [2019-09-10 03:12:22,946 INFO L226 Difference]: Without dead ends: 144 [2019-09-10 03:12:22,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:12:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-10 03:12:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-09-10 03:12:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-10 03:12:22,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2019-09-10 03:12:22,977 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 130 [2019-09-10 03:12:22,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:22,977 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2019-09-10 03:12:22,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:12:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2019-09-10 03:12:22,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 03:12:22,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:22,984 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,984 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:22,984 INFO L82 PathProgramCache]: Analyzing trace with hash 852982624, now seen corresponding path program 1 times [2019-09-10 03:12:22,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:22,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:22,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:22,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:23,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:23,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:23,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 03:12:23,157 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [265], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:23,166 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:23,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:23,183 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:23,183 INFO L272 AbstractInterpreter]: Visited 28 different actions 28 times. Never merged. Never widened. Performed 218 root evaluator evaluations with a maximum evaluation depth of 3. Performed 218 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:23,184 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:23,243 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 78.06% of their original sizes. [2019-09-10 03:12:23,243 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:23,304 INFO L420 sIntCurrentIteration]: We unified 134 AI predicates to 134 [2019-09-10 03:12:23,304 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:23,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:23,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17 [2019-09-10 03:12:23,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:23,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:12:23,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:12:23,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:12:23,306 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand 9 states. [2019-09-10 03:12:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:23,994 INFO L93 Difference]: Finished difference Result 150 states and 197 transitions. [2019-09-10 03:12:23,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:12:23,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2019-09-10 03:12:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:23,996 INFO L225 Difference]: With dead ends: 150 [2019-09-10 03:12:23,996 INFO L226 Difference]: Without dead ends: 150 [2019-09-10 03:12:23,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:12:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-09-10 03:12:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-09-10 03:12:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-09-10 03:12:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 192 transitions. [2019-09-10 03:12:24,008 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 192 transitions. Word has length 135 [2019-09-10 03:12:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:24,009 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 192 transitions. [2019-09-10 03:12:24,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:12:24,009 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 192 transitions. [2019-09-10 03:12:24,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-10 03:12:24,011 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:24,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:24,012 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:24,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:24,012 INFO L82 PathProgramCache]: Analyzing trace with hash -439141822, now seen corresponding path program 1 times [2019-09-10 03:12:24,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:24,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:24,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:24,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:24,014 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:24,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:24,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:24,183 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 141 with the following transitions: [2019-09-10 03:12:24,184 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:24,186 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:24,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:24,199 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:24,199 INFO L272 AbstractInterpreter]: Visited 35 different actions 35 times. Never merged. Never widened. Performed 248 root evaluator evaluations with a maximum evaluation depth of 3. Performed 248 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:24,200 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:24,232 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 75.71% of their original sizes. [2019-09-10 03:12:24,232 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:24,316 INFO L420 sIntCurrentIteration]: We unified 139 AI predicates to 139 [2019-09-10 03:12:24,317 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:24,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:24,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 20 [2019-09-10 03:12:24,317 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:24,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 03:12:24,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 03:12:24,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:12:24,319 INFO L87 Difference]: Start difference. First operand 147 states and 192 transitions. Second operand 12 states. [2019-09-10 03:12:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:25,140 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2019-09-10 03:12:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:12:25,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 140 [2019-09-10 03:12:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:25,143 INFO L225 Difference]: With dead ends: 156 [2019-09-10 03:12:25,143 INFO L226 Difference]: Without dead ends: 156 [2019-09-10 03:12:25,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:12:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-10 03:12:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2019-09-10 03:12:25,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-10 03:12:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2019-09-10 03:12:25,160 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 140 [2019-09-10 03:12:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:25,161 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2019-09-10 03:12:25,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 03:12:25,163 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2019-09-10 03:12:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:25,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:25,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:25,170 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:25,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:25,170 INFO L82 PathProgramCache]: Analyzing trace with hash -404425876, now seen corresponding path program 1 times [2019-09-10 03:12:25,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:25,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:25,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:25,296 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-10 03:12:25,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:25,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:25,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 03:12:25,297 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [145], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:25,300 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:25,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:25,323 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:25,324 INFO L272 AbstractInterpreter]: Visited 38 different actions 38 times. Never merged. Never widened. Performed 272 root evaluator evaluations with a maximum evaluation depth of 4. Performed 272 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:25,324 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:25,378 INFO L227 lantSequenceWeakener]: Weakened 32 states. On average, predicates are now at 71.97% of their original sizes. [2019-09-10 03:12:25,379 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:25,502 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 03:12:25,503 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:25,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [5] total 16 [2019-09-10 03:12:25,503 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:25,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:12:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:12:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:12:25,505 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand 13 states. [2019-09-10 03:12:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:26,534 INFO L93 Difference]: Finished difference Result 155 states and 201 transitions. [2019-09-10 03:12:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:12:26,535 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 145 [2019-09-10 03:12:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:26,536 INFO L225 Difference]: With dead ends: 155 [2019-09-10 03:12:26,536 INFO L226 Difference]: Without dead ends: 155 [2019-09-10 03:12:26,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:12:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-10 03:12:26,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-09-10 03:12:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-09-10 03:12:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 201 transitions. [2019-09-10 03:12:26,545 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 201 transitions. Word has length 145 [2019-09-10 03:12:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:26,545 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 201 transitions. [2019-09-10 03:12:26,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:12:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 201 transitions. [2019-09-10 03:12:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:26,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:26,548 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,549 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash -875782226, now seen corresponding path program 1 times [2019-09-10 03:12:26,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:26,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:26,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:26,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:26,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:26,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:26,701 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 03:12:26,701 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:26,703 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:26,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:26,725 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:26,725 INFO L272 AbstractInterpreter]: Visited 53 different actions 53 times. Never merged. Never widened. Performed 332 root evaluator evaluations with a maximum evaluation depth of 3. Performed 332 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:26,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:26,726 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:26,779 INFO L227 lantSequenceWeakener]: Weakened 47 states. On average, predicates are now at 73.88% of their original sizes. [2019-09-10 03:12:26,780 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:27,019 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 03:12:27,020 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:27,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:27,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [10] total 27 [2019-09-10 03:12:27,021 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:27,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-10 03:12:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-10 03:12:27,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:12:27,026 INFO L87 Difference]: Start difference. First operand 155 states and 201 transitions. Second operand 19 states. [2019-09-10 03:12:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:28,804 INFO L93 Difference]: Finished difference Result 165 states and 209 transitions. [2019-09-10 03:12:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:12:28,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2019-09-10 03:12:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:28,808 INFO L225 Difference]: With dead ends: 165 [2019-09-10 03:12:28,808 INFO L226 Difference]: Without dead ends: 165 [2019-09-10 03:12:28,809 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:12:28,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-10 03:12:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-09-10 03:12:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-09-10 03:12:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 209 transitions. [2019-09-10 03:12:28,818 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 209 transitions. Word has length 145 [2019-09-10 03:12:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:28,820 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 209 transitions. [2019-09-10 03:12:28,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-10 03:12:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 209 transitions. [2019-09-10 03:12:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:28,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:28,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,823 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:28,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1818113964, now seen corresponding path program 1 times [2019-09-10 03:12:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:28,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:28,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 03:12:28,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:28,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:28,950 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 03:12:28,950 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [302], [304], [308], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:28,953 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:28,953 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:28,968 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:28,969 INFO L272 AbstractInterpreter]: Visited 55 different actions 55 times. Never merged. Never widened. Performed 335 root evaluator evaluations with a maximum evaluation depth of 3. Performed 335 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:28,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:28,969 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:29,004 INFO L227 lantSequenceWeakener]: Weakened 48 states. On average, predicates are now at 73.9% of their original sizes. [2019-09-10 03:12:29,005 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:29,200 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 03:12:29,200 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:29,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:29,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [10] total 28 [2019-09-10 03:12:29,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:29,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 03:12:29,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 03:12:29,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:12:29,202 INFO L87 Difference]: Start difference. First operand 165 states and 209 transitions. Second operand 20 states. [2019-09-10 03:12:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:31,305 INFO L93 Difference]: Finished difference Result 180 states and 223 transitions. [2019-09-10 03:12:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 03:12:31,306 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 145 [2019-09-10 03:12:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:31,308 INFO L225 Difference]: With dead ends: 180 [2019-09-10 03:12:31,308 INFO L226 Difference]: Without dead ends: 180 [2019-09-10 03:12:31,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:12:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-09-10 03:12:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-09-10 03:12:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-09-10 03:12:31,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 223 transitions. [2019-09-10 03:12:31,322 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 223 transitions. Word has length 145 [2019-09-10 03:12:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:31,322 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 223 transitions. [2019-09-10 03:12:31,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 03:12:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 223 transitions. [2019-09-10 03:12:31,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:31,325 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:31,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:31,326 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:31,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:31,326 INFO L82 PathProgramCache]: Analyzing trace with hash 761382762, now seen corresponding path program 1 times [2019-09-10 03:12:31,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:31,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:31,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:31,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:31,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-10 03:12:31,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:31,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:31,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 03:12:31,442 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [302], [304], [308], [310], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:31,444 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:31,444 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:31,474 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:31,474 INFO L272 AbstractInterpreter]: Visited 74 different actions 74 times. Never merged. Never widened. Performed 415 root evaluator evaluations with a maximum evaluation depth of 3. Performed 415 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:31,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:31,475 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:31,516 INFO L227 lantSequenceWeakener]: Weakened 66 states. On average, predicates are now at 73.92% of their original sizes. [2019-09-10 03:12:31,516 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:31,929 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 03:12:31,929 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:31,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:31,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [5] total 30 [2019-09-10 03:12:31,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:31,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-10 03:12:31,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-10 03:12:31,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:12:31,931 INFO L87 Difference]: Start difference. First operand 180 states and 223 transitions. Second operand 27 states. [2019-09-10 03:12:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:34,608 INFO L93 Difference]: Finished difference Result 182 states and 224 transitions. [2019-09-10 03:12:34,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-10 03:12:34,609 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 145 [2019-09-10 03:12:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:34,611 INFO L225 Difference]: With dead ends: 182 [2019-09-10 03:12:34,611 INFO L226 Difference]: Without dead ends: 182 [2019-09-10 03:12:34,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=737, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:12:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-10 03:12:34,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-09-10 03:12:34,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-10 03:12:34,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 224 transitions. [2019-09-10 03:12:34,619 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 224 transitions. Word has length 145 [2019-09-10 03:12:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:34,619 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 224 transitions. [2019-09-10 03:12:34,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-10 03:12:34,619 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 224 transitions. [2019-09-10 03:12:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-10 03:12:34,621 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:34,621 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:34,622 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:34,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:34,622 INFO L82 PathProgramCache]: Analyzing trace with hash -77650900, now seen corresponding path program 1 times [2019-09-10 03:12:34,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:34,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:34,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:34,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:34,729 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 03:12:34,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:34,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:34,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 146 with the following transitions: [2019-09-10 03:12:34,731 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [82], [88], [94], [96], [100], [106], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [176], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [302], [304], [308], [310], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:34,733 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:34,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:34,752 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:34,753 INFO L272 AbstractInterpreter]: Visited 77 different actions 77 times. Never merged. Never widened. Performed 420 root evaluator evaluations with a maximum evaluation depth of 3. Performed 420 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 47 variables. [2019-09-10 03:12:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:34,753 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:34,794 INFO L227 lantSequenceWeakener]: Weakened 68 states. On average, predicates are now at 73.89% of their original sizes. [2019-09-10 03:12:34,795 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:35,228 INFO L420 sIntCurrentIteration]: We unified 144 AI predicates to 144 [2019-09-10 03:12:35,228 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [8] total 35 [2019-09-10 03:12:35,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:35,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-10 03:12:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-10 03:12:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=743, Unknown=0, NotChecked=0, Total=812 [2019-09-10 03:12:35,231 INFO L87 Difference]: Start difference. First operand 182 states and 224 transitions. Second operand 29 states. [2019-09-10 03:12:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:40,773 INFO L93 Difference]: Finished difference Result 254 states and 302 transitions. [2019-09-10 03:12:40,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-10 03:12:40,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 145 [2019-09-10 03:12:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:40,777 INFO L225 Difference]: With dead ends: 254 [2019-09-10 03:12:40,777 INFO L226 Difference]: Without dead ends: 251 [2019-09-10 03:12:40,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2019-09-10 03:12:40,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-10 03:12:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2019-09-10 03:12:40,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-09-10 03:12:40,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 299 transitions. [2019-09-10 03:12:40,805 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 299 transitions. Word has length 145 [2019-09-10 03:12:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:40,806 INFO L475 AbstractCegarLoop]: Abstraction has 251 states and 299 transitions. [2019-09-10 03:12:40,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-10 03:12:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 299 transitions. [2019-09-10 03:12:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-10 03:12:40,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:40,811 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:40,811 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:40,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1987498830, now seen corresponding path program 1 times [2019-09-10 03:12:40,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:40,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:40,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:40,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:40,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-10 03:12:40,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:40,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:40,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 167 with the following transitions: [2019-09-10 03:12:40,964 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [17], [18], [19], [30], [42], [46], [65], [69], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [174], [176], [180], [183], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [279], [281], [284], [290], [296], [302], [304], [308], [310], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:40,967 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:40,967 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:41,014 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:41,014 INFO L272 AbstractInterpreter]: Visited 99 different actions 99 times. Never merged. Never widened. Performed 526 root evaluator evaluations with a maximum evaluation depth of 4. Performed 526 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 48 variables. [2019-09-10 03:12:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:41,015 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:41,135 INFO L227 lantSequenceWeakener]: Weakened 97 states. On average, predicates are now at 71.68% of their original sizes. [2019-09-10 03:12:41,135 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:42,761 INFO L420 sIntCurrentIteration]: We unified 165 AI predicates to 165 [2019-09-10 03:12:42,761 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:42,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [41] imperfect sequences [6] total 45 [2019-09-10 03:12:42,762 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:42,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-10 03:12:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-10 03:12:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1535, Unknown=0, NotChecked=0, Total=1640 [2019-09-10 03:12:42,765 INFO L87 Difference]: Start difference. First operand 251 states and 299 transitions. Second operand 41 states. [2019-09-10 03:12:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:52,075 INFO L93 Difference]: Finished difference Result 350 states and 426 transitions. [2019-09-10 03:12:52,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-10 03:12:52,075 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 166 [2019-09-10 03:12:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:52,078 INFO L225 Difference]: With dead ends: 350 [2019-09-10 03:12:52,078 INFO L226 Difference]: Without dead ends: 344 [2019-09-10 03:12:52,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=150, Invalid=2106, Unknown=0, NotChecked=0, Total=2256 [2019-09-10 03:12:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-09-10 03:12:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 330. [2019-09-10 03:12:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-10 03:12:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 402 transitions. [2019-09-10 03:12:52,092 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 402 transitions. Word has length 166 [2019-09-10 03:12:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:52,093 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 402 transitions. [2019-09-10 03:12:52,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-10 03:12:52,093 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 402 transitions. [2019-09-10 03:12:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 03:12:52,095 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:52,095 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:52,096 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1913425338, now seen corresponding path program 1 times [2019-09-10 03:12:52,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:52,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:52,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-10 03:12:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:12:52,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:12:52,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:52,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:12:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:12:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:12:52,162 INFO L87 Difference]: Start difference. First operand 330 states and 402 transitions. Second operand 3 states. [2019-09-10 03:12:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:12:52,184 INFO L93 Difference]: Finished difference Result 342 states and 414 transitions. [2019-09-10 03:12:52,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:12:52,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-10 03:12:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:12:52,187 INFO L225 Difference]: With dead ends: 342 [2019-09-10 03:12:52,187 INFO L226 Difference]: Without dead ends: 342 [2019-09-10 03:12:52,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:12:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-10 03:12:52,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 336. [2019-09-10 03:12:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-09-10 03:12:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 408 transitions. [2019-09-10 03:12:52,200 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 408 transitions. Word has length 173 [2019-09-10 03:12:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:12:52,200 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 408 transitions. [2019-09-10 03:12:52,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:12:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 408 transitions. [2019-09-10 03:12:52,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-10 03:12:52,203 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:12:52,203 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:12:52,203 INFO L418 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:12:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash 197944510, now seen corresponding path program 1 times [2019-09-10 03:12:52,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:12:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:52,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:12:52,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:12:52,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:12:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:12:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-10 03:12:52,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:12:52,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:12:52,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 175 with the following transitions: [2019-09-10 03:12:52,368 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [39], [46], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [174], [176], [180], [183], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [276], [279], [281], [284], [290], [296], [302], [304], [308], [310], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:12:52,370 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:12:52,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:12:52,391 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:12:52,391 INFO L272 AbstractInterpreter]: Visited 104 different actions 104 times. Never merged. Never widened. Performed 533 root evaluator evaluations with a maximum evaluation depth of 4. Performed 533 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Never found a fixpoint. Largest state had 48 variables. [2019-09-10 03:12:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:12:52,391 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:12:52,448 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 69.45% of their original sizes. [2019-09-10 03:12:52,448 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:12:53,484 INFO L420 sIntCurrentIteration]: We unified 173 AI predicates to 173 [2019-09-10 03:12:53,484 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:12:53,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:12:53,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [45] imperfect sequences [11] total 54 [2019-09-10 03:12:53,485 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:12:53,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-10 03:12:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-10 03:12:53,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1838, Unknown=0, NotChecked=0, Total=1980 [2019-09-10 03:12:53,487 INFO L87 Difference]: Start difference. First operand 336 states and 408 transitions. Second operand 45 states. [2019-09-10 03:13:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:05,051 INFO L93 Difference]: Finished difference Result 346 states and 416 transitions. [2019-09-10 03:13:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-10 03:13:05,051 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2019-09-10 03:13:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:05,054 INFO L225 Difference]: With dead ends: 346 [2019-09-10 03:13:05,054 INFO L226 Difference]: Without dead ends: 346 [2019-09-10 03:13:05,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=3034, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:13:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-09-10 03:13:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 332. [2019-09-10 03:13:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-10 03:13:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 398 transitions. [2019-09-10 03:13:05,066 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 398 transitions. Word has length 174 [2019-09-10 03:13:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:05,067 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 398 transitions. [2019-09-10 03:13:05,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-10 03:13:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 398 transitions. [2019-09-10 03:13:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 03:13:05,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:05,070 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:05,070 INFO L418 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:05,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1125369813, now seen corresponding path program 1 times [2019-09-10 03:13:05,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:05,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:05,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:05,129 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-10 03:13:05,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:13:05,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 03:13:05,130 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:05,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 03:13:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 03:13:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:05,131 INFO L87 Difference]: Start difference. First operand 332 states and 398 transitions. Second operand 3 states. [2019-09-10 03:13:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:05,146 INFO L93 Difference]: Finished difference Result 345 states and 415 transitions. [2019-09-10 03:13:05,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 03:13:05,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-10 03:13:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:05,148 INFO L225 Difference]: With dead ends: 345 [2019-09-10 03:13:05,148 INFO L226 Difference]: Without dead ends: 345 [2019-09-10 03:13:05,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 03:13:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-10 03:13:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2019-09-10 03:13:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-10 03:13:05,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 408 transitions. [2019-09-10 03:13:05,160 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 408 transitions. Word has length 175 [2019-09-10 03:13:05,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:05,160 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 408 transitions. [2019-09-10 03:13:05,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 03:13:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 408 transitions. [2019-09-10 03:13:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-10 03:13:05,163 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:13:05,163 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:13:05,163 INFO L418 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:13:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2111759405, now seen corresponding path program 1 times [2019-09-10 03:13:05,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:13:05,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:13:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:13:05,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:13:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:13:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 03:13:05,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:13:05,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:13:05,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2019-09-10 03:13:05,250 INFO L207 CegarAbsIntRunner]: [0], [2], [5], [9], [10], [13], [15], [17], [18], [19], [22], [25], [34], [37], [48], [53], [65], [71], [74], [78], [79], [82], [88], [94], [96], [100], [106], [108], [110], [115], [117], [118], [123], [130], [135], [139], [140], [143], [147], [148], [149], [150], [153], [157], [158], [159], [168], [171], [174], [176], [180], [183], [194], [195], [197], [200], [204], [205], [208], [212], [213], [216], [220], [221], [222], [225], [244], [245], [248], [251], [255], [258], [262], [265], [269], [272], [276], [279], [281], [284], [290], [296], [302], [304], [308], [310], [312], [313], [327], [329], [331], [333], [338], [341], [347], [351], [352], [353], [354], [355], [356], [357], [358], [359], [361], [362], [363], [364], [365], [366], [367], [368], [369], [370], [371], [372], [373], [374], [375], [376], [377], [378], [379], [380], [381], [382], [383], [384], [385], [386], [387], [388], [389], [390], [391], [392], [393], [394], [395], [396], [397], [398], [399], [400], [401] [2019-09-10 03:13:05,252 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:13:05,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:13:05,296 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:13:05,297 INFO L272 AbstractInterpreter]: Visited 121 different actions 148 times. Merged at 8 different actions 8 times. Never widened. Performed 815 root evaluator evaluations with a maximum evaluation depth of 4. Performed 815 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 2 fixpoints after 2 different actions. Largest state had 48 variables. [2019-09-10 03:13:05,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:13:05,297 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:13:05,391 INFO L227 lantSequenceWeakener]: Weakened 124 states. On average, predicates are now at 71.47% of their original sizes. [2019-09-10 03:13:05,392 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:13:07,148 INFO L420 sIntCurrentIteration]: We unified 174 AI predicates to 174 [2019-09-10 03:13:07,148 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:13:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:13:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [58] imperfect sequences [7] total 63 [2019-09-10 03:13:07,149 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:13:07,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-10 03:13:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-10 03:13:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3090, Unknown=0, NotChecked=0, Total=3306 [2019-09-10 03:13:07,151 INFO L87 Difference]: Start difference. First operand 339 states and 408 transitions. Second operand 58 states. [2019-09-10 03:13:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:13:27,181 INFO L93 Difference]: Finished difference Result 259 states and 284 transitions. [2019-09-10 03:13:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-09-10 03:13:27,181 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 175 [2019-09-10 03:13:27,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:13:27,182 INFO L225 Difference]: With dead ends: 259 [2019-09-10 03:13:27,182 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 03:13:27,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2201 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=971, Invalid=8929, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 03:13:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 03:13:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 03:13:27,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 03:13:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 03:13:27,187 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 175 [2019-09-10 03:13:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:13:27,187 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 03:13:27,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-10 03:13:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 03:13:27,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 03:13:27,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:13:27 BoogieIcfgContainer [2019-09-10 03:13:27,191 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:13:27,193 INFO L168 Benchmark]: Toolchain (without parser) took 67674.66 ms. Allocated memory was 136.3 MB in the beginning and 666.4 MB in the end (delta: 530.1 MB). Free memory was 92.2 MB in the beginning and 342.6 MB in the end (delta: -250.4 MB). Peak memory consumption was 279.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,194 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.09 ms. Allocated memory was 136.3 MB in the beginning and 202.9 MB in the end (delta: 66.6 MB). Free memory was 92.0 MB in the beginning and 177.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,195 INFO L168 Benchmark]: Boogie Preprocessor took 61.91 ms. Allocated memory is still 202.9 MB. Free memory was 177.9 MB in the beginning and 176.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,196 INFO L168 Benchmark]: RCFGBuilder took 563.18 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 143.9 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,197 INFO L168 Benchmark]: TraceAbstraction took 66623.13 ms. Allocated memory was 202.9 MB in the beginning and 666.4 MB in the end (delta: 463.5 MB). Free memory was 143.4 MB in the beginning and 342.6 MB in the end (delta: -199.2 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. [2019-09-10 03:13:27,200 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 136.3 MB. Free memory was 110.7 MB in the beginning and 110.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 423.09 ms. Allocated memory was 136.3 MB in the beginning and 202.9 MB in the end (delta: 66.6 MB). Free memory was 92.0 MB in the beginning and 177.9 MB in the end (delta: -85.9 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.91 ms. Allocated memory is still 202.9 MB. Free memory was 177.9 MB in the beginning and 176.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 563.18 ms. Allocated memory is still 202.9 MB. Free memory was 175.5 MB in the beginning and 143.9 MB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66623.13 ms. Allocated memory was 202.9 MB in the beginning and 666.4 MB in the end (delta: 463.5 MB). Free memory was 143.4 MB in the beginning and 342.6 MB in the end (delta: -199.2 MB). Peak memory consumption was 264.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 141 locations, 1 error locations. SAFE Result, 66.5s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 56.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2522 SDtfs, 1425 SDslu, 19868 SDs, 0 SdLazy, 15915 SolverSat, 602 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1834 GetRequests, 1506 SyntacticMatches, 0 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3999 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 12 AbstIntIterations, 12 AbstIntStrong, 0.9941005518344356 AbsIntWeakeningRatio, 0.6251422070534699 AbsIntAvgWeakeningVarsNumRemoved, 11.157565415244596 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2176 NumberOfCodeBlocks, 2176 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2161 ConstructedInterpolants, 0 QuantifiedInterpolants, 550683 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 434/588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...